ppxscal/embedding_network huggingface dataset:
An Investigation of Java Abstraction Usage for Program Modifications
Authors: Pamela O'Shea, Chris Exton
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

This paper reports upon the results of an investigation concerning the use and type of Java abstractions employed during software maintenance. The source of data consists of eighty-eight program summaries extracted from online developer mailing lists. Specifically, the summaries describing modifications, thirty-six in total, were examined from the perspective of five task types, including adaptive, corrective, emergency, perfective and preventive. Corrective and perfective task types were the two most commonly found. Abstractions are examined per task type and are also presented in three sequential stages as beginning, middle and end of the summaries. The results show that middle (within program level) abstractions dominate each task type, with the higher (system and architecture level) and lower (code and java virtual machine level) abstractions following respectively. The results detail the type of abstractions used in each task type and summarise the abstractions found for modifications in general with potential applications to support the design of Java software visualisation tools.
The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor's activation area
Authors: Tovi Grossman, Ravin Balakrishnan
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present the bubble cursor - a new target acquisition technique based on area cursors. The bubble cursor improves upon area cursors by dynamically resizing its activation area depending on the proximity of surrounding targets, such that only one target is selectable at any time. We also present two controlled experiments that evaluate bubble cursor performance in 1D and 2D target acquisition tasks, in complex situations with multiple targets of varying layout densities. Results show that the bubble cursor significantly outperforms the point cursor and the object pointing technique [7], and that bubble cursor performance can be accurately modeled and predicted using Fitts' law.
Minimum jerk motion planning for a prosthetic finger
Authors: Emanuele L. Secco, Antonio Visioli, Giovanni Magenes
Venue: Journal of Robotic Systems (2004)

In this paper we propose a method, based on both physiologic and engineering considerations, for the motion planning of a prosthetic finger. In particular, we exploit a minimum jerk approach to define the trajectory in the Cartesian space. Then, cubic splines are adopted in the joint space. The redundancy problem arising from the presence of three links is solved by assuming that there is a constant ratio between the second and the third joint motion. The value of the proportional constant is determined by minimizing the maximum jerk in the joint space. It is found that this constant value can be suboptimally but effectively set to one for all the movements. This approach guarantees a natural movement of the finger as well as reduced vibrations in the mechanical structure and increased control performances. &copy; 2004 Wiley Periodicals, Inc.
Service-Oriented Computing: Key Concepts and Principles
Authors: Michael N. Huhns, Munindar P. Singh
Venue: IEEE Internet Computing (2005)

Although traditional approaches--the ones embodied in CASE tools and modeling frameworks--are appropriate for building individual software components, but they aren't designed to face the challenges of open environments. Service-oriented computing provides a way to create a new architecture that reflects components' tendencies toward autonomy and heterogeneity.
An Adaptive Communication System for User's Resource Environment
Authors: Koji Hashimoto, Yoshitaka Shibata
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Although we can construct intercommunication environments by high quality video multicast streams such as DV (Digital Video) streams on super high speed networks, it is difficult for the reasonable network service users to join the high quality communication session. If we can use transcoding functions that include translator and mixer functions defined by RTP, it is able to transcode a media stream format into another stream format. Media transcoding functions are usefulness for intercommunication on heterogeneous computer networks. However, it is difficult for distributed communication systems to prepare the suitable transcoding nodes in advance because the required intercommunication environments are not always static. Accordingly, we should consider dynamic transcoding functions with relocatable decision methods. In this paper we propose a novel middleware system that realizes dynamic transcoding functions by extendable media stream.
The state of funding for new initiatives in computer science and engineering
Authors: David A. Patterson
Venue: Communications of the ACM (2005)

The intellectual opportunities are huge, the social benefits transforming, yet redesigning a workable funding model for CS&E research will require our collective imagination and collaboration between many IT sectors.
Girth and treewidth
Authors: L. Sunil Chandran, C. R. Subramanian
Venue: Journal of Combinatorial Theory Series B (2005)

The length of the shortest cycle in a graph G is called the girth of G. In particular, we show that if G has girth at least g and average degree at least d, then tw(G) = Ω(1/g+1 (d - 1)⌊(g - 1)/2⌋). In view of a famous conjecture regarding the existence of graphs with girth g, minimum degree δ and having at most c(δ - 1)⌊(g - 1)/2⌋ vertices (for some constant c), this lower bound seems to be almost tight (but for a multiplicative factor of g + 1).
A Tree Based Data Mining Prediction Scheme for Wireless Cellular Network
Authors: John Tsiligaridis, Raj Acharya
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

A centralized collaborative system between nodes and Base Stations (BSs) is developed, and a new prediction mobility scheme with Data Mining techniques is proposed so that the service of the handoff calls can be guaranteed. This new approach belongs to the Direct Group Mobility (DGM) prediction scheme and is based on the Tree Path Construction Algorithm (TPCON) and the Merge Tree Algorithm (MTA). Two Call Admission Control (CAC) algorithms are developed for each BS according to the predictive or adaptive policy for the reservation operation in order to minimize the call dropping probability. This study deals with the system behavior only at exceptional congestion time periods (periodical events).
Book review: Analogical Modeling of Language by Royal Skousen (Kluwer Academic Publishers, 1989)
Venue: ACM SIGART Bulletin (1990)

Royal Skousen's Analogical Modeling of Language is an ambitious attempt to define a new processing model of language use. According to this paradigm, the computation carried out when understanding and producing discourse is a process of comparing the current case/input with an entire corpus of previous cases and responding in the same way as in a randomly-chosen analogous case. This approach is in distinction to following rules (the conventional approach) or relying on associative memory (the connectionist approach).
Anonymity vs. Information Leakage in Anonymity Systems
Authors: Ye Zhu, Riccardo Bettati
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Measures for anonymity in systems must be on one hand simple and concise, and on the other hand reflect the realities of real systems. Such systems are heterogeneous, as are the ways they are used, the deployed anonymity measures, and finally the possible attack methods. Implementation quality and topologies of the anonymity measures must be considered as well. We therefore propose a new measure for the anonymity degree, which takes into account possible heterogeneity. We model the effectiveness of single mixes or of mix networks in terms of information leakage and measure it in terms of covert channel capacity. The relationship between the anonymity degree and information leakage is described, and an example is shown.
MPLS VPN Services for Converged Enterprise Networks
Authors: Chris Lewis, Steve Pickavance, Craig Huegen
Venue:  (2005)

A guide to using and defining MPLS VPN services Analyze strengths and weaknesses of TDM and Layer 2 WAN services Understand the primary business and technical issues when evaluating IP/MPLS VPN offerings Describe the IP addressing, routing, load balancing, convergence, and services capabilities of the IP VPN Develop enterprise quality of service (QoS) policies and implementation guidelines Achieve scalable support for multicast services Learn the benefits and drawbacks of various security and encryption mechanisms Ensure proper use of services and plan for future growth with monitoring and reporting services Provide remote access, Internet access, and extranet connectivity to the VPN supported intranet Provide a clear and concise set of steps to plan and execute a network migration from existing ATM/Frame Relay/leased line networks to an IP VPNIP/MPLS VPNs are compelling for many reasons. For enterprises, they enable right-sourcing of WAN services and yield generous operational cost savings. For service providers, they offer a higher level of service to customers and lower costs for service deployment.Migration comes with challenges, however. Enterprises must understand key migration issues, what the realistic benefits are, and how to optimize new services. Providers must know what aspects of their services give value to enterprises and how they can provide the best value to customers.Selecting MPLS VPN Services helps you analyze migration options, anticipate migration issues, and properly deploy IP/MPLS VPNs. Detailed configurations illustrate effective deployment while case studies present available migration options and walk you through the process of selecting the best option for your network. Part I addresses the business case for moving to an IP/MPLS VPN network, with a chapter devoted to the business and technical issues you should review when evaluating IP/MPLS VPN offerings from major providers. Part II includes detailed deployment guidelines for the technologies used in the IP/MPLS VPN.This book is part of the Networking Technology Series from Cisco Press®, which offers networking professionals valuable information for constructing efficient networks, understanding new technologies, and building successful careers.
Combining winnow and orthogonal sparse bigrams for incremental spam filtering
Authors: Christian Siefkes, Fidelis Assis, Shalendra Chhabra, William S. Yerazunis
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Spam filtering is a text categorization task that has attracted significant attention due to the increasingly huge amounts of junk email on the Internet. While current best-practice systems use Naive Bayes filtering and other probabilistic methods, we propose using a statistical, but non-probabilistic classifier based on the Winnow algorithm. The feature space considered by most current methods is either limited in expressivity or imposes a large computational cost. We introduce orthogonal sparse bigrams (OSB) as a feature combination technique that overcomes both these weaknesses. By combining Winnow and OSB with refined preprocessing and tokenization techniques we are able to reach an accuracy of 99.68% on a difficult test corpus, compared to 98.88% previously reported by the CRM114 classifier on the same test corpus.
Selected M-Related Dissertations Bibliography
Authors: Bob Krovetz, Susanne M. Humphrey
Venue: ACM SIGART Bulletin (1991)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using BRS Information Technologies, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Business Administration, General
XSLT by example
Authors: Daniele Braga, Alessandro Campi, Roberto Cappa, Damiano Salvi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

XQBE (XQuery By Example, [1]), a visual dialect of XQuery, uses hierarchical structures to express transformations between XML documents. XSLT, the standard transformation language for XML, is increasingly popular among programmers and Web developers for separating the application and presentation layers of Web applications. However, its syntax and its rule-based execution paradigm are rather intricate, and the number of XSLT experts is limited; the availability of easier "dialects" could be extremely valuable and may contribute to the adoption of XML for developing data-centered Web applications and services. With this motivation in mind, we adapted XQBE to serve as a visual interface for expressing XML-to-XML transformations and generate the XSLT code that performs such transformations.
A Novel Delay Fault Testing Methodology Using On-Chip Low-Overhead Delay Measurement Hardware at Strategic Probe Points
Authors: A. Raychowdhury, S. Ghosh, S. Bhunia, D. Ghosh, K. Roy
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

We propose a delay fault testing methodology using on-chip delay measurement hardware. We have designed a process-tolerant, low-overhead delay measurement hardware and developed an algorithm to judiciously insert the hardware at internal nodes of logic blocks. Experimental results for a set of ISCAS89 benchmarks show up to 16.9% improvement in transition fault coverage and up to 10.5% increase in the number of detected faults for segment delay fault model, with fixed test length. The reduction in test length is up to 59% for transition fault, with fixed target coverage. The delay and area overhead due to additional DFT logic is limited to 2% and 4% respectively.
Earth's tides simulation
Authors: Craig Brubaker
Venue: Journal of Computing Sciences in Colleges (2004)

This project is a simulation of Earth's tides to be used in introductory geology courses. The simulation models the orbits of the moon and the earth, calculates the resultant tidal forces, and graphically displays the tidal bulges that are produced. For user input the simulation accepts current positions in each of the seven following cycles: solar tide, solar tide subsolar latitude, earth orbit/eccentricity, lunar tide, lunar orbit/eccentricity, precession of the lunar orbital ellipse, and precession of the lunar orbital plane. Each cycle can be turned on or off to accommodate a reductionist learning approach. In addition, current cycle times are used for dynamic output when the simulation is in progress. The project also contains input for simulation play speed and preset input sets to streamline use of the simulation in the classroom. 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
Theory and practice of cross-traffic estimation
Authors: Sridhar Machiraju, Darryl Veitch, François Baccelli, Antonio Nucci, Jean C. Bolot
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Active probing heuristics are usually based on queuing systems. However, a rigorous probabilistic treatment of probing methods has been lacking. For instance, it is not known even in principle, what can and cannot be measured in general, nor the true limitations of existing methods. We provide a probabilistic treatment for the measurement of cross traffic in the 1-hop case. We derive inversion formulae for the cross traffic process, and explain their fundamental limits, using an intuitive geometric framework.
Complete binary trees in folded and enhanced cubes
Venue: Networks (2004)

It is well known that the complete binary tree Bn &lpar;n &ge; 3&rpar; on 2n - 1 vertices is not embeddable into the n-dimensional hypercube. In this article, we describe a recursive technique to embed Bn into the n-dimensional folded and enhanced cubes, if n satisfies certain necessary parity conditions. &copy; 2004 Wiley Periodicals, Inc.
A proposal for an evaluation set selection method for corpus-based speech translation
Authors: Fumiaki Sugaya, Keiji Yasuda, Seiichi Yamamoto
Venue: Systems and Computers in Japan (2005)

The use of large-scale corpora in speech translation technology has not only brought us closer to a plateau of high-level speech translation capability within limited domains but also has broadened the scope of corpus gathering and helped to validate wider domain applications as well. At the same time, the efficient evaluation of speech translation systems has become an important issue. In this article, the authors propose a method of selecting a valid evaluation set based on error reduction of the translation paired comparison and discuss their experimental findings. The experimental results show how this method can be used to select a much smaller evaluation set from a large one. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 1&ndash;11, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20133
Computational modeling and simulation of heart ventricular mechanics with tagged MRI
Authors: Zhenhua Hu, Dimitris Metaxas, Leon Axel
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Heart ventricular mechanics has been investigated intensively in the last four decades. The passive material properties, the ventricular geometry and muscular architecture, and the myocardial activation are among the most important determinants of cardiac mechanics. The heart muscle is anisotropic, inhomogeneous, and highly nonlinear. The heart ventricular geometry is irregular and object dependent. The muscular architecture includes the organization of the fiber and the connective tissues. Studies of the myocardial activation have been carried out at both cell and tissue levels.Previous work from our research group has successfully estimated the in-vivo motion and deformation of both the left and the right ventricles. In this paper, we present an iterative model to estimate the in-vivo myocardium material properties, the active forces generated along fiber orientation, and strain and stress distribution in both ventricles. Compared to the strain energy function approach, our model is more intuitively understandable. Using the model, we have simulated the mechanical events of a few different heart diseases. Noticeable strain and stress differences are found between normal and diseased hearts.
Ridge estimation of a semiparametric regression model
Authors: Hongchang Hu
Venue: Journal of Computational and Applied Mathematics (2005)

Considered the semiparametric regression model li = AiTX + s(ti) + Δi (i = 1, 2,...,n). Firstly, ridge estimators of both parameters and nonparameters are attained without a restrained design matrix. Secondly, the ridge estimator will be compared with two steps estimation under a mean square error and some conditions in which the former excels the latter are given. Finally, the validity and feasibility of the method are illustrated by a simulating example.
Automatic generation of layered queuing software performance models from commonly available traces
Authors: Tauseef A. Israr, Danny H. Lau, Greg Franks, Murray Woodside
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Performance models of software designs can give early warnings of problems such as resource saturation or excessive delays. However models are seldom used because of the considerable effort needed to construct them. Software Architecture and Model Extraction (SAME) is a lightweight model building technique that extracts communication patterns from executable designs or prototypes that use message passing, to develop a Layered Queuing Network model in an automated fashion. It is a formal, traceable model building process. The transformation follows a series of well-defined transformation steps, from input domain, (an executable software design or the implementation of software itself) to output domain, a Layered Queuing Network (LQN) Performance model. The SAME technique is appropriate for a message passing distributed system where tasks interact by point-to-point communication. With SAME, the performance analyst can focus on the principles of software performance analysis rather than model building.
TH-Collocation for the biharmonic equation
Authors: Martín Díaz, Ismael Herrera
Venue: Advances in Engineering Software (2005)

This paper is intended as a contribution to enhance orthogonal collocation methods. In this, a novel collocation method--TH-collocation--is applied to the biharmonic equation and the merits of such procedure are exhibited. TH-collocation relaxes the continuity requirements and, for the 2D problems here treated, leads to the development of algorithms for which the matrices are sparse (nine-diagonal), symmetric and positive definite. Due to these properties, the conjugate gradient method can be directly, and more effectively, applied to them. These features contrast with those of the standard orthogonal spline collocation on cubic Hermites, which yields matrices that are non-symmetric and non-positive. This paper is part of a line of research in which a general and unified theory of domain decomposition methods, proposed by Herrera, is being explored. Two kinds of contributions can be distinguished in this; some that are relevant for the parallel computation of continuous models and new discretization procedures for partial differential equations. The present paper belongs to this latter kind of contributions.
Cellular tic tac au-toe-mata
Authors: Mark Schiebel
Venue: Journal of Computing Sciences in Colleges (2004)

A cellular automaton consists of a lattice (consisting of cells), states, rules (which determine the next state of each cell), and a neighborhood (the surrounding cells that each cell uses in determining its next state). A standard cellular automaton advances at a discrete time interval, and changes every cell concurrently; however, we can consider cellular automata in which only a specific cell is chosen, and it, along with its neighborhood, is changed based upon the rules of the automaton. Thus, we can consider a game in which two players take turns attempting to cause the cellular automaton to achieve some specific configuration, although this configuration is possibly different for each player. My project will investigate such cellular automata, specifically ones with "tic-tac-toe" like winning formations (a win is created by achieving some number, say five, of one state in a row). 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
L(2, 1)-labeling of direct product of paths and cycles
Authors: Pranava K. Jha, Sandi Klavžar, Aleksander Vesel
Venue: Discrete Applied Mathematics (2005)

An L (2, 1)-labeling of a graph G is an assignment of labels from {0, 1,....., λ} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. The λ-number λ(G) of G is the minimum value λ such that G admits an L (2, 1)-labeling. Let G × H denote the direct product of G and H. We compute the λ-numbers for each of C7i × C7j, C11i × C11j × C11k, P4 × Cm, and P5 × Cm. We also show that for n ≥ 6 and m ≥ 7, λ(Pn × Cm) = 6 if and only if m = 7k, k ≥ 1. The results are partially obtained by a computer search.