ppxscal/embedding_network huggingface dataset:
A power control MAC protocol for ad hoc networks
Authors: Eun-Sun Jung, Nitin H. Vaidya
Venue: Wireless Networks (2005)

This paper presents a power control MAC protocol that allows nodes to vary transmit power level on a per-packet basis. Several researchers have proposed simple modifications of IEEE 802.11 to incorporate power control. The main idea of these power control schemes is to use different power levels for RTS-CTS and DATA-ACK. Specifically, maximum transmit power is used for RTS-CTS, and the minimum required transmit power is used for DATA-ACK transmissions in order to save energy. However, we show that these schemes can degrade network throughput and can result in higher energy consumption than when using IEEE 802.11 without power control. We propose a power control protocol which does not degrade throughput and yields energy saving.
Evolution of the Teacher Roles and Figures in E-learning Environments
Authors: M. Elena Rodriguez, Montse Serra, Jordi Cabot, Isabel Guitart
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The use of Information and Communication Technologies (ICT) in education has made feasible distance learning in the form of e-learning. To succeed in e-learning we cannot just try to replicate traditional educational methods. ICT force us to review some long-held assumptions in relation to pedagogical principles and practices. In this sense, a key issue is the evolution of the teacher roles in such new ICT environment. This is the main focus of this paper. The results are based on the author experience in both conventional and e-learning environments.
Realistic and responsive network traffic generation
Authors: Kashi Venkatesh Vishwanath, Amin Vahdat
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

This paper presents Swing, a closed-loop, network-responsive traffic generator that accurately captures the packet interactions of a range of applications using a simple structural model. Starting from observed traffic at a single point in the network, Swing automatically extracts distributions for user, application, and network behavior. It then generates live traffic corresponding to the underlying models in a network emulation environment running commodity network protocol stacks. We find that the generated traces are statistically similar to the original traces. Further, to the best of our knowledge, we are the first to reproduce burstiness in traffic across a range of timescales using a model applicable to a variety of network settings. An initial sensitivity analysis reveals the importance of capturing and recreating user, application, and network characteristics to accurately reproduce such burstiness. Finally, we explore Swing's ability to vary user characteristics, application properties, and wide-area network conditions to project traffic characteristics into alternate scenarios.
Visualizing the Invisible: The CONNECT Approach for Teaching Science
Authors: Sofoklis Sotiriou, Stamatina Anastopoulou, Sherman Rosenfeld, Osnat Aharoni, Avi Hofstein, Franz Bogner, Heike Sturm, Kay Hoeksema
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The CONNECT1 project proposes a pedagogical and technological approach that crosscuts the boundaries between schools and science museums and involves both students and teachers in extended episodes of playful learning. It develops, tests and evaluates learning pathways to facilitate in situ learning that will be implemented in ambient, always available educational environments developed with emerging technology. This paper focuses on the first results from the project's implementation in Greece.
Towards High-Level Programming for Distributed Problem Solving
Authors: Ryan F. Kelly, Adrian R. Pearce
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog language, several challenges are encountered when moving to a multi-agent setting. Key to our approach is a better representation of the dynamics of multi-agent teams by means of the following features: a robust combination of true concurrency of actions with the interleaved concurrency of ConGolog; an explicit notion of time to assist coordination; and semantic support for predictable exogenous actions (also called "natural actions"). The result is MIndiGolog, a new Golog variant suitable for distributed, cooperative execution by a multi-agent team.
Frequency-domain conditions for cycle-slipping in discrete system with periodic nonlinearity
Authors: V. B. Smirnova, N. V. Utina, A. I. Shepeljavyi
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The property that the phase-error /spl sigma/(t) increases at least by k/spl Delta/, where k is an integer and /spl Delta/ is the period of the nonlinearity, when t tends to infinity, is called in communication systems "cycle-slipping". For the case of continuous synchronization systems this property is considered. In this paper we extend the analysis to discrete synchronization systems.
Mining Correlation between Motifs and Gene Expression
Authors: Yi Lu, Shiyong Lu, Adrian E. Platts, Stephen A. Krawetz
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

