ppxscal/embedding_network huggingface dataset:
KV the Loudmouth
Authors: George V. Neville-Neil
Venue: Queue (2007)

Dear KV, I was somewhat disappointed in your response to Unclear Peer in the December/January 2006/2007 issue of ACM Queue. You answered the question, but I feel you missed an opportunity to look at the problem and perhaps expand Unclear's professional horizons. What requirement is being satisfied by having Unclear build a P2P file-sharing system? Based upon the answer, it may be more effective, and perhaps even more secure, to use an existing open source project or purchase commercial software to address the business need. Indeed, if the definition of P2P is loose enough, encrypted e-mail would meet your security criteria and might solve the business problem. If Unclear is just a koding gnome, content to write kode as specified and not ask why, then I withdraw my concerns. Otherwise, it seems to me that an opportunity to teach Unclear, and your readers, was missed.
Olive: distributed point-in-time branching storage for real systems
Authors: Marcos K. Aguilera, Susan Spence, Alistair Veitch
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

This paper describes Olive, the first distributed block storage system to provide consistent point-in-time branching. Point-in-time branching allows users to recursively and quickly snapshot or clone the storage state. It has a wide range of applications including testing new deployments or upgrades without disrupting a running system, quickly provisioning large homogeneous systems, and preserving old versions of data. Olive provides block-level access and strong consistency for broad applicability, allowing it to branch file systems, database systems, and every other storage application that ultimately stores data on block storage. Olive is distributed and replicated to provide fault tolerance and availability. Providing strong consistency for branching in a replicated distributed system is a technical challenge that we address in this work. We evaluate Olive and show that branching typically takes a few tens of milliseconds, and so it has little impact on I/O's.
Microfabrication of electroplated integrated chromium tips onto a silicon actuator
Authors: E. Lennon, F. Ayela
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

Electrodeposition has been claimed as an alternative and emerging technique devoted to the fabrication of tall microstructures. Various metals and alloys can be electroplated with micrometric dimensions and the lithography techniques allow the realizations of various patterns. We present a new process devoted to the microfabrication of a chromium tip from an electroplated microstructure. The aim of this work is the realization of a new scanning microscope to perform local thermal conductivity measurements of thin films.
Development of electroscience curriculum for Greenfield Coalition
Authors: N. Al-Holou
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper addresses the challenges associated with electroscience curriculum development for the Greenfield Coalition. The Greenfield Coalition for New manufacturing Education is a National Science Foundation-supported partnership of six diverse educational institutions, five top manufacturing companies, the Society of manufacturing Engineers and Focus: HOPE. Greenfield was chartered to develop and produce a new, innovative manufacturing technology and engineering curriculum. The development of the electroscience curriculum involves designing, developing and delivery to Focus: HOPE candidates. The curriculum should serve candidates in three degree programs: Associate degree (AS), Bachelor of Engineering degree (BE), and Bachelor of Engineering Technology degree (BET) programs. This presents unique challenges that have been addressed throughout the project. The other challenge is integrating physics with the principles of electrical engineering in one curriculum. The last and most difficult challenge is to develop the curriculum so that computer-based instruction (CBI) is the main source of instruction for students. The authors have therefore designed, developed and delivered a computer-based instructional (CBI) curriculum.
Robust word sense translation by EM learning of frame semantics
Authors: Pascale Fung, Benfeng Chen
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We propose a robust method of automatically constructing a bilingual word sense dictionary from readily available monolingual ontologies by using estimation-maximization, without any annotated training data or manual tuning. We demonstrate our method on the English FrameNet and Chinese HowNet structures. Owing to the robustness of EM iterations in improving translation likelihoods, our word sense translation accuracies are very high, at 82% on average, for the 11 most ambiguous words in the English FrameNet with 5 senses or more. We also carried out a pilot study on using this automatically generated bilingual word sense dictionary to choose the best translation candidates and show the first significant evidence that frame semantics are useful for translation disambiguation. Translation disambiguation accuracy using frame semantics is 75%, compared to 15% by using dictionary glossing only. These results demonstrate the great potential for future application of bilingual frame semantics to machine translation tasks.
On linear separability of data sets in feature space
Authors: Degang Chen, Qiang He, Xizhao Wang
Venue: Neurocomputing (2007)

