ppxscal/embedding_network huggingface dataset:
Machine readable documentation of social science data: compatibility and standardization in codebooks
Authors: J. Merrill Shanks
Venue: ACM SIGSOC Bulletin (1974)

Mr. Chairman, like other people in the room, I believe our major purpose should be a lively discussion of alternative strategies for standardization, so I will try to be brief in presenting my own point of view. 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
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optical networks
Authors: T. Lavian, J. Mambretti, D. Cutrell, H. Cohen, S. Merrill, R. Durairaj, P. Daspit
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunities for an advanced communications infrastructure to tackle next generation data services. To take advantage of these trends and opportunities, research communities are creating new architectures, such as the Open Grid Service Architecture (OGSA), which are being implemented in new prototype advanced infrastructures. The DWDM-RAM project, funded by DARPA, is actively addressing the challenges of next generation applications. DWDM-RAM is an architecture for data-intensive services enabled by next generation dynamic optical networks. It develops and demonstrates a novel architecture for new data communication services, within the OGSA context, that allows for managing extremely large sets of distributed data. Novel features move network services beyond notions of the network as a managed resource, for example, by including capabilities for dynamic on-demand provisioning and advance scheduling. DWDM-RAM encapsulates optical network resources (Lambdas, lightpaths) into a Grid service and integrates their management within the Open Grid Service Architecture. Migration to emerging standards such as WS-Resource Framework (WS-RF) should be straightforward. In initial applications, DWDM-RAM targets specific data-intensive services such as rapid, massive data transfers used by large scale eScience applications, including: high-energy physics, geophysics, life science, bioinformatics, genomics, medical morphometry, tomography, microscopy imaging, astronomical and astrophysical imaging, complex modeling, and visualization.
Data sharing and querying for peer-to-peer data management systems
Authors: Anastasios Kementsietsidis
Venue:  (2005)

In this thesis, we investigate mechanisms to support data sharing and querying in a peer-to-peer data management system, that is, a peer-to-peer system where each peer manages its own data. To support data sharing, we propose the use of mapping tables which list pairs of corresponding data values that reside in different peers. We argue why mapping tables are appropriate for data sharing in a peer-to-peer environment, and we discuss alternative semantics for these tables. We motivate why reasoning capabilities are needed to manage mapping tables, and we show the importance of inferring new tables from existing ones, or checking the consistency of existing tables. Finally, we present algorithms and experimental results which show that mapping tables may be managed efficiently in practice. In terms of querying, we propose a framework in which users pose select-project-join queries with respect to the schema of their local peer. Then, we provide a rewriting mechanism that uses mapping tables to translate a locally expressed query to a set of queries over the acquainted peers. We consider both sound translations (which only retrieve correct answers) and complete translations (which retrieve all correct answers, and no incorrect answers). We describe basic algorithms to compute such translations, and we offer optimized versions of these algorithms that offer savings both in terms of execution time and in terms of memory. Finally, we present experiments that show the performance and efficiency of our algorithms under various settings.
Design of a 1 V Low Power 900 MHz QVCO
Authors: Prabir K. Saha, Ashudeb Dutta, A. Patra, T. K. Bhattacharyya
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper describes the design of a 1V, 900 MHz Quadrature Voltage Controlled Oscillator (QVCO) implemented in 0.18µm CMOS technology. The VCO can be tuned from 825 to 975 MHz, which corresponds to a tuning range of 16.6%, consuming only 3.5 mW of power for quadrature signal outputs. The phase noise of the VCO is -136 dBc/Hz at 3 MHz offset from 900 MHz. The VCO features discrete tuning using switched capacitors with a Kvco of 50 MHz/V which makes it very suitable for using in a PLL. Challenges with low voltage implementation of the VCO and modifications required both at device and circuit level are discussed in detail. Novel design of the VCO has also ensured very low supply sensitivity of the output frequency (KVDD=6 MHz/V) despite low supply voltage.
Effect of channel estimation and prediction errors on Adaptive M-PSK systems
Authors: Mohamed L. Ammari, Francois Gagnon, Jean Belzile
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this paper, we study an adaptive M-PSK modulation technique with a coherent detection over Rayleigh fading channels. The data rate is adapted according to the channel state. At the receiver, the fading is estimated using pilot symbols. To cancel the channel impact, we correct the received signal by dividing it by the estimated value of the fading. To adjust the modulation level, we propose a switching protocol which takes into account the channel estimation and prediction errors.
Path Protection with Pre-identification for MPLS Networks
Authors: Dan Wang, Funda Ergun
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Current approaches to providing robust network connections which are tolerant to failures involve restoration schemes which mainly focus on reserving backup paths. In this paper we propose a technique for which avoids the extra cost for reserving, by pre- identifying (but not reserving) the backup paths. We present and analyze an algorithm to solve this problem and study a practical special case in detail. Through simulations we show that our model is signifi- cantly more cost-efficient than backup path reservation. We also show how this model can fit into the MPLS architecture.
We have always been transgenic
Authors: Steve Baker, Carol Gigliotti
Venue: AI Society (2005)

