ppxscal/embedding_network huggingface dataset:
An interdisciplinary field robotics program for undergraduate computer science and engineering education
Authors: Christopher Kitts, Neil Quinn
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

Santa Clara University's Robotic Systems Laboratory conducts an aggressive robotic development and operations program in which interdisciplinary teams of undergraduate students build and deploy a wide range of robotic systems, ranging from underwater vehicles to spacecraft. These year-long projects expose students to the breadth of and interdependence among engineering disciplines, the span of processes in a system development lifecycle, and the challenges of managing a development process. Over the past five years, this program has provided more than 150 students with exposure to computer science and engineering topics, including software engineering, algorithm development, human-computer interface design, and artificial intelligence. This program provides exciting and compelling educational opportunities for students, offers real-world applications that naturally motivate the need for specific computing technologies, and serves a broader research and development program that utilizes the functional robotic systems to support externally-funded science and technology demonstration missions. The experience of the authors, as well as formal program assessment data, show that this program provides strong student motivation for learning, offers comprehensive and valuable educational experiences, and enhances student performance. This article reviews the Santa Clara robotics program, highlights the role of computer science and engineering in several projects, and presents the assessment data showing the positive results of this program.
The ring grooming problem
Venue: Networks (2004)

The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related ring-grooming problem of minimizing the number of add&sol;drop locations instead of the number of rings; in a number of situations this is a better approximation to the true equipment cost. Our main result is a new lower bound for the case of uniform traffic. This allows us to prove that a certain simple algorithm for uniform traffic is, in fact, a constant-factor approximation algorithm, and it also demonstrates that known lower bounds for the general problem&mdash;in particular, the linear programming relaxation&mdash;are not within a constant factor of the optimum. We also show that our results for uniform traffic extend readily to the more practically important case of quasi-uniform traffic. Finally, we show that if the number of nodes on the ring is fixed, then ring grooming is solvable in polynomial time; however, whether ring grooming is fixed-parameter tractable is still an open question. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;3&rpar;, 194&ndash;202 2004
Scale-free geometry in OO programs
Authors: Alex Potanin, James Noble, Marcus Frean, Robert Biddle
Venue: Communications of the ACM (2005)

Though conventional OO design suggests programs should be built from many small objects, like Lego bricks, they are instead built from objects that are scale-free, like fractals, and unlike Lego bricks.
Compensating for low frame rates
Authors: Hendrik Knoche, Hermann de Meer, David Kirsh
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Experiments were conducted to investigate the interdependency of frame rates (30, 15, 10 fps) and audio-visual skew (from +163 to -233 ms1). Noised nonsense words like 'abagava' were presented to 20 participants who were asked to identify the middle consonant. At low frame rates (10 fps) consonant perception was impaired when audio ran ahead of video content (skew of ?113 to ?233ms). When audio lagged video, performance improved monotonically to a maximum at +167ms, where performance equaled 30fps in synch. The results suggest that frame rate and skew are not orthogonal parameters but must both be taken into consideration for AV-delivery. The findings do not support the current notion that 10 fps videos do not adequately capture visual content for speech perception. Participants were able to integrate the given bi-modal information as well as the 30 fps condition if the audio channel was subjected to an additional 167ms delay.
Efficient Secret Sharing with Access Structures in a Hierarchy
Authors: Chu-Hsing Lin, Wei Lee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In 2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithm to reuse shadows, and adopted Cho [4]mechanism to achieve theproperties of hierarchical key management. However, Changk scheme requires a lot of time for computation. In this paper, we adopt one-way hash function to allow the shadows to be reused and achieve the properties of hierarchical access control. The proposed scheme is more efficient than Changk scheme.
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Authors: O. V. Borodin, A. N. Glebov, A. Raspaud, M. R. Salavatipour
Venue: Journal of Combinatorial Theory Series B (2005)