In this paper we focus our topic on linear separability of two data sets in feature space, including finite and infinite data sets. We first develop a method to construct a mapping that maps original data set into a high dimensional feature space, on which inner product is defined by a dot product kernel. Our method can also be applied to the Gaussian kernels. Via this mapping, structure of features in the feature space is easily observed, and the linear separability of data sets in feature space could be studied. We obtain that any two finite sets of data with empty overlap in original input space will become linearly separable in an infinite dimensional feature space. For two infinite data sets, we present several sufficient and necessary conditions for their linear separability in feature space. We also obtain a meaningful formula to judge linear separability of two infinite data sets in feature space by information in original input space.
Significant edges in the case of non-stationary Gaussian noise
Authors: I. Abraham, R. Abraham, A. Desolneux, S. Li-Thiao-Te
Venue: Pattern Recognition (2007)

In this paper, we propose an edge detection technique based on some local smoothing of the image followed by a statistical hypothesis testing on the gradient. An edge point being defined as a zero-crossing of the Laplacian, it is said to be a significant edge point if the gradient at this point is larger than a threshold s(@e) defined by: if the image I is pure noise, then the probability of @?@?I(x)@?>=s(@e) conditionally on @DI(x)=0 is less than @e. In other words, a significant edge is an edge which has a very low probability to be there because of noise. We will show that the threshold s(@e) can be explicitly computed in the case of a stationary Gaussian noise. In the images we are interested in, which are obtained by tomographic reconstruction from a radiograph, this method fails since the Gaussian noise is not stationary anymore. Nevertheless, we are still able to give the law of the gradient conditionally on the zero-crossing of the Laplacian, and thus compute the threshold s(@e). We will end this paper with some experiments and compare the results with those obtained with other edge detection methods.
Computer assisted assessment of SQL query skills
Authors: Stijn Dekeyser, Michael de Raadt, Tien Yu Lee
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

Structured Query Language (SQL) is the dominant language for querying relational databases today, and is an essential topic in introductory database courses in higher education. Even though the language is syntactically simple, relatively concise, and highly structured, students experience many difficulties while learning to express queries in SQL. In recent years a small number of software tools have been proposed to help students learn to write query statements and to assess their querying skills. In this paper we compare and evaluate existing tools mainly from the perspective of database theory and practice, but also from a pedagogical perspective. Addressing the deficiencies and opportunities uncovered by the evaluation, we then introduce SQLify, a new tool that extends the current state of the art by incorporating semantic feedback, enhanced automatic assessment based on database theory, and peer review to arrive at a richer learning experience for students, as well as consistent assessment results and reduced marking for instructors.
Simple observation selection techniques
Authors: B. Calef
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

There are many applications in which a signal is to be recovered given measurements of its Fourier transform. However, the number of measurements that can be collected may be limited by practical considerations such as time or expense. One must then decide which samples to take. We examine the case in which the observations are selected so as to provide the best reconstruction within a specified region of interest. Optimal sampling schemes are explicitly derived for situations in which all points of the region of interest are near each other. Using this result, we find suboptimal schemes for the useful case when points of the region of interest occur in isolated clumps. 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
Access selection and mobility management in a beyond 3G RAN: the winner approach
Authors: Elias Z. Tragos, Albena Mihovska, Emilio Mino, Pantelis Karamolegkos, Panagiotis T. Vlacheas
Venue: Proceedings of the 5th ACM international workshop on Mobility management and wireless access (2007)

Next generation communications will be composed of flexible, scalable and context-aware, secure and resilient architectures. The technologies will allow full mobility of the user and enable dynamic management policies that ensure end-to-end secure transmission of data and services across heterogeneous infrastructures and networks. The concept of ubiquitous and scalable system is applied in the IST WINNER II project to deliver optimum performance for different deployment scenarios from local area to wide area wireless. This paper describes the mobility management and access selection schemes that are proposed for the WINNER system that is designed as a candidate Beyond 3G type of system. A radio resource management (RRM) architecture that fully enables the functionality of these schemes will also be presented. The RRM schemes are based on specially designed cooperation RRM algorithms for the successful coexistence and handover of WINNER with new and legacy systems. The paper describes the cooperation architecture and mobility management functionalities and the rules that are applied for the support of mobility within the above scenarios.
Bit error analysis of new generation wireless transceivers
Authors: A. Mitra
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

