ppxscal/embedding_network huggingface dataset:
Distributed computing by the Monte Carlo method
Authors: M. A. Marchenko, G. A. Mikhailov
Venue: Automation and Remote Control (2007)

Questions of effective parallel realization for some algorithms of the Monte Carlo method are discussed. Parallel modification of the generator of basic pseudorandom numbers uniformly distributed in the unit interval is described. The technique of distributed computing in the personal computer network with the use of the MONC program system worked out by the authors is described.
Pilot summer camps in computing for middle school girls: from organization through assessment
Authors: Peggy Doerschuk, Jiangjiang Liu, Judith Mann
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

It is a well-known fact that women are under-represented in computing, and that trend has been worsening. In recent years, very few entering female freshmen have expressed an interest in computer science. Research has shown that girls lose interest in computing at an early age. If we are to fill the pipeline with women we must reach out to girls to remove the hurdles and dispel the misconceptions that turn them away from computing. This paper describes our experience in conducting pilot summer camps in computing for middle school girls. It covers the whole process, from conception through assessment, including how we worked with local schools to organize and devise the content of the camps, and how the camps were funded, conducted, advertised and assessed. We include lessons learned from this experience to benefit those who want to implement such camps. Other organizations can use the information in this paper to guide them in developing similar programs.
Spectral analysis for Doppler radar: a parametric model for regularisation
Authors: G. Le Foll
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The authors propose a new spectral analysis technique for Doppler radar. They present some limitations of classical methods which motivate their study. Particularly they insist on bias introduced on the wind speed profile in the case of wind shear and strong variations of the reflectivity. In order to improve this behaviour, they introduce a realistic backscattered wave modeling based on stratification of the range gate. Regularisation is necessary to compensate observation limitation specially for some range gates where the SNR is poor. For this purpose they introduce a parametric wind speed profile, to take into account spatio-temporal continuity. They propose a second order steepest descent algorithm which recursively fits the parametric spectrum to the observation. Simulation results demonstrate the expected improvement. The algorithm is also tested on real data.
A Case Study on Community-enabled SOA Application Development
Authors: Liu Ying, Feng Chenhua, Wei Zhao, Su Hui, Liu Hehui
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

The idea to leverage large numbers of the open community resources is straightforward to cater the expectation on reducing the development cost. Knowledge protection and quality assurance in this process are critical challenges for the overall success of such kind of software outsourcing. It is pivotal to provide methods and technologies to ensure all the goals of low cost, no knowledge loss as well as high quality while outsourcing development works to open communities. Call-For-Implementation development method put forward in this paper intends to distribute implementation tasks to the developers of open communities through partitioning a holistic design into pieces of work segments based on some knowledge protection policies. Although CFI method can be widely used for any types of applications, SOA applications are regarded exactly suitable for this method since the components of SOA applications are designed to be loosely coupled. In this paper, we present our study on conducting the CFI method on a real SOA application. Some metrics are defined for validating the hypotheses of the CFI method, including lower cost, knowledge protection, and quality assurance. Measurement result analysis of this case is presented and findings acquired are also reported.
Enhancing Neighborship Consistency for Peer-to-Peer Distributed Virtual Environments
Authors: Jehn-Ruey Jiang, Jiun-Shiang Chiou, Shun-Yun Hu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Although P2P-based DVEs can potentially solve the scalability issues, other important issues such as consistency remain unexplored. In this paper, we address neighborship consistency, which is the ratio between the number of known nodes and the number of actual nodes within a node's area of interest (AOI). We address two factors that affect neighborship consistency for DVEs using Voronoi-based Overlay Network (VON). We propose adaptive AOI buffer and critical node detection to reduce the negative impacts of the two factors. We also perform simulation experiments to demonstrate the effects of the two factors before and after adopting the proposed mechanisms.
Fuzzy variant of a statistical test point Kalman filter
Authors: Gregory R. Hudas, Ka. C. Cheok, James L. Overholt
Venue: International Journal of Approximate Reasoning (2007)