This dialogue concerns the nature of ethical responsibility in contemporary art practice, and its relation to questions of creativity; the role of writing in shaping the perception of transgenic art and related practices; and the problems that may be associated with trusting artists to act with integrity in the unchartered waters of their enthusiastic engagement with genetic technologies.
The influence of computer technology upon the pedagogical practice of two elementary school teachers
Authors: Terrance Furin
Venue:  (2005)

The purpose of this study was to examine the effect that computer technology has had on two suburban elementary school teachers in a technologically-rich school. It examined factors that might hinder or promote the use of computer technology, how the teachers defined and integrated computer technology, and how the use of computer technology may affect the teachers' pedagogical practice. Qualitative research methodology was adopted to shed light on the issues elementary classroom teachers face when utilizing computer technology in their daily lessons. Data was collected through the use of interviews, observations, a researcher journal, and an examination of various educational documents and artifacts. Participants included an elementary principal, building technology coordinator, district technology supervisor, and two classroom teachers. A case study format was used in order to focus on the descriptions of the elementary classroom teachers' definitions and uses of computer technology. The findings suggest that the introduction of abundant technological resources, support personnel, and district wide commitment does not in and of itself cause transformative change in teachers' pedagogical practices from behaviorist to constructivist instruction. However, through the use of computer technology, the teachers were able to effectively differentiate instruction to address differences in student learning styles. This study illustrates that implementing computer technology and promoting constructivist teaching strategies is a process of change that occurs over time. It requires extensive leadership at all levels of implementation from the district administrators to the classroom teachers. Educators' beliefs about technology and the role of the student as a learner, play a significant role in how computer technology is implemented in practice.
SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation
Authors: Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

As the Internet grows, it is becoming increasingly difficult to collect performance measurements, to monitor its state, and to perform simulations efficiently. This is because the size and the heterogeneity of the Internet makes it time-consuming and difficult to devise traffic models and analytic tools which would allow us to work with summary statistics.We explore a method to side step these problems by combining sampling, modeling, and simulation. Our hypothesis is this: if we take a sample of the input traffic and feed it into a suitably scaled version of the system, we can extrapolate from the performance of the scaled system to that of the original.Our main findings are as follows. When we scale an IP network which is shared by short- and long-lived TCP-like and UDP flows and which is controlled by a variety of active queue management schemes, then performance measures such as queueing delay and drop probability are left virtually unchanged. We show this in theory and in simulations. This makes it possible to capture the performance of large networks quite faithfully using smaller scale replicas.
Optical Merger of Direct Vision with Virtual Images for Scaled Teleoperation
Authors: Samuel T. Clanton David C. Wang Vikram S. Chib Yoky Matsuoka, George D. Stetten
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