There has been a spurt of activity in the development of digital wireless transceivers especially those operating in the ISM (industry scientific medical) bands. This is attributed to the fact that wireless systems have become more reliable, compact and easy to develop than ever before, leading to a well-perceived ubiquity. Most manufacturers do not document the error related performance and characteristics of their devices, thus entailing a detailed analysis by the developer or the user. We highlight tests to measure the bit error related performance of these new generation transceivers, with special emphasis on the TRF 6900A transceiver from Texas Instruments, a popular binary FSK (frequency shift keying) device. The test bed consists of a wireless modem based on the transceiver, and a personal computer executing a 'C' language code for baseband control and data source-sink, in order to test the device in various configurations and conditions. Our test analyses bit error rate and tries to highlight its relationship to various parameters such as attenuation, interference, occlusions, and modulation index, which in turn helps to evaluate the performance of a wireless device. This method can be easily extended to evaluate various other similar wireless transceivers offered in the market. 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
Cryptanalysis of Two Lightweight RFID Authentication Schemes
Authors: Benessa Defend, Kevin Fu, Ari Juels
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Vajda and Butty¢¥an proposed several lightweight authentication protocols for authenticating RFID tags to readers, and left open the quantifiable cryptographic strength. Our cryptanalysis answers this open question by implementing and measuring attacks against their XOR and SUBSET protocols. A passive eavesdropper can impersonate a tag in the XOR protocol after observing only 70 challenge-response transactions between the tag and reader. In contrast, the theoretical maximum strength of the XOR protocol could have required 16!2 observed transactions to break the key. Our experiments also show that a passive eavesdropper can recover the shared secret used in the XOR protocol by observing an expected 1,092 transactions. Additionally, a nearly optimal active attack against the SUBSET protocol extracts almost one bit of information for each bit emitted by the tag.
Towards an Approach for Hybrid Trust Model
Authors: Philippe Jaillon, Marc Roelens, Xavier Serpaggi, Hoan Vu
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We present here an approach for a hybrid model of trust. Our idea on the trust model is that all evidences on interactions could be used to measure the trust on required actions before taking the decision. We use the policy language proposed by Krukow et al.[2], with some slight modifications to specify our trust model.
Virtual "Third Places": A Case Study of Sociability in Massively Multiplayer Games
Authors: Nicolas Ducheneaut, Robert J. Moore, Eric Nickell
Venue: Computer Supported Cooperative Work (2007)

Georg Simmel [American Journal of Sociology 55:254---261 (1949)] is widely credited as the first scholar to have seriously examined sociability --- "the sheer pleasure of the company of others" and the central ingredient in many social forms of recreation and play. Later Ray Oldenburg [The Great Good Place. New York: Marlowe Company (1989)] extended Simmel's work by focusing on a certain class of public settings, or "third places," in which sociability tends to occur, such as, bars, coffee shops, general stores, etc. But while Simmel and Oldenburg describe activities and public spaces in the physical world, their concepts may apply as well to virtual or online worlds. Today Massively Multiplayer Online Games (MMOGs) are extensive, persistent online 3D environments that are populated by hundreds of thousands of players at any given moment. The sociable nature of these online spaces is often used to explain their success: unlike previous video games, MMOGs require players to exchange information and collaborate in real-time to progress in the game. In order to shed light on this issue, we critically examine player-to-player interactions in a popular MMOG (Star Wars Galaxies). Based on several months of ethnographic observations and computerized data collection, we use Oldenburg's notion of "third places" to evaluate whether or not the social spaces of this virtual world fit existing definitions of sociable environments. We discuss the role online games can play in the formation and maintenance of social capital, what they can teach us about the evolution of sociability in an increasingly digitally connected social world, and what could be done to make such games better social spaces.
On Slave-Slave Bridging with Non-Acknowledged GTS Access in 802.15.4 Beacon Enabled Networks
Authors: Jelena Misic
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we present and analyze nonacknowledged GTS option for interconnection of IEEE 802.15.4 beacon enabled network clusters using ordinary network nodes as bridge nodes. Bridge design involves uplink transmission to the coordinator and downlink transmission to the bridge. Bridge periodically visits source and sink cluster and exchanges data using Guranteed Time Slot (GTS) access. We develop the queuing model for bridging algorithm and present numerically obtained performance results.
Algorithms and lower bounds in finite automata size complexity
Authors: Michael Sipser
Venue:  (2006)