In this paper, we propose the conceptual use of fuzzy clustering techniques as iterative spatial methods to estimate a posteriori statistics in place of the weighted averaging scheme of the Unscented Kalman filter. Specifically, instead of a linearization methodology involving the statistical linear regression of the process and measurement functions through some deterministically chosen set of test points (sigma points) contained within the ''uncertainty region'' around the state estimate, we present a variant of the Unscented transformation involving fuzzy clustering techniques which will be applied to the test points yielding ''degrees of membership'' in which Gaussian shapes can be ''fit'' using a least squares scheme. Implementation into the Kalman methodology will be shown along with simple state and parameter estimation examples.
Evolving the Link
Authors: Danny Ayers
Venue: IEEE Internet Computing (2007)

The author focuses on the hyperlink, and discusses early criticisms of the Web's most basic--though arguably the most powerful--feature
Efficient sentence retrieval based on syntactic structure
Authors: Ichikawa Hiroshi, Hakoda Keita, Hashimoto Taiichi, Tokunaga Takenobu
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual retrieval based on Tree Kernel is not practicable because the size of the index table by Tree Kernel becomes impractical. We propose more efficient algorithms approximating Tree Kernel: Tree Overlapping and Subpath Set. These algorithms are more efficient than Tree Kernel because indexing is possible with practical computation resources. The results of the experiments comparing these three algorithms showed that structural retrieval with Tree Overlapping and Subpath Set were faster than that with Tree Kernel by 100 times and 1,000 times respectively.
Cross platform support in Tk
Authors: Ray Johnson, Scott Stanton
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

Tk currently supports a wide variety of X based platforms. In this paper we describe work in progress at Sun Microsystems Laboratories to make Tcl and Tk support non-X platforms. The changes described here will allow script writers to migrate Tk applications to Microsoft Windows and Apple Macintosh systems with little effort. In addition, scripts running on these systems will have the appropriate look and feel for each system.
Blind synchronization and Doppler spread estimation for MSK signals in time-selective fading channels
Authors: M. Ghogho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Blind synchronization of minimum-shift-keying signals in the context of time-selective fading communication channels is considered. Strictly feedforward algorithms based on second- and fourth-order cyclic statistics are proposed for frequency and timing offset estimation. The new estimators are shown to outperform existing methods. Extensions of the algorithm to GMSK are also studied. Finally, fourth-order cyclic statistics are shown to provide an accurate estimate of the Doppler spread.
Modularization with Externalization of Control Flow
Authors: Urjaswala Vora
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The architectural design decides the quality and the longevity of the software. Gross decomposition of a system into interacting components using proper abstractions for component interaction defines the modularity of the system which in turn decides the values of quality attributes such as performance, reliability, security and modifiability as well as the percentage of design reuse. The decisions of modularization are supported by metrics like cohesion and coupling. In this paper we will focus on the quality attributes, modifiability and evolvability of a system which are overlapping to a large extent and which mainly get affected by the modularization of the system. The principle of encapsulation in Object Oriented (OO) design overcame the flaws present in structured methodology due to separate data and process components and their interdependencies. But problems in the evolution of OO systems due to crosscutting concerns were resolved using Aspect Oriented paradigm. The externalization of business logic using rule-based systems also was taken as solution to the evolution of complex software systems. Here we focus on the different existing modularization solutions which support the evolvability of a software and the framework CFFES (Control Flow Framework for Evolving Systems) proposed by us.
Efficient code density through look-up table compression
Authors: Talal Bonny, Joerg Henkel
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Code density is a major requirement in embedded system design since it not only reduces the need for the scarce resource memory but also implicitly improves further important design parameters like power consumption and performance. Within this paper we introduce a novel and efficient hardware-supported approach that belongs to the group of statistical compression schemes as it is based on Canonical Huffman Coding. In particular, our scheme is the first to also compress the necessary Look-up Tables that can become significant in size if the application is large and/or high compression is desired. Our scheme optimizes the number of generated Look-up Tables to improve the compression ratio. In average, we achieve compression ratios as low as 49% (already including the overhead of the Lookup Tables). Thereby, our scheme is entirely orthogonal to approaches that take particularities of a certain instruction set architecture into account. We have conducted evaluations using a representative set of applications and have applied it to three major embedded processor architectures, namely ARM, MIPS and PowerPC.
A fast stochastic parser for determining phrase boundaries for text-to-speech synthesis
Authors: R. A. Sharman, J. H. Wright
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A stochastic parser is described which creates a phrase structure for a tagged sentence on the basis of statistical information inferred from a manually-bracketed training corpus. The information employed consists of measured probabilities for tag unigrams, symbol bigrams, bracket enclosures, bracket opening and closing, and length distribution. For experimental purposes a tree-search algorithm is used to find the highest-scoring bracketing, and a tree metric is used to measure the accuracy of the results for a test corpus. Finally, a fast algorithm for implementation is based on a finite-state approximation to the tree-search algorithm. Using these procedures, a gross level of syntactic structure is found quickly, with the main aim being that of pause insertion in real-time text-to-speech systems.
Effects of a learning community program on the first-year experience of engineering majors
Authors: B. B. Alexander
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Learning communities can potentially have a significant impact on the freshman student experience, particularly at large research institutions. Yet the implementation of learning communities at large universities poses many challenges. In Fall and Spring of 1995-96 the University of Wisconsin-Madison piloted the Freshmen Learning Community Program (FLCP), thus rising to meet these challenges. The Learning through Evaluation, Adaptation, and Dissemination (LEAD) Center, a third-party evaluation unit at the University of Wisconsin-Madison, conducted the evaluation of the FLCP. Evaluation findings indicated that the Fall 1995 Program was moderately successful for a small subset of the students in the FLCP. Based on the Fall evaluation findings several specific changes to the FLCP were implemented in the Spring 1996 program that resulted in more benefits experienced by a broader range of students. Evaluation findings indicate that the Spring Program was effective in addressing key problems faced by students at a large university. Most notably it functioned to "shrink the size" of the university in several ways. The program appeared to foster a sense of group identity, providing students with a sense of belonging at the University. It also had a significant impact on student learning processes primarily through fostering a more collaborative learning approach. This paper will explore the program development and the student experience in the Fall 1995 and Spring 1996 iterations of the program.
Cluster Based Training for Scaling Non-linear Support Vector Machines
Authors: S. Asharaf, M. Narasimha Murty, S. K. Shevade
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Support Vector Machines(SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involvingmore than a few thousands of data points. In this paper, we propose a novel kernel based incremental data clustering approach and its use for scaling Non-linear Support Vector Machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of Support Vector Machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense.
Colin Mochrie vs. Jesus H. Christ: Messages About Masculinities and Fame in Online Video Conversations
Authors: Lori Kendall
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With the availability of relatively easy-to-use tools for online video creation and distribution, people are increasingly producing videos not just for artistic expression, but also as a form of communication. This article examines two types of online video conversations, one within a specific online subculture, and one a series of responses to one particularly wellknown video. Videos lend themselves to the expression of ambiguity, contradictory meanings, taboo topics, and emotions. Within these two video conversations, topics include discussions of masculinity, identity, and fame.
Detecting spam in VoIP networks
Authors: Ram Dantu, Prakash Kolan
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

Voice over IP (VoIP) is a key enabling technology for the migration of circuit-switched PSTN architectures to packet-based networks. The problem of spam in VoIP networks has to be solved in real time compared to e-mail systems. Many of the techniques devised for e-mail spam detection rely upon content analysis and in the case of VoIP it is too late to analyze the media after picking up the receiver. So we need to stop the spam calls before the telephone rings. From our observation, when it comes to receiving or rejecting a voice call people use social meaning of trust and reputation of the calling party. In this paper, we describe a multi-stage spam filter based on trust, and reputation for detecting the spam. In particular we used closed loop feedback between different stages in deciding if the incoming call is a spam or not. For verifying the concepts, we used a laboratory setup of several thousand soft-phones and a commercial grade proxy server. We verified our filtering mechanisms by simulating the spam calls and measured the accuracy of the filter. Results show that multistage feedback loop fares better than any single stage. Also, the larger the network size, the harder to detect a spam call. Further work includes understanding the behavior of different controlling parameters in trust and reputation calculations and deriving meaningful relationships between them.
License-plate localization by using vector quantization
Authors: S. Rovetta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The paper describes a novel approach using vector quantization (VQ) to process vehicle images for automated identification. The VQ-based method yields superior quality in picture compression for archival purposes, and, at the same time, supports the localization of text regions in the image effectively. As opposed to standard approaches, VQ encoding gives some hint about the contents of image regions; such information is exploited to boost localization performance. The VQ system may be trained empirically from examples; this provides adaptiveness and on-field tuning facility. The approach has been tested in a real application and included satisfactorily into a complete system for vehicle identification.
Experience in teaching a graduate course in mobile computing
Authors: S. K. S. Gupta
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The need for "information anywhere anytime" has been a driving force for the increasing growth in Web and Internet technology, wireless communication, and portable computing devices. The field of mobile computing is the merger of these advances in computing and communication with the aim of providing seamless and ubiquitous computing environment for mobile users. Mobile computing environments are characterized by severe resource constraints and frequent changes in operating conditions. This has motivated research in many challenging problems which span several areas of computer science, computer engineering and electrical engineering, such as network protocols to support mobility, efficient and adaptive resource management techniques for wireless bandwidth and battery power, predicting mobility patterns, performance modeling and simulation of mobile applications, and supporting mobile real time multimedia applications. The paper describes the experience of the authors in designing and teaching a senior/graduate level mobile computing course at Colorado State University. This course was designed for students in computer science, electrical engineering and computer engineering. The goal was to provide an in-depth understanding of the fundamental problems in the area of mobile computing and present the existing and proposed solutions for these problems from both research and development perspectives. In addition to regular homework and exams, students did term projects/papers to explore topics of their interest in more depth. Several mid-term and end-of-semester evaluations were done to gauge student satisfaction and shortcomings of the course and these evaluations were very positive.
Binary Search Tree: An Efficient Overlay Structure to Support Range Query
Authors: Brajesh Kumar Shrivastava, Guruprasad Khataniar, Diganta Goswami
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Finding an efficient and scalable solution for range query to discover the contents in the presence of transient node populations and heterogeneity among them is a well-known challenging problem in peer-to-peer (P2P) systems. Transient node population results in high churn rate and hence requires frequent updates in routing table, while heterogeneity causes unfair distribution of resources as well as responsibilities among nodes. We propose an overlay structure based on m- Binary Search Tree (BST) that provides an efficient and scalable solution for point and range query. We arrange the whole key space in lexicographic order and divide it into different key intervals. Each key interval is assigned to a BST. We have achieved intra-group and inter-group query processing in O(log |Gj |) messages, where |Gj | is the number of nodes in the destination group. Our approach results in less overhead to update the routing table even in the case of high churn rate.
Automation of PE recruiting process
Authors: Eric Omwega, Jonathan Tsu, Monica Ugwi, Christine Wang
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Our web-based PE Recruiting System assists the athletic department in keeping track of potential recruits. It consists of two parts: a recruit site and a coach site. The recruit site allows recruits to create accounts and profiles, obtain campus visit information, and contact coaches. The coach site supports managing recruit data, sending email/letter, logging telephone calls, maintaining coach to-do lists and handling admission referrals.
Building systems that flexibly control downloaded executable context
Authors: Trent Jaeger, Aviel D. Rubin, Atul Prakash
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Downloading executable content, which enables principals to run programs from remote sites, is a key technology in a number of emerging applications, including collaborative systems, electronic commerce, and web information services. However, the use of downloaded executable content also presents serious security problems because it enables remote principals to execute programs on behalf of the downloading principal. Unless downloaded executable content is properly controlled, a malicious remote principal may obtain unauthorized access to the downloading principal's resources. Current solutions either attempt to strictly limit the capabilities of downloaded content or require complete trust in the remote principal, so applications which require intermediate amounts of sharing, such as collaborative applications, cannot be constructed over insecure networks. In this paper, we describe an architecture that flexibly controls the access rights of downloaded content by: (1) authenticating content sources; (2) determining content access rights based on its source and the application that it is implementing; and (3) enforcing these access rights over a wide variety of objects and for the entire computation, even if external software is used. We describe the architecture in the context of an infrastructure for supporting collaborative applications.