One of the major challenges in the post-genomic era is to determine all DNA-binding transcription factors (TFs) and their regulatory binding sites (motifs) within the genomes. To discover the relationship between the motifs and changes in gene expression, we propose a new algorithm, Co-Miner (Correlation Miner). Correlation rules are generated based on the expression profiles of genes with significant expression change through the time course of gene expression. Thus, we may consider the change in gene expression to be causatively associated with the transcription binding sites in the upstream sequences. In addition, we introduce partition and constraint pushing techniques to improve the performance and demonstrate their effectiveness by our experiments. By applying Co-Miner to a yeast dataset, the relationships between motifs and gene expression revealed by Co-Miner are confirmed in the literature.
Developing and Managing Trust in Peer-to-Peer Systems
Authors: Liang Ge, Junzhou Luo, Yaobin Xu
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Peer to Peer(P2P) systems are becomrng more and more popular Wath the popularrty, there are many secunty concerns about P2P systems and the mqor solutron 1s to burld a trust system Whzle most o f the works are about how to buzld sound trust systems, there zs relatzvely less work focusrng on the trust management how to store, access and update trust values In thrs paper, we purpose a deszgn of the trust model that not only presents a trust computatzon mechanzsm but also lays the emphasrs on the trust managemen1 The trust computatlon mechan~sm u completely drstrrbuted and sensrtrve to the deceptzve peers The trust management zs also dzstrzbuted and provides anonymity, relzabzlzfy In the P2P systems
Finding Minimal Parameterizations of Cylindrical Image Manifolds
Authors: Michael Dixon, Nathan Jacobs, Robert Pless
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Manifold learning has become an important tool to characterize high-dimensional data that vary nonlinearly due to a few parameters. Applications to the analysis of medical imagery and human motion patterns have been successful despite the lack of effective tools to parameterize cyclic data sets. This paper offers an initial approach to this problem, and provides for a minimal parameterization of points that are drawn from cylindrical manifolds-data whose (unknown) generative model includes a cyclic and a non-cyclic parameter. Solving for this special case is important for a number of current, practical applications and provides a start toward a general approach to cyclic manifolds. We offer results on synthetic and real data sets and illustrate an application to de-noising cardiac ultrasound images.
Some observations based on simple models of MP scaling
Authors: E. Kronstadt
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The emergence of large shared memory multiprocessor systems offer the potential of accelerating the pace of ever increasing system performance. On the one hand, it seems simple: add more processors, get more performance. On the other hand, it is quite difficult, as efficient scaling of workloads to large numbers of processors is a nontrivial challenge. Nevertheless, the way we use these very large machines is intrinsically connected with our predictions of how well important applications scale. The author explores some of the consequences of simple mathematical models of MP scaling. He looks at the consequences of the projections these models give, both in terms of what performance gains we might expect to see, as well as the potential limits of scaling we may face.
DSS to manage ATM cash under periodic review with emergency orders
Authors: Ana K. Miranda, David F. Muñoz
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The cash management of an automated teller machine (ATM) often combines a periodic review inventory policy with emergency orders, the latter according to a continuous review inventory policy. We present a simulation-based decision support system (DSS) that considers both regular (periodic) and emergency (continuous review) orders. This DSS was developed to assist an ATM's manager in the selection of the appropriate (regular) order and period sizes as well as the (emergency) reorder point under a given service level. The DSS was developed using the software Arena and integrates a Visual Basic for Applications (VBA) front-end that allows the user to incorporate fixed and variable ordering costs as well as demand and arrival rates updates.
Design of a Web-Based Application for Wireless Sensor Networks
Authors: Sajid Hussain, Nick Schofield, Abdul W. Matin
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Wireless sensor networks (WSNs) are used for various ubiquitous and pervasive environments. A few common applications are security, agriculture, automation, and environmental monitoring. This paper provides the software architecture and design to develop a webbased application to query a wireless sensor network. A model-view-controller architecture is used to develop a generic web-based application. This application can act as a template to develop a simple interactive webbased tools for WSN-based technologies. The architecture is applied to design two monitoring protocols: continuous monitoring (CM) and query-based monitoring (QM). In CM, the application is designed for a specific query; however, in QM, the network is interactive and different queries can be sent.
Getting Meaning into the Machine
Authors: Yorick Wilks
Venue: IEEE Intelligent Systems (2006)