Planar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, it is proved that each proper 3-coloring of a face of length from 8 to 11 in a connected plane graph without cycles of length from 4 to 7 can be extended to a proper 3-coloring of the whole graph. This improves on the previous results on a long standing conjecture of Steinberg.
First story detection using a composite document representation
Authors: Nicola Stokes, Joe Carthy
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper, we explore the effects of data fusion on First Story Detection [1] in a broadcast news domain. The data fusion element of this experiment involves the combination of evidence derived from two distinct representations of document content in a single cluster run. Our composite document representation consists of a concept representation (based on the lexical chains derived from a text) and free text representation (using traditional keyword index terms). Using the TDT1 evaluation methodology we evaluate a number of document representation strategies and propose reasons why our data fusion experiment shows performance improvements in the TDT domain.
Exploiting the deep web with DynaBot: matching, probing, and ranking
Authors: Daniel Rocco, James Caverlee, Ling Liu, Terence Critchlow
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We present the design of Dynabot, a guided Deep Web discovery system. Dynabot's modular architecture supports focused crawling of the Deep Web with an emphasis on matching, probing, and ranking discovered sources using two key components: service class descriptions and source-biased analysis. We describe the overall architecture of Dynabot and discuss how these components support effective exploitation of the massive Deep Web data available.
Discrete Wavelet Descriptor for 2D Shape
Authors: Kimcheng Kith, El-hadi Zahzah
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The aim of this paper is to propose a 2D shape recognition method under similitude transforms using the Discrete Dyadic Wavelet Transform with desimation (DWT). We propose four techniques to fix the starting point nexessary to obtain the same object representation in the framework of objects retrieval system. These representations are obtained by applying the DWT on the contour signature. We also propose a method to select a decomposition level of the DWT. These different solutions are assessed and compared using 1400 2D objects extracted from the MPEG7 database.
On characterization of catastrophic faults in two-dimensional VLSI arrays
Authors: Soumen Maity, Amiya Nayak, Bimal K. Roy
Venue: Integration, the VLSI Journal (2004)

The catastrophic fault pattern (CFP) is a pattern of faults occurring at strategic locations that may render a system unusable regardless of its component redundancy and of its reconfiguration capabilities. In this paper, we extend the characterization of catastrophic fault patterns known for linear arrays to two-dimensional VLSI arrays in which all links are bidirectional. We determine the minimum number of faults required for a fault pattern to be catastrophic. The width of a fault pattern must fall within precise bounds for the pattern to be catastrophic. We outline an algorithm for the construction of a CFP with the maximum width for a given link redundancy. This algorithm gives us the framework for achieving specific upper and exact bounds on the width of CFP for a given link configuration. We give necessary and sufficient conditions for a fault pattern to be catastrophic with respect to a link redundancy. Finally we provide an algorithm to test whether a given fault pattern is catastrophic with respect to a link redundancy.
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
Authors: Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
Venue: Distributed Computing (1991)

This paper presents an efficient randomized emulation of single-hop radio network with collision detection on multi-hop radio network without collision detection. Each step of the single-hop network is emulated by O((D + log n/ε) log Δ) rounds of multi-hop network and succeeds with probability ≥ 1 - ε. (n is the number of processors, D the diameter and Δ the maximum degree). It is shown how to emulate any polynomial algorithm such that the probability of failure remains ≥ ε. A consequence of the emulation is an efficient randomized algorithm for choosing a leader in a multi-hop network.
Web development group: an enterprising campus-based internship program for CS majors
Authors: Joan Peckham, Trent Batson
Venue: Journal of Computing Sciences in Colleges (2004)

The Web Development Group (WDG) at the University of Rhode Island was formed to provide the university with an experienced group of developers to meet the demands of departments on campus that are in need of web-based software. An equally important goal is to provide the computer science department with a means to deliver to their students a required eight credits and two semesters of practical internship experience (CS 499). This group was formed by the director of campus information and instructional technology services (IITS) in collaboration with the computer science department. A robust industrial business model has been developed to contract, manage, develop, and maintain the group's web-based software products. The students are graduate and undergraduate, and come primarily from the computer science (BS, BA, and MS) and business (MIS and MBA) programs.
Data management requirements for large scale design and production
Authors: Malcolm Atkinson, Neil Wiseman
Venue: ACM SIGDA Newsletter (1977)

The paper sets out to clarify and expose the differences and similarities between the data organisation requirements in two ranges of computer activity. These are computing in administration and computing in design. In both cases the man and machine synergy is supported by large bodies of data, so that we may expect the activities to be comparable.
Extending the discipline: how software can help or hinder human decision making (and vice-versa)
Authors: Peter Ayton
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Developments in computing offer experts in many fields specialised support for decision making under uncertainty. However, the impact of these technologies remains controversial. In particular, it is not clear how advice of variable quality from a computer may affect human decision makers. Here I review research showing strikingly diverse effects of computer support on expert decision-making. Decisions support can both systematically improve or damaged the performance of decision makers in subtle ways depending on the decision maker's skills, variation in the difficulty of individual decisions and the reliability of advice from the support tool.In clinical trials decision support technologies are often assessed in terms of their average effects. However this methodology overlooks the possibility of differential effects on decisions of varying difficulty, on decision makers of varying competence, of computer advice of varying accuracy and of possible interactions among these variables. Research that has teased apart aggregated clinical trial data to investigate these possibilities has discovered that computer support was less useful for - and sometimes hindered - professional experts who were relatively good at difficult decisions without support; at the same time the same computer support tool helped those experts who were less good at relatively easy decisions without support. Moreover, inappropriate advice from the support tool could bias decision makers' decisions and, predictably, depending on the type of case, improve or harm the decisions.
Large-scale local search heuristics for the capacitated vertex <toggle>p</toggle>-center problem
Venue: Networks (2004)