Scaled teleoperation is increasingly prevalent in medicine, as well as in other applications of robotics. Visual feedback in such systems is essential and should make maximal use of natural hand-eye coordination. This paper describes a new method of visual feedback for scaled teleoperation in which the operator manipulates the handle of a remote tool in the presence of a registered virtual image of the target in real time. The method adapts a concept already used successfully in a new medical device called the Sonic Flashlight, which permits direct in situ visualization of ultrasound during invasive procedures. The Sonic Flashlight uses a flat-panel monitor and a half-silvered mirror to merge the visual outer surface of a patient with a simultaneous ultrasound scan of the patient's interior. Adapting the concept to scaled teleoperation involves removing the imaging device and the target to a remote location and adding a master-slave control device. This permits the operator to see his hands, along with what appears to be the tool, and the target, merged in a workspace that preserves natural hand-eye coordination. Three functioning prototypes are described, one based on ultrasound and two on light microscopy. The limitations and potential of the new approach are discussed.
A loose and sketchy approach in a mediated reality environment
Authors: Michael Haller, Florian Landerl, Mark Billinghurst
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this paper, we present sketchy-ar-us, a modified, real-time version of the Loose and Sketchy algorithm used to render graphics in an AR environment. The primary challenge was to modify the original algorithm to produce a NPR effect at interactive frame rate. Our algorithm renders moderately complex scenes at multiple frames per second. Equipped with a handheld visor, visitors can see the real environment overlaid with virtual objects with both the real and virtual content rendered in a non-photorealistic style.
ECLS: An Efficient Cooperative Localization Scheme For Wireless Sensor and Actor Networks
Authors: HAN Peng, GAO Chuanshan, YANG Min, MAO Dilin, YU Bo
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In wireless sensor and actor networks, many applications depend on position information of those sensors sensing the physical world. Many localization schemes have been proposed In WSNs or Ad Hoc, however, due to the difference between them and WSANs, these schemes may not be well suited for WSANs. In this paper, we analyze why the existing localization schemes are not adaptive to WSANs and then we present ECLS, a novel localization schemes we design for the unique features and application requirements of WSANs. ECLS is an event-driven localization method which is characterized by such new ideas as limited beacons and actors cooperation. In additional, via simulation experiments, we prove that the positioning error of the ECLS doesn't exceed 0.5m and the energy consumption of the system can be limited to a lower level compared with other existing localization schemes.
Exploring the role of requirements engineering in improving risk management
Authors: James Chisan, Daniela Damian
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

There is limited evidence [1,4,5] which supports claims in literature that Requirements Engineering (RE) can have positive effects on an organization's ability to manage project risk. Such evidence can serve to motivate industrial adoption of requirements engineering techniques, but it can also contribute to our understanding of the role of RE in supporting project management activities. This paper presents an analysis of the causal relationship between RE practice and benefits in risk management in one software organization that revised its RE process and enjoyed improvements in its project management activities. In particular, we present insights from our investigation of the interaction between the RE process and the processes of project planning and SQA. We found that elements of the RE process such as feature decomposition, structure documentation and traceability links improved feature sizing and enabled effective change management, contributing to improved risk management activities. These findings are useful to practitioners in similar software organizations whose product release objectives originate from a remote business unit and who currently suffer from significant feature creep.
Writer Profiling Using Handwriting Copybook Styles
Authors: Sungsoo Yoon, Seungseok Choi, Sung-Hyuk Cha, Charles C. Tappert
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Handwriting originates from a particular copybook style such as Palmer or Zaner-Bloser that one learns in childhood. Since questioned document examination plays an important investigative and forensic role in many types of crime, it is important to develop a system that helps objectively identify a questioned document's handwriting style. We proposed a handwriting analysis system that can assist a document examiner in the identification of the writer's handwriting style and therefore of his/her origin or nationality. We collected 33 English alphabet copybook styles from 18 countries. Here, we extend the analysis using several data mining techniques to discover important information that can be gleaned from a handwriting copybook style image database, e.g., the most information- bearing alphabet characters for the purpose of copybook style identification and the relationship between geographical regions and similarity based clusters of copybook styles.
Generalized Alon--Boppana Theorems and Error-Correcting Codes
Authors: Joel Friedman, Jean-Pierre Tillich
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper we describe several theorems that give lower bounds on the second eigenvalue of any quotient of a given size of a fixed graph, $G$. These theorems generalize Alon--Boppana-type theorems, where $G$ is a regular (infinite) tree. When $G$ is a hypercube, our theorems give minimum distance upper bounds on linear binary codes of a given size and information rate. Our bounds at best equal the current best bounds for codes and apply only to linear codes. However, it is of interest to note that (1) one very simple Alon--Boppana argument yields nontrivial code bound, and (2) our Alon--Boppana argument that equals a current best bound for codes has some hope of improvement. We also improve the bound in sharpest known Alon--Boppana theorem (i.e., when $G$ is a regular tree).
A Maximum Principle for Linear Total Differential Control Systems with One-Parametric Input
Authors: I. V. Gaishun
Venue: Automation and Remote Control (2005)