The key possibility the Semantic Web offers to traditional AI is delivering some of its value in a depleted form initially, by trading representational expressiveness for tractability, as some have put it. The model to follow here could be search technology and machine translation on the WWW (or even speech technology): each is available now in imperfect forms that we can't imagine living without.This article is part of a special issue on the Future of AI.
Programming modular robots with the TOTA middleware
Authors: Marco Mamei, Franco Zambonelli
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Modular robots represent a perfect application scenario for multiagent coordination. The autonomous modules composing the robot must coordinate their respective activities to enforce a specific global shape or a coherent motion gait. Here we show how the TOTA ("Tuples On The Air") middleware can be effectively exploited to support agents' coordination in this context. The key idea in TOTA is to rely on spatially distributed tuples, spread across the robot, to guide the agents' activities in moving and reshaping the robot. Three simulated examples are presented to support our claims.
A quote quad interview: Timo Laurmaa
Authors: Ray Polivka
Venue: ACM SIGAPL APL Quote Quad (1996)

APL usage occurs in many places throughout the world. Many have heard that APL is popular in the financial world. To find that APL is in use in the banking industry should not be surprising. But to find APL playing an important role in a bank whose only customers are other banks is exciting. The Bank for International Settlements in Zurich, Switzerland is such a bank.
The role of the backchannel in collaborative learning environments
Authors: Sarita Yardi
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Students at UC Berkeley's School of Information have participated in a persistent, online "backchannel" chatroom during class since the Fall of 2004. This paper describes the affordances offered by this technology for enhanced peer-to-peer and teacher-student interactions in a collaborative learning environment.
Using Agile Management to Share Course Projects Among Multiple Classes
Authors: Michael Wainer
Venue: Proceedings of the conference on AGILE 2006 (2006)

Project based courses have become popular as a way of engaging students and providing practical experiences. Sharing a single project between two course provides advantages of permitting more focus on the subject of each class, larger projects (more help and expertise is available) and greater opportunities for coordinated team work, and to appreciate how disciplines interact. A disadvantage is scheduling and managing class activities and risk to assure that useful project work is done at a pace benefiting both classes. This paper describes an experience in which an Agile approach was used to successfully coordinate project activities among a Software Development course and a User Interaction Design course.
The binding problem in presence research
Authors: Michael A. Harvey, Maria V. Sanchez-Vives
Venue: Presence: Teleoperators and Virtual Environments (2005)

An important contributor to the feeling of being present is the unity of one's perceptual experience. That is, the constellation of sensorial cues in a virtual environment must be in accord with some basic rules which, in the real world, govern the relationship between sensory events. A similar and long standing problem in neuroscience is how is it that the temporally and spatially segregated activity in neuronal ensembles is reassembled in order to generate a seamless conscious experience. This issue, which was first addressed by the Gestalt psychologists, is commonly referred to as the binding problem. In this paper we will discuss how the problem of binding is related to the problem of presence, and how the study of the neurophysiological substrates subserving this process may lead to an understanding of contextual relationships critical to generating presence in virtual environments.
New Methods for Digital Generation and Postprocessing of Random Data
Authors: Jovan Dj. Golic
Venue: IEEE Transactions on Computers (2006)