This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex p-center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowed from network optimization theory to efficiently detect cost-decreasing solutions in such a neighborhood. We complement the multiexchange methodology with a relocation mechanism specifically designed to perform facility location adjustments. The validity of the proposed approach is supported by empirical investigation and performance comparisons with the commercial code CPLEX. &copy; 2004 Wiley Periodicals, Inc.
IPSAP: A High-performance Parallel Finite Element Code for Large-scale Structural Analysis Based on Domain-wise Multifrontal Technique
Authors: Seung Jo Kim, Chang Sung Lee, Jeong Ho Kim, Minsu Joh, Sangsan Lee
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Most of researches for large-scale parallel structural analysis have focused on iterative solution methods since direct solution methods generally have many difficulties and disadvantages for large-scale problems. However, due to the numerical robustness of direct methods that guarantees the solution to be obtained within estimated time, direct methods are much more desirable for general application of large-scale structural analysis, if the difficulties and disadvantages can be overcome. In this research, we propose the domain-wise multifrontal solver as an efficient direct solver that can overcome most of these difficulties and disadvantages. By using our own structural analysis code IPSAP which uses the proposed solver, we can solve the largest problem ever solved by direct solvers and can sustain 191 Gflop/s with 256 CPUs on our self-made cluster system, Pegasus. By implementing the block Lanczos algorithm using our solver, IPSAP can solve eigen problems with 7 millions of DOFs within one hour.
Software composition and verification for sensor networks
Authors: P. Völgyesi, M. Maróti, S. Dóra, E. Osses, Á. Lédeczi
Venue: Science of Computer Programming (2005)

Component-based design has become a necessity for networked embedded systems where hardware platforms come in a great variety and evolve extremely rapidly. Operating system components and higher level middleware services call for modular software construction along clear interfaces. The way we describe these interfaces and process the captured information is of crucial importance for exploiting the benefits of component-based design. In this paper we present a model based approach to the development of embedded applications with a special emphasis on interface specification. The proposed formalism captures the temporal and type aspects of interfaces and supports the composition and verification of components. Along with the formal definition of the proposed interface language and component compatibility rules, we present a modeling environment targeting TinyOS, a representative embedded operating system. Two prototype tools are also described that check the composability of components based on their interface models and verify that the implementation of a component matches its formal model, respectively.
The mixing time of the thorp shuffle
Authors: Ben Morris
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

The Thorp shuffle is defined as follows. Cut the deck into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip; then drop from the other pile. Continue this way until both piles are empty. We show that the mixing time for the Thorp shuffle with 2d cards is polynomial in d.
The e-transformation of western China
Authors: Robert M. Davison, Douglas R. Vogel, Roger W. Harris
Venue: Communications of the ACM (2005)

Western China is a vast area of just over four million square kilometers traditionally associated with the historic Silk Road connecting traders, manufacturers, and consumers in Europe and Asia. But for the past few hundred years, the Silk Road has largely been forgotten. Today, however, China's opening to the outside world and general trend toward technological modernization is starting to be felt in these far-western regions. The emergence of e-commerce in coastal China is well-documented [7]. Here, we report on the technological changes taking place in Western China, assessing the prospects for its economic and social development ahead. We focus on what we term the e-transformation of the Tibetan (Xizang), Xinjiang Uygur, and Ningxia Hui autonomous regions and Qinghai and Gansu provinces (see the Figure). These areas cover 43% of the land mass of China, yet include only 4% of the country's overall population of more than 1.3 billion.
Asynchronous collaborative design
Authors: Leslie Tudor, Julie Radford-Davenport
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