Optimality conditions for linear time-varying control systems with one-parametric input (dependent on the sum of coordinates of the time variable) and terminal quality criterion are derived in the form of a maximum principle.
Beyond the point cloud: from transductive to semi-supervised learning
Authors: Vikas Sindhwani, Partha Niyogi, Mikhail Belkin
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Due to its occurrence in engineering domains and implications for natural learning, the problem of utilizing unlabeled data is attracting increasing attention in machine learning. A large body of recent literature has focussed on the transductive setting where labels of unlabeled examples are estimated by learning a function defined only over the point cloud data. In a truly semi-supervised setting however, a learning machine has access to labeled and unlabeled examples and must make predictions on data points never encountered before. In this paper, we show how to turn transductive and standard supervised learning algorithms into semi-supervised learners. We construct a family of data-dependent norms on Reproducing Kernel Hilbert Spaces (RKHS). These norms allow us to warp the structure of the RKHS to reflect the underlying geometry of the data. We derive explicit formulas for the corresponding new kernels. Our approach demonstrates state of the art performance on a variety of classification tasks.
Ensuring data integrity in storage: techniques and applications
Authors: Gopalan Sivathanu, Charles P. Wright, Erez Zadok
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

Data integrity is a fundamental aspect of storage security and reliability. With the advent of network storage and new technology trends that result in new failure modes for storage, interesting challenges arise in ensuring data integrity. In this paper, we discuss the causes of integrity violations in storage and present a survey of integrity assurance techniques that exist today. We describe several interesting applications of storage integrity checking, apart from security, and discuss the implementation issues associated with techniques. Based on our analysis, we discuss the choices and trade-offs associated with each mechanism. We then identify and formalize a new class of integrity assurance techniques that involve logical redundancy. We describe how logical redundancy can be used in today's systems to perform efficient and seamless integrity assurance.
Healing the relevance vector machine through augmentation
Authors: Carl Edward Rasmussen, Joaquin Quiñonero-Candela
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties have the unintuitive property, that they get smaller the further you move away from the training cases. We give a thorough analysis. Inspired by the analogy to non-degenerate Gaussian Processes, we suggest augmentation to solve the problem. The purpose of the resulting model, RVM*, is primarily to corroborate the theoretical and experimental analysis. Although RVM* could be used in practical applications, it is no longer a truly sparse model. Experiments show that sparsity comes at the expense of worse predictive. distributions.
Nonseparating Planar Chains in 4-Connected Graphs
Authors: Sean Curran, Orlando Lee, Xingxing Yu
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper, we describe an O(|V(G)||E(G)|) algorithm for finding a nonseparating planar chain in a 4-connected graph G, which will be used to decompose an arbitrary 4-connected graph into planar chains. This work was motivated by the study of a multitree approach to reliability in distributed networks, as well as the study of nonseparating induced paths in highly connected graphs.
Studying the XML Web: Gathering Statistics from an XML Sample
Authors: Denilson Barbosa, Laurent Mignet, Pierangelo Veltri
Venue: World Wide Web (2005)

XML has emerged as the language for exchanging data on the web and has attracted considerable interest both in industry and in academia. Nevertheless, to date, little is known about the XML documents published on the web. This paper presents a comprehensive analysis of a sample of about 200,000 XML documents on the web, and is the first study of its kind. We study the distribution of XML documents across the web in several ways; moreover, we provided a detailed characterization of the structure of real XML documents. Our results provide valuable input to the design of algorithms, tools and systems that use XML in one form or another.