In this thesis we investigate the relative succinctness of several types of finite automata, focusing mainly on the following four basic models: one-way deterministic (1DFAs), one-way nondeterministic (1NFA s), two-way deterministic (2DFAs), and two-way nondeterministic (2NFAs).First, we establish the exact values of the trade-offs for all conversions from two-way to one-way automata. Specifically, we prove that the functions nnn-n-1 n, i=0n-1 j=0n-1 ni nj 2i -1j, 2nn+1 return the exact values of the trade-offs from 2DFAs to 1DFAs, from 2NFAs to 1DFAs, and from 2DFAs to 2NFAs to 1NFAs, respectively. Second, we examine the question whether the trade-offs from 1NFA s or 2NFAs to 2DFAs are polynomial or not. We prove two theorems for liveness, the complete problem for the conversion from 1NFAs to 2DFAs. We first focus on moles, a restricted class of 2NFAs that includes the polynomially large 1NFAs which solve liveness. We prove that, in contrast, 2DFA moles cannot solve liveness, irrespective of size. We then focus on sweeping 2NFA s, which can change the direction of their input head only on the end-markers. We prove that all sweeping 2NFAs solving the complement of liveness are of exponential size. A simple modification of this argument also proves that the trade-off from 2DFAs to sweeping 2NFAs is exponential. Finally, we examine conversions between two-way automata with more than one head-like devices (e.g., heads, linearly bounded counters, pebbles). We prove that, if the automata of some type A have enough resources to (i) solve problems that no automaton of some other type B can solve; and (ii) simulate any unary 2DFA that has additional access to a linearly-bounded counter, then the trade-off from automata of type A to automata of type B admits no recursive upper bound. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Nonlinear filtering by kriging, with application to system inversion
Authors: J.-P. Costa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Prediction by kriging does not rely on any specific model structure, and is thus much more flexible than approaches based on parametric behavioural models. Since accurate predictions are obtained for extremely short training sequences, it generally performs better than prediction methods using parametric models. Application to nonlinear system inversion is considered.
Dominant regions in noncrystallographic hyperplane arrangements
Authors: Yu Chen, Cathy Kriloff
Venue: Journal of Combinatorial Theory Series A (2007)

For a crystallographic root system, dominant regions in the Catalan hyperplane arrangement are in bijection with antichains in a partial order on the positive roots. For a noncrystallographic root system, the analogous arrangement and regions have importance in the representation theory of an associated graded Hecke algebra. Since there is also an analogous root order, it is natural to hope that a similar bijection can be used to understand these regions. We show that such a bijection does hold for type H"3 and for type I"2(m), including arbitrary ratio of root lengths when m is even, but does not hold for type H"4. We give a criterion that explains this failure and a list of the 16 antichains in the H"4 root order which correspond to empty regions.
Texture analysis of an image by using a rotation-invariant model
Authors: C. Rosenberger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Texture analysis is an important problem in image processing because it conditions the quality of image segmentation and interpretation. We propose in this communication a texture model which is invariant by rotation and whose parameters allow to characterize at the same time the type of texture and its tonal primitive. The originality of the model proposed lies in the use of the Wold decomposition to model the 1D normalized autocovariance. This function is computed from the 2D normalized autocovariance of a texture. Finally, parameters of the model are estimated by using a genetic algorithm. Experimental results on textures from the Brodatz album and synthetic textures show a modeling error lower than 0.06.
Efficient support for content-based routing in web server clusters
Authors: Chu-Sing Yang, Mon-Yen Luo
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Clustered server architectures have been employed for many years on the Internet as a way to increase performance, reliability and scalability in the presence of the Internet's explosive growth. A routing mechanism for mapping requests to individual servers within cluster is at the heart of any server clustering techniques. In this paper, we first analyze the deficiencies of existing request-routing approaches. Based on these observations, we argue that the request routing mechanism in a cluster-based server should factor in the content of a request in making decisions. Thus, we designed and implemented a new mechanism to efficiently support content-aware routing in Web server clusters. With this mechanism, we also built in a number of sophisticated content-aware intelligence for making routing decision. Performance evaluation on a prototype implementation demonstrates substantial performance improvements over contemporary routing schemes. The proposed mechanism can also enable many new capabilities in cluster-based servers, such as sophisticated load balancing, differentiated service, special content deployment, session integrity, etc.
An optimization-based adaptive nonlinear observer
Authors: Jian Yu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A novel adaptive nonlinear observer on basis of input and output measurements is proposed by using techniques from optimization theory, the calculus of variations and gradient descent dynamics. The formulation allows for general parametrized nonlinear observers, including a co-state (sensitivity) dynamics which propagates forward in time and serves as a filtered version of the measured error signal. It is shown that the observer works well in sense of speed and robustness. Several Matlab simulation examples and DSP-based hardware-in-the-loop (HIL) experiments are given to illustrate the effect of the approach.