As new usability support analysts at SAS Institute, the authors were challenged with the goal of gathering design input from a diverse population of internal and external design stakeholders. After considering participatory design as the methodology of choice, it was found that simultaneous, collaborative sessions were not possible due to prospective participant time constraints. This constraint motivated the authors to devise and use Asynchronous Collaborative Design methods that were tailored to the specific needs of the data gathering efforts that took place throughout the duration of the project. All methods resulted in a rich set of data that informed subsequent design decisions. However, methods were also associated with drawbacks. The pros and cons of each method are described in this paper.
Apache Derby / IBM Cloudscape
Authors: Paul C. Zikopolous, George Baklarz, Dan Scott
Venue:  (2005)

Learn installation, configuration, management, and security Delve deeper with coverage on SQL, troubleshooting, application development, and moreMaster Apache Derby: the only open source, pure Java™, fully transactional, small-footprint RDBMSApache Derby is the world's only enterprise class open source, pure Java, fully transactional relational database. It's small enough to be embedded directly into your Java applications, providing a local data store that requires no DBA support. Powerful enough to support a wide range of traditional applications, this database ships as the default database for WebSphere Application Server and more than fifty other IBM software products. Apache Derby is built on the mature IBM Cloudscape code base IBM recently contributed to the open source community. The IBM Cloudscape code was nominated and won Developer.com's Product of the Year 2005 award.Now, IBM's own database experts have written a comprehensive guide to making the most of Apache Derby-and its commercial counterpart, IBM Cloudscape- in any development or production environment. This book systematically introduces the Apache Derby/IBM Cloudscape technology: where it fits and how to install and configure it-and how to build robust business applications and Web services with it, one step at a time.Coverage includes Comparing Apache Derby with the commercial IBM Cloudscape offering Deploying Apache Derby/IBM Cloudscape to support development and production environments, client/server environments, multi-threaded applications, and Web servers Integrating Apache Derby/IBM Cloudscape into a completely open source development environment Specific instruction on installing Apache Derby/IBM Cloudscape on Windows® and Linux® workstations-with tips on how to install the code on any platform that has a supported JVM Understanding how programming languages interact with Apache Derby/IBM Cloudscape Building complete sample applications step-by-step in JDBC, Windows (ODBC and .NET), PHP, Perl, and Python Managing and securing Apache Derby/IBM Cloudscape databases Writing SQL code for creating, retrieving, and updating data Troubleshooting installations, databases, and applicationsThis book has a companion Web site that contains links to the IBM version of Apache Derby and other downloadable code, documentation, articles, and other resources to give the reader a deeper understanding of some of the features available in Apache Derby. ibmpressbooks.com/title/0131855255www-306.ibm.com/software/data/awards/© Copyright Pearson Education. All rights reserved.
Reinventing the Supplier Negotiation Process at Motorola
Authors: Theresa Metty, Rob Harlan, Quentin Samelson, Tom Moore, Thomas Morris, Ron Sorensen, Avner Schneur, Olga Raskina, Rina Schneur, Joshua Kanner, Kevin Potts, Jeffrey Robbins
Venue: Interfaces (2005)

As the world market for telecommunications underwent a massive downturn in the early 2000s, Motorola, Inc. needed to cut costs and increase productivity throughout its operations. It had to identify a method of reducing the time and effort required to prepare for and conduct negotiations with its suppliers, simplify their coordination, and optimize contract awards across sectors, to save costs. Motorola's global procurement function selected Emptoris's end-to-end Internet negotiations platform. Combining innovative bidding, online supplier negotiations, and scenario-based optimization analysis, it identifies the best procurement strategy while enhancing supplier relationships. Sourcing over $16 billion and saving more than $600 million, including $200 million specifically driven by the platform's advanced capabilities, Motorola changed its supplier negotiation paradigm and moved to a truly global process.
Chinese syntactic parsing based on extended GLR parsing algorithm with PCFG
Authors: Yan Zhang, Bo Xu, Chengqing Zong
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper presents an extended GLR parsing algorithm with grammar PCFG* that is based on Tomita's GLR parsing algorithm and extends it further. We also define a new grammar---PCFG* that is based on PCFG and assigns not only probability but also frequency associated with each rule. So our syntactic parsing system is implemented based on rule-based approach and statistics approach. Furthermore our experiments are executed in two fields: Chinese base noun phrase identification and full syntactic parsing. And the results of these two fields are compared from three ways. The experiments prove that the extended GLR parsing algorithm with PCFG* is an efficient parsing method and a straightforward way to combine statistical property with rules. The experiment results of these two fields are presented in this paper.