A new method for digital true random number generation based on asynchronous logic circuits with feedback is introduced. In particular, a concrete technique using the so-called Galois and Fibonacci ring oscillators is developed and analyzed both theoretically and experimentally. The generated random binary sequences may have a very high speed and a higher and more robust entropy rate in comparison with previous proposals for digital random number generators. A new method for digital postprocessing of random data based on irregularly clocked nonautonomous synchronous logic circuits with feedback is also introduced and a concrete technique using a self-clock-controlled linear feedback shift register is proposed. The postprocessing can provide both randomness extraction and computationally secure speed increase of input random data.
Anonymizing sequential releases
Authors: Ke Wang, Benjamin C. M. Fung
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information separately. The availability of related releases sharpens the identification of individuals by a global quasi-identifier consisting of attributes from related releases. Since it is not an option to anonymize previously released data, the current release must be anonymized to ensure that a global quasi-identifier is not effective for identification. In this paper, we study the sequential anonymization problem under this assumption. A key question is how to anonymize the current release so that it cannot be linked to previous releases yet remains useful for its own release purpose. We introduce the lossy join, a negative property in relational database design, as a way to hide the join relationship among releases, and propose a scalable and practical solution.
Stability and response bounds of non-conservative linear systems
Authors: C. Pommer
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Linear multi-input dynamical systems smoothly depending on parameters are considered. The generic (typical) structure of the uncontrollability set, consisting of parameter values corresponding to uncontrollable systems, is described. A construction perturbation theory for numerical analysis of the uncontrollability set is developed. As an example, the uncontrollability set is found for a mechanical system depending on three parameters. 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
From Wikipedia to the classroom: exploring online publication and learning
Authors: Andrea Forte, Amy Bruckman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Wikipedia represents an intriguing new publishing paradigm---can it be used to engage students in authentic collaborative writing activities? How can we design wiki publishing tools and curricula to support learning among student authors? We suggest that wiki publishing environments can create learning opportunities that address four dimensions of authenticity: personal, real world, disciplinary, and assessment. We have begun a series of design studies to investigate links between wiki publishing experiences and writing-to-learn. The results of an initial study in an undergraduate government course indicate that perceived audience plays an important role in helping students monitor the quality of writing; however, students' perception of audience on the Internet is not straightforward. This preliminary iteration resulted in several guidelines that are shaping efforts to design and implement new wiki publishing tools and curricula for students and teachers.
Source number estimator using Gerschgorin disks
Authors: Hsien-Tsai Wu, Jar-Ferr Yang, Fwu-Kuen Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The eigenstructure based estimator designed to be used with the aid of the Gerschgorin's disk theorem is proposed for source number detection. By introducing the unitary transformation of the covariance matrix, the Gerschgorin radii of the eigenstructure are exploited to determine the number of sources while overcoming a lack of data samples, noise model and data independency information. Unlike conventional methods such as Akaike information criterion (AIC) and minimum descriptive length criterion (MDL), which are based on the cluster analysis of the eigenvalues used in conjunction with statistical formulations, the proposed method called the Gerschgorin disk estimator (GDE), provide more accurate detection of the source number in situations of both simulated and measured experimental data.
Probabilistic Segmentation and Analysis of Horizontal Cells
Authors: Vebjorn Ljosa, Ambuj K. Singh
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Because images of neurons show interweaved processes from multiple cells, it is hard to determine which pixels belong to each cell, and consequently to analyze the images automatically. To manage these difficulties, we introduce probabilistic segmentation, in which each pixel is assigned a probability of belonging to each cell instead of being categorically assigned to one cell. We propose a randomized algorithm for probabilistic segmentation. The algorithm is based on repeated, intensity-weighted random walks on the image, and leads to improved segmentation quality. Analysis and mining techniques can utilize the more nuanced and complete information that the probabilistic segmentation yields about an image. Such techniques can then compute probabilistic values, which indicate the level of confidence that can be placed in them.
Optimizing the selection of Flip Angle acquisitions for T1 measurement in Breast
Authors: Georgios Ketsetzis, Michael Brady
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper we propose a new methodology for selecting optimum flip angle acquisitions prior to injection of contrast agent, particularly in breast MRI.We have developed a mathematical framework in which the selection of optimum flip angles is partly obtained after minimizing a function that represents the error in the measured T1 before bolus injection. We formulate the problem using a standard MR signal model and perform error analysis assuming that errors in estimating T1 are due to signal noise. The objective minimization function we propose depends explicitly on the noise model for the MR signal and the flip angle. We determine analytically the optimum flip angle that minimizes the error in estimation of T1 values that are characteristic of tumor types. Based on the analysis, we provide an algorithm that is computationally robust, more efficient and more accurate than a recent method for estimating T1 for tumour. The algorithm has been applied to breast MR.
Using simulation based approach to improve on the mean cycle time performance of dispatching rules
Authors: Chin Soon Chong, Malcolm Yoke Hean Low, Appa Iyer Sivakumar, Kheng Leng Gay
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper presents a simulation based approach to improve on the mean cycle time performance of dispatching rules. The method applies recursive simulation technique on dispatching rules to search for new improved solutions for a set of job shop problems. Due to the nature of the recursive heuristic, performance criteria other than mean cycle time and various dispatching rules can be implemented into the recursive simulation framework without requiring too much effort. The performance of the proposed approach is compared to the underlying dispatching rules as well as a published tabu search procedure. The preliminary results show that the approach outperforms the underlying dispatching rules and is comparable to the tabu search procedure.