ppxscal/embedding_network huggingface dataset:
Commonsense computing: what students know before we teach (episode 1: sorting)
Authors: Beth Simon, Tzu-Yi Chen, Gary Lewandowski, Robert McCartney, Kate Sanders
Venue: Proceedings of the second international workshop on Computing education research (2006)

We examine students' commonsense understanding of computer science concepts before they receive any formal instruction in the field. Specifically, we asked students on the first day of a CS1 class to describe in English how they would arrange a set of numbers in ascending, sorted order. We repeated the experiment with students in an introductory economics course, and again with a sub-population of the CS1 students after ten weeks of Java instruction.We found that a majority of beginning computing students could describe a coherent algorithm to correctly sort a list of numbers, while less than a third of general college students could do so. Many students gave versions of selection or insertion sort, but the most common algorithm treated numbers as strings and manipulated them digit by digit. Students who used iteration strongly preferred post-test loops. Finally, some aspects of student performance became worse after ten weeks of CS1 instruction.
Tunable downsampling using fractional delay filters with applications to digital TV transmission
Authors: T. I. Laakso, V. Valimaki, J. Henriksson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

An efficient technique for sampling rate conversion for arbitrary (incommensurate) ratios is proposed. The technique is based on fractional delay filters that are efficient to implement and that can be controlled with a small number of arithmetic operations per output sample. The authors consider an application in digital television (DTV) transmission where, according to present standard proposals, conversions between several incommensurate sampling rates must be possible. Rather than trying to design separate rate fixed filters for each possible conversion, the authors outline a system which may be tuned for any possible downsampling ratio. A sampling rate conversion system based on the straightforward and simple Lagrange interpolation technique is illustrated with a level and highly efficient implementation structure. Various error sources involved are analyzed and a mean-square-error (MSE) type cost function is defined to aid in the system design.
Rate Allocation and Admission Control for Differentiated Services in CDMA Data Networks
Authors: Mainak Chatterjee Haitao Lin, Sajal K. Das
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper, we propose a unified framework for rate allocation and admission control for CDMA data networks with a goal of maximizing the service provider's revenue taking into consideration user churn behavior, i.e., users' migration from one provider to another. The power constrained discrete rate allocation (PC-DRA) problem that finds the rates at which the base station must transmit to each user is very difficult because of the nonlinear nature of the objective function, the discrete nature of available rates, and the complex relationship between data rate, the target SINR, and the total power constraint. We prove that the PC-DRA problem is NP-Complete for CDMA data networks and then propose three heuristics—a two step selective rate reduction (SRR) scheme, a genetic algorithm (GA), and an improved genetic algorithm (IGA) to solve it. We show that all three heuristics can achieve suboptimal that is very close to the global optimal, while SRR provides solutions of high quality with much less computation time than GA and IGA. At the frame level, the rate allocation maximizes the service provider's revenue by adjusting individual user's data rate on a frame by frame basis. On the other hand, the service provider's revenue varies with the system load, which is decided by admission control at the session level. Thus, the admission control needs to maintain an optimal system load. An efficient resource management framework is provided by the cross level (layer) interaction between the link layer (rate control) and the network layer (admission control) in the sense that 1) they share the same objective of maximizing the service provider's revenue, and 2) the solution to the rate allocation problem provides critical information for the admission control decision. The proposed framework is evaluated by extensive simulation experiments with realistic Web browsing and FTP traffic models. Simulation results confirm that the framework is able to provide class-based differentiated data services that also maximize the service provider's revenue.
Modeling time and space metering of flights in the national airspace system
Authors: Paul T. R. Wang, Craig R. Wanke, Frederick P. Wieland
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Metering flights at key points such as sector crossings is an important operational procedure in mitigating National Airspace System (NAS) traffic congestion due to high demand or changing weather conditions. The authors combine a mathematical model for minutes-in-trail or miles-in-trail (MIT) metering with discrete event simulation in a newly developed tool that can be used by analysts to examine or predict existing or developing bottlenecks within NAS. We define a penalty function recursively in terms of MIT delays between leading and following flights. With discrete event simulations, it is possible to examine the anticipated MIT delays for all the flights scheduled to arrive at any crossing point. Impacts of flight cancellations, route changes, and additional enroute delays as results of airport or sector congestion can all be evaluated during each simulation by updating the scheduled flight crossing times and the expected MIT delay penalties for all the trailing flights.
On discrete norms of polynomials
Authors: Evguenii Rakhmanov, Boris Shekhtman
Venue: Journal of Approximation Theory (2006)

For a polynomial p of degree n < N we compare two norms: ||p||:= sup{|p(z)|: z ∈ C; |z| = 1} and ||p||N:= sup {|p(zj)|: j=0,..., N - 1}; zj = e2πi j/N . We show that there exist universal constants C1 and C2 such that 1 + C1 log (N/N - n) ≤ sup{||p||/||p||N: p ∈ Pn}, ≤ C2 log (N/N-n) + 1.
The Constraints Functional Neuroimaging Places on Classical Models of Auditory Word Processing
Authors: A. L. Giraud, C. J. Price
Venue: Journal of Cognitive Neuroscience (2001)

Several previous functional imaging experiments have demonstrated that auditory presentation of speech, relative to tones or scrambled speech, activate the superior temporal sulci (STS) bilaterally. In this study, we attempted to segregate the neural responses to phonological, lexical, and semantic input by contrasting activation elicited by heard words, meaningless syllables, and environmental sounds. Inevitable differences between the duration and amplitude of each stimulus type were controlled with auditory noise bursts matched to each activation stimulus. Half the subjects were instructed to say "okay" in response to presentation of all stimuli. The other half repeated back the words and syllables, named the source of the sounds, and said "okay" to the control stimuli (noise bursts). We looked for stimulus effects that were consistent across task. The results revealed that central regions in the STS were equally responsive to speech (words and syllables) and familiar sounds, whereas the posterior and anterior regions of the left superior temporal gyrus were more active for speech. The effect of semantic input was small but revealed more activation in the inferior temporal cortex for words and familiar sounds than syllables and noise. In addition, words (relative to syllables, sounds, and noise) enhanced activation in the temporo-parietal areas that have previously been linked to modality independent semantic processing. Thus, in cognitive terms, we dissociate phonological (speech) and semantic responses and propose that word specificity arises from functional integration among shared phonological and semantic areas.
Overcoming Requirements Engineering Challenges: Lessons from Offshore Outsourcing
Authors: Jyoti M. Bhat, Mayank Gupta, Santhosh N. Murthy
Venue: IEEE Software (2006)

Requirements engineering practices have changed significantly to address the needs of global software development characterized by teams working across geographies, time zones, and organizational boundaries. By sharing real-life case studies based on experience of an Indian IT services outsourcing firm, the authors provide insights into the root causes of RE phase conflicts within client-vendor offshore relationships. On the basis of this analysis, they propose a set of strategic success factors that potentially address a variety of RE challenges in the multiparty global software development context. They also propose a holistic framework of best practices across people-process-technology dimensions to achieve the success factors. This article is part of a special issue on Global Software Development.
XML Cache Management Based On XPath Containment Relationship
Authors: Daeil Park, Motomichi Toyarn
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We propose a cache management method of XML Databases in this research. XQuery is the most popular XML query language in XML Databases. The tree-structured XML data can be traversed along XPath expressions used in part of XQuery. Two XPath expressions being compared, the containment relationship of these results could be judged. In this work, we pay attention to the relationship and propose a method of cache management using it as meta information when doing the cache replacement. Although the cache management by the unit of page or tuple was a main technique in the relational databases, the merit and demerit of doing the cache management by the unit of query in the XUL databmes are discussed in this paper.
A graphical presentation of MLF types with a linear-time unification algorithm
Authors: Didier Rémy, Boris Yakobowski
Venue: Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation (2007)

MLF is a language that extends ML and System SF and combines the benefits of both. We propose a dag representation of MLF types that superposes a term-dag, encoding the underlying term-structure with sharing, and a binding tree encoding the binding-structure. Compared to the original definition, this representation is more canonical as it factors out most of the notational details; it is also closely related to first-order terms. Moreover, it permits a simpler and more direct definition of type instance that combines type instance on first-order term-dags, simple operations on dags, and a control that allows or rejects potential instances. Using this representation, we build a linear-time unification algorithm for MLF types, which we prove sound and complete with respect to the specification.
Target size study for one-handed thumb use on small touchscreen devices
Authors: Pekka Parhi, Amy K. Karlson, Benjamin B. Bederson
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper describes a two-phase study conducted to determine optimal target sizes for one-handed thumb use of mobile handheld devices equipped with a touch-sensitive screen. Similar studies have provided recommendations for target sizes when using a mobile device with two hands plus a stylus, and interacting with a desktop-sized display with an index finger, but never for thumbs when holding a small device in a single hand. The first phase explored the required target size for single-target (discrete) pointing tasks, such as activating buttons, radio buttons or checkboxes. The second phase investigated optimal sizes for widgets used for tasks that involve a sequence of taps (serial), such as text entry. Since holding a device in one hand constrains thumb movement, we varied target positions to determine if performance depended on screen location. The results showed that while speed generally improved as targets grew, there were no significant differences in error rate between target sizes =9.6 mm in discrete tasks and targets =7.7 mm in serial tasks. Along with subjective ratings and the findings on hit response variability, we found that target size of 9.2 mm for discrete tasks and targets of 9.6 mm for serial tasks should be sufficiently large for one-handed thumb use on touchscreen-based handhelds without degrading performance and preference.
A Position DetectionMechanism for Location-aware Pin&Play
Authors: Yasue Kishino, Tsutomu Terada, Shojiro Nishio, Nicolas Villar, Hans Gellersen
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

We propose a position detection mechanism for locationaware Pin&Play. Though the positions of inserted pins are important for most applications, they could not be detected in previous systems. The proposed method detects the positions of pins by processing images taken with a camera placed in front of the board. The proposed method has a dynamic adjustment mechanism for image processing parameters to achieve higher accuracy even when the surrounding lighting condition changes. Moreover, it also has an error estimation mechanism to avoid the accumulation of position error. We also clarify the effectiveness of our proposed method through performance evaluations.
Polyspectra-based, blind, MMSE, fractionally-spaced equalization of a cyclostationary signal
Authors: M. Webster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Two weaknesses of polyspectra-based blind equalization are addressed. The first weakness involves a zero-forcing (ZF) characteristic, where intersymbol interference is eliminated with disregard for associated mean squared error (MSE). It is shown that a minimum-MSE (MMSE) constraint can be added for signals operating in colored Gaussian noise, with only a small increase in computational complexity and with performance enhancement under certain scenarios. The second weakness involves the constraint that the signal be stationary, which fails to exploit the cyclostationary features of most communication signals (W. A. Gardner). In particular, it is shown that polyspectra-based techniques can be used with a fractionally-spaced equalizer, with attendant performance boosts in timing insensitivity (S. H. Qureshi, 1985) and damaged-spectrum restoration (W. A. Gardner, 1991). The technique decomposes the signal into stationary streams, computing the individual and joint statistics of the partitions, and then solves the optimal Wiener equation. 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
Introducing Risk Management into the Grid
Authors: Karim Djemame, Iain Gourlay, James Padgett, Georg Birkenheuer, Matthias Hovestadt, Odej Kao, Kerstin Voss
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Service Level Agreements (SLAs) are explicit statements about all expectations and obligations in the business partnership between customers and providers. They have been introduced in Grid computing to overcome the best effort approach, making the Grid more interesting for commercial applications. However, decisions on negotiation and system management still rely on static approaches, not reflecting the risk linked with decisions. The EC-funded project "AssessGrid" aims at introducing risk assessment and management as a novel decision paradigm into Grid computing. This paper gives a general motivation for risk management and presents the envisaged architecture of a "risk-aware" Grid middleware and Grid fabric, highlighting its functionality by means of three showcase scenarios.
Fusion of Omnidirectional and PTZ Cameras for Accurate Cooperative Tracking
Authors: Yi Yao, Besma Abidi, Mongi Abidi
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Dual camera systems (omnidirectional and slaved PTZ cameras) are widely used in public area monitoring and target tracking. However, due to their low and non-uniform resolution, omnidirectional cameras are only able to provide moderate accuracy in both motion/target detection and tracking. To overcome this disadvantage, two methods are proposed: geometry mapping based on a polynomial imaging model and closed loop cooperative tracking. Using a unified polynomial approximation [1], the geometry relationship between the omnidirectional and PTZ cameras can be formulated in a general solution from camera calibration with a fully automated model selection. Distributed Kalman filters are developed to exchange estimated trajectories among cameras forming closed loop sub-systems for individual cameras. The effectiveness of the proposed algorithms is illustrated via experiments and comparisons with existing systems.
Distributed Data Summaries for Approximate Query Processing in PDMS
Authors: Katja Hose, Daniel Klan, Kai-Uwe Sattler
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Evolving from heterogeneous database systems one of the main problems in Peer Data Management Systems (PDMS) is distributed query processing. With the absence of global knowledge such strategies have to focus on routing the query efficiently to only those peers that are most likely to contribute to the final result. Using routing indexes is one possibility to achieve this. Since data may change over time these structures have to be updated and maintained which can be very expensive. In this paper, we present a novel kind of routing indexes that enables efficient query routing. Furthermore, we propose a threshold based update strategy that can help to reduce maintenance costs by far. We exemplify the benefit of these indexes using a distributed skyline strategy as an example. Finally, we show how relaxing exactness requirements, that are usually posed on results, can compensate the use of slightly outdated index information.
Reversible Sketch Based on the XOR-Based Hashing
Authors: Wenfeng Feng, Zhibin Zhang, Zongpu Jia, Ziyi Fu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

We provided a novel reversible sketch data structure which had exactly sub-linear finding time proportional to the sketch length. We first introduced the XOR-based hash functions over the Galois field GF({0,1},\square ,·), defined the full-ranked boolean matrix over GF({0,1},\square ,·) and the maximum dispersion among the hash functions. Then, we chose d non-singular boolean matrices randomly to implement the random projection from the source address space {0,1}^n to the hash address space {0,1}^m, and used the inverse matrix of one of the randomly chosen nonsingular matrices to implement the reversal mapping. Based on the reversible sketch, we implemented an algorithm that finds and estimates the frequent items online with good accuracy. The estimate procedure used a two-stage strategy which includes Identification step and Verification step. The Identification step generates the candidate frequent items and the Verification step further verifies these items. Using a large amount of real Internet traffic data, the experiments demonstrated great improvement at the finding speed and some improvement at the accuracy than the current representative sketch, e.g. Count-Min sketch. Our preliminary results hint at the possibility of using the reversible sketch as a building block for network anomaly detection and distributed real-time traffic analysis.
Using Psilocybin to Investigate the Relationship between Attention, Working Memory, and the Serotonin 1A and 2A Receptors
Authors: Olivia L. Carter, David C. Burr, John D. Pettigrew, Guy M. Wallis, Felix Hasler, Franz X. Vollenweider
Venue: Journal of Cognitive Neuroscience (2005)

Increasing evidence suggests a link between attention, working memory, serotonin (5-HT), and prefrontal cortex activity. In an attempt to tease out the relationship between these elements, this study tested the effects of the hallucinogenic mixed 5-HT1A/2A receptor agonist psilocybin alone and after pretreatment with the 5-HT2A antagonist ketanserin. Eight healthy human volunteers were tested on a multiple-object tracking task and spatial working memory task under the four conditions: placebo, psilocybin (215 &mu;g/kg), ketanserin (50 mg), and psilocybin and ketanserin. Psilocybin significantly reduced attentional tracking ability, but had no significant effect on spatial working memory, suggesting a functional dissociation between the two tasks. Pretreatment with ketanserin did not attenuate the effect of psilocybin on attentional performance, suggesting a primary involvement of the 5-HT1A receptor in the observed deficit. Based on physiological and pharmacological data, we speculate that this impaired attentional performance may reflect a reduced ability to suppress or ignore distracting stimuli rather than reduced attentional capacity. The clinical relevance of these results is also discussed.
Block cipher based on reversible cellular automata
Authors: Marein Seredynski, Pascal Bouvry
Venue: New Generation Computing (2005)

We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric key systems.
Generalized fuzzy hyperideals of hypernear-rings and many valued implications
Authors: B. Davvaz, P. Corsini
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2006)

The hypernear-rings generalize the concept of near-rings, in the sense that instead of the operation + the hyperoperation + is defined on the set R, that is a mapping R × R → P* (R), where P* (R) is the set of all the non-empty subsets of R. The study of hypernear-rings is extremely challenging, effering curiously beautiful results to one who is willing to look for structure where symmetry is not so abundant. In this paper, using the notion of "belongingness (∈)" and "quasi-coincidence (q)" of fuzzy points with fuzzy sets, the concept of (∈, ∈ Vq)-fuzzy sub-hypernear-ring (hyperideal) is introduced. Characterization and some of the fundamental properties of such fuzzy sub-hypernear-rings (hyperideals) are obtained. (∈, ∈ Vq)-fuzzy cosets determined by (∈, ∈ Vq)-fuzzy sub-hypernear-rings are discussed. Finally, we give the definition of a fuzzy sub-hypernear-ring (hyperideal) with thresholds which is a generalization of an ordinary fuzzy sub-hypernear-ring (hyperideal) and an (∈, ∈ Vq)-fuzzy sub-hypernear-ring (hyperideal).
A Model for Determining the Size of Learning Objects
Authors: Judith Schoonenboom
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper starts with an attempt to apply the few principles for determining the size of learning objects (LOs) in the literature to a collection of ten mainly Dutch successful learning object practices. From this attempt, a more elaborate model is developed in which LO size is jointly determined by three factors: (1) surface learning versus deep learning (2) resources versus LOs that are passed through (3) arrangement of meaningful units is done within versus outside the LO. These three factors determine (1) the appropriate size of the LOs, (2) the homogeneity of the collection of LOs, (3) the principles that apply in developing the LOs: either Agreement on pedagogy or the following principle: keep the objects as big as possible, unless its parts will be used separately.