ppxscal/embedding_network huggingface dataset:
Refactoring to aspects: an interactive approach
Authors: Jan Hannemann, Thomas Fritz, Gail C. Murphy
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Current refactorings for restructuring existing software systems preserve the behavior of the software. Aspect-oriented programming constructs make existing refactorings more complex, and introduce the potential for new kinds of refactorings that target entire concerns. In many cases, behaviour preservation may be neither possible nor desirable. In this position paper, we propose an approach to refactoring aspects into a system that actively involves a developer in a dialogue with the refactoring tool. We are exploring this approach by developing two Eclipse plug-ins: one which bases the refactoring on descriptions of a concern in the code; the other which bases the refactoring on a target aspect structure.
Case study: Reconnaissance techniques to support feature location using RECON2
Authors: Suhaimi Ibrahim, Norbik Bashah Idris, Aziz Deraman
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Change requests are often formulated into concepts orfeatures that a maintainer can understand. One of themain issues faced by a maintainer is to know and locate"where does this program implement feature X".However, these features are implicitly available in thecode and scattered elsewhere that make themundoubtedly difficult to manage. A technique calledsoftware reconnaissance was originally inspired byindustrial maintainers about the need for better ways oflocating software features in large systems. This paperpresents the authors' experience in using the softwarereconnaissance technique and tool called RECON2,developed by the university of West Florida. Ourobjective is to understand how the technique and toolwork and to further suggest some enhancements withrespect to software understanding strategies.
A Monolithic Spectral BIST Technique for Control or Test of Analog or Mixed-Signal Circuits
Authors: John M. Emmert, Jason A. Cheatham, Badhri Jagannathan, Sandeep Umarani
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Intelligent radio frequency (RF) front ends make use of MMIC and MEMS devices to provide a limited range of programmability to what have historically been fixed resistive, capacitive, and inductive impedance matching networks. Many BIST methods for mixed-signal systems can also be used to monitor and provide feedback for the control of such RF systems. For example, spectral techniques can be used to analyze and determine the center frequency of a bandpass filter. Information relative to the center frequency can then be fed back into the system, and adjustments can be made to fine tune the filter. In this paper we outline our spectral based, mixed-signal approach for monitoring the health of analog and RF components in mixed-signal systems on-chip. In our approach we use well known DSP techniques based on the FFT for on-chip signal generation and analysis. We reduce required hardware by using the same functional block to analyze analog output signals that we use to generate m tone stimulus signals. By providing on-chip functional test capability, we also reduce test time required in expensive ATE. Our techniques have been prototyped and demonstrated on a Xilinx Virtex-II FPGA using an off-chip ADC and DAC, and we are currently implementing the technique on an ASIC using a 0.13µm process with target execution speeds of 2-16GHz1.
A framework for distributed applications on systems with mobile hosts
Authors: Chakarat Skawratananond
Venue:  (2002)

Mobile hosts have fundamentally different limitations than stationary hosts. For example, mobile hosts generally operate on limited battery power and memory resources. Distributed programs executing on the system with mobile hosts therefore require various modifications to compensate for these factors. In this dissertation, we present a framework that facilitates developing distributed applications for systems with mobile hosts. Radio spectrum is a scarce resource in mobile systems, efficient allocation of frequency channels is therefore critical for the system performance. The first part of the dissertation addresses this problem. We present a distributed update-based algorithm that imposes lower message complexity, while requiring smaller storage overhead than existing algorithms. In the second part of the dissertation, we propose an efficient way to implement causal message ordering in mobile computing systems. Causally ordered message delivery is a required property for several distributed applications particularly those that involve human interactions (such as teleconferencing and collaborative work). Our message overhead in wired network is independent of the number of mobile hosts, therefore, the proposed algorithm is scalable and can easily handle dynamic change in the number of participating mobile hosts in the system. Our algorithm, when compared to previous proposals, offers a low unnecessary delay, low message overhead and optimized handoff cost. Determining order relationship between events in the computation is a fundamental problem in distributed systems with applications in distributed monitoring and fault-tolerance. Fidge and Mattern's vector clocks capture the order relation ship with vectors of size N in a system with N processes. Due to limited resources in mobile computing systems, it is natural to ask if this overhead can be reduced. The third part of the dissertation addresses this problem. We present efficient timestamping algorithms suitable for mobile computing systems.
Evolution of the Chilean Web Structure Composition
Authors: Ricardo Baeza-Yates, Barbara Poblete
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

In this paper we present the evolution of the structure of the Chilean Web between 2000 and 2002. Our results show that although the Web grows as expected, also a significant part of it disappears. In addition, some components are much more stable than others. We also compare the expected life cycle of a Web site in the structure with the actual real data.
Regularity properties for triple systems
Authors: Brendan Nagle, Vojtêch Rödl
Venue: Random Structures Algorithms (2003)

Szemerédi's Regularity Lemma proved to be a powerful tool in the area of extremal graph theory [J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory, Combinatorics 2 (1996), 295-352]. Many of its applications are based on the following technical fact: If G is a k-partite graph with V(G) = ∪ki=1 Vi, |Vi| = n for all i ∈ [k], and all pairs {Vi, Vj}, 1 ≤ i < j ≤ k, are ε-regular of density d, then G contains d??nk(1 + f(ε)) cliques K(2)k, where f(ε) → 0 as ε → 0. The aim of this paper is to establish the analogous statement for 3-uniform hypergraphs. Our result, to which we refer as The Counting Lemma, together with Theorem 3.5 of P. Frankl and V. Rödl [Extremal problems on set systems, Random Structures Algorithms 20(2) (2002), 131-164), a Regularity Lemma for Hypergraphs, can be applied in various situations as Szemerédi's Regularity Lemma is for graphs. Some of these applications are discussed in previous papers, as well as in upcoming papers, of the authors and others.
Semantic types: a fresh look at the ideal model for types
Authors: Jerome Vouillon, Paul-André Melliès
Venue: ACM SIGPLAN Notices (2004)

We present a generalization of the ideal model for recursive polymorphic types. Types are defined as sets of terms instead of sets of elements of a semantic domain. Our proof of the existence of types (computed by fixpoint of a typing operator) does not rely on metric properties, but on the fact that the identity is the limit of a sequence of projection terms. This establishes a connection with the work of Pitts on relational properties of domains. This also suggests that ideals are better understood as closed sets of terms defined by orthogonality with respect to a set of contexts.
Statistically Aware Buffer Planning
Authors: Giuseppe S. Garcea, Nick P. van der Meijs, Kees-Jan van der Kolk, Ralph H. J. M. Otten
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In this paper, we will develop an analytic approach to estimate the statistical properties (mean and variance) of the performance of a uniformly buffered global IC interconnect, based on the mean and (co)variance of the appropriate design and technology parameters. Compared to other approaches, such as Monte Carlo based approaches, our analytic approach would allow a much tighter design optimization loop and provide a better insight in the factors involved. The model that we use is generic, but in this paper we assume a set of synthetic (not based on actual process data) but realistically large values for the variability of the input parameters. Under these assumptions, it follows that solutions for the area/power/performance tradeoff that are optimal in a deterministic setting, might suffer from excessive variability, potentially leading to a yield problem.
A study of factors that may influence faculty in selected schools of education in the commonwealth of virginia to adopt computers in the classroom
Authors: Erika Julia Berner
Venue:  (2003)

There is an increasing awareness in the literature concerning the lack of K&ndash;12 teachers using computers in the classroom. (This is spite of the overwhelming need for students to be computer literate in order to function in future society.) In an effort to overcome this lack of computer use on the part of K&ndash;12 teachers, the Commonwealth of Virginia along with most other states have made K&ndash;12 teacher computer training one of the top priorities in education. However, an issue that does not seem to be addressed in the literature and the states' education policies is the fact that many university/college education faculty do not use computers in their classrooms. Thus giving newly graduated K&ndash;12 teachers few, if any, teaching with computers educational models. What factors (predictors) must be in place for those faculty members Schools of Education to be motivated to use computers in their classrooms is the focus of this study. Through literature review, and use of Ford's Motivational Systems Theory (MST) as the conceptual framework in this study, seven possible predictors were identified and researched. The research design used in this study was causal-comparative. The subjects were faculty members from five universities located in Virginia, who responded to a survey questionnaire. Sixty-three full-time faculty members with the ranks of instructor to full professor were included in this study. Seven research questions were asked and analyzed utilizing a stepwise multiple linear regression. The dependent variable in this study was computer use in the classroom, the MST predictor variables were: (1) perceived relevance; (2) desire to learn; (3) emotional reaction to technology; (4) beliefs about computer competence; (5) beliefs about technology. Two additional predictors though not included in the MST were administrative support and peer support. Additional demographic predictor variables, age, gender, and tenure were also tested against the dependent variable. The reported findings indicated that beliefs in computers (competence) were the strongest predictor, with beliefs of technology being the second. All predictors taken together showed strong predictive capabilities. Further research is recommended that will replicate this student to include a sample of faculty members from private universities, faculty from other disciplines, and faculty from larger universities.
On the use of the classification-tree method by beginning software testers
Authors: Y. T. Yu, Pak-Lok Poon, S. P. Ng, T. Y. Chen
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The classification-tree method is a black box testing method first introduced by Grochtmann and Grimm and recently enhanced by Chen et al. to become an integrated methodology. This paper describes a case study through which we attempt to understand the methods used by novice software testers to test their own programs, as well as their perception of the classification-tree method. The subjects of this study were advanced undergraduate students at a university with one year full-time working experience in the software industry. Our study found that white box testing methods were initially far more popular than black box methods, but the majority of them were convinced of the benefits of the classification-tree method after they have learned and used it.
Creative Approaches to Measuring Creativity: Comparing the Effectiveness of Four Divergence thinkLets
Authors: Eric L. Santanen, Gert-Jan de Vreede
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This paper presents a variety of ways in which the effectiveness of four divergence thinkLets used to aid creative solution generation in a group support system environment can be measured and compared. A thinkLet is a codified facilitation technique that can be used tosupport a group collaboration process. In the first thinkLet, free brainstorming, four-member groups worked on their own without any form of external interaction. In the three subsequent thinkLets, the group interaction was "directed" by a facilitator who provided carefully constructed stimuli to similar four-member groups at specific timed intervals. The only difference between the directed thinkLets was the specific ordering of the stimuli set. A number of useful measurements that may be made during the course of comparing the relative effectiveness of these creativity thinkLets are discussed and compared within the context of a theoretical model. The differences among the various thinkLets are then used to offer advicefor practitioners.
Beyond the Cybernetic Jam Fantasy: The Continuator
Authors: François Pachet
Venue: IEEE Computer Graphics and Applications (2004)

The Continuator is a usable musical instrument combining techniques from interactive and automatic learning systems. It learns and interactively plays with a user in the user's style.
Towards constructive text, diagram, and layout generation for information presentation
Authors: John Bateman, Jörg Kleinz, Thomas Kamps, Klaus Reichenberger
Venue: Computational Linguistics (2001)

Combining elements appropriately within a coherent page layout is a well-recognized and crucial aspect of sophisticated information presentation. The precise function and nature of layout has not, however, been sufficiently addressed within computational approaches; attention is often restricted to relatively local issues of typography and text-formatting, leaving broader issues of layout unaddressed. In this paper we focus on the selection and function of layout in pages that appropriately combine textual and graphical representation styles to yield coherent presentation designs. We demonstrate that layout offers a rich resource for achieving presentational coherence, alongside more traditional resources such as text-formatting and the text-internal marking of discourse connections. We also introduce an integrated approach to layout, text, and diagram generation. Our approach is developed on the basis of a preliminary empirical investigation of professionally produced layouts, followed by implementation within a prototype information system in the area of art history.
Statistical dynamics of on-line independent component analysis
Authors: Gleb Basalyga, Magnus Rattray
Venue: The Journal of Machine Learning Research (2003)

The learning dynamics of on-line independent component analysis is analysed in the limit of large data dimension. We study a simple Hebbian learning algorithm that can be used to separate out a small number of non-Gaussian components from a high-dimensional data set. The de-mixing matrix parameters are confined to a Stiefel manifold of tall, orthogonal matrices and we introduce a natural gradient variant of the algorithm which is appropriate to learning on this manifold. For large input dimension the parameter trajectory of both algorithms passes through a sequence of unstable fixed points, each described by a diffusion process in a polynomial potential. Choosing the learning rate too large increases the escape time from each of these fixed points, effectively trapping the learning in a sub-optimal state. In order to avoid these trapping states a very low learning rate must be chosen during the learning transient, resulting in learning time-scales of O(N2) or O(N3) iterations where N is the data dimension. Escape from each sub-optimal state results in a sequence of symmetry breaking events as the algorithm learns each source in turn. This is in marked contrast to the learning dynamics displayed by related on-line learning algorithms for multilayer neural networks and principal component analysis. Although the natural gradient variant of the algorithm has nice asymptotic convergence properties, it has an equivalent transient dynamics to the standard Hebbian algorithm.
Early identification and evaluation of slowly emerging problems related to the ubiquitous networked computing and communications environment in the state of hawaii
Authors: Jenifer Sunrise Winter
Venue:  (2003)

Ubiquitous Networked Computing (UNC) is an emerging environment encompassing future developments in the areas of Pervasive Computing. Mobile Computing, and Ubiquitous Computing (e.g., Weiser, 1991). This research sought to enhance policy decision making by identifying and assessing emerging problems related to UNC in Hawaii over a twenty-year time frame. This study also investigated differences in problem assessment between information technology specialists and non-specialists. A six-phase methodological process employing scenario planning, electronic focus groups, and problem assessment surveys was developed to investigate perceptions about emerging problems. Specialists and non-specialists generated eighty unique problem statements and additional members from each group assessed the relative importance of these statements. Specialists further assessed a subset of 24 statements according to four problem criteria adapted from previous research by the Center for the Study of Social Policy (1977). Non-specialists participating in the electronic focus groups expressed distinct and different concerns from the specialists. Further, both groups found the statements generated by non-specialists to be valuable contributions, arguing for their inclusion in the process of problem identification. By the Mann-Whitney U test (p < .05), significant differences in assessment between groups were identified in 41 of 80 problem statements. Analysis of between-group differences suggests that specialists share a frame of reference focused on addressing near-term obstacles to the growth of high-technology industries within Hawaii. Non-specialists expressed greater concern for longer-term human-centered issues, particularly those related to control of the process of technological development. This research contributes a framework that extends current knowledge of potential emerging problems related to UNC. The methodological process can be applied in other content areas or regions. Ranked lists of problem criticality assessments by each group and by individual problem criteria were created. Analysis yielded three policy indices intended to assist decision-makers direct limited resources toward problems that may yield the most substantial long-term return-on-investment. Further, this research contributes to an understanding of the opinions of diverse stakeholders and how identifying differences between them may be an effective means of recognizing emerging problems. Examination of these differences can initiate future-oriented social negotiation involving multiple perspectives, leading to a more human-centered implementation of technology.
Automating the Analysis of Voting Systems
Authors: Sherif Yacoub, Xiaofan Lin, Steve Simske, John Burns
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Voting is a well-known technique to combine thedecisions of peer experts. It is used in fault tolerantapplications to mask errors from one or more expertsusing N-Modular Redundancy (NMR) and N-versionProgramming. Voting strategies include: majority,weighted voting, plurality, instance runoff voting,threshold voting, and the more general weighted k-out-of-nsystems. Before selecting a voting schema for aparticular application, we have to understand the varioustradeoffs and parameters and how they impact thecorrectness, reliability, and confidence in the finaldecision made by a voting system.In this paper, we propose an enumerated simulationapproach to automate the behavior analysis of votingschemas with application to majority and plurality voting.We conduct synthetic studies using a simulator that wedevelop to analyze results from each expert, apply avoting mechanism, and analyze the voting results. Thesimulator builds a decision tree and uses a depth-firsttraversal algorithm to obtain the system reliability amongother factors. We define and study the followingbehaviors: 1) the probability of reaching a consensus,"Pc"; 2) reliability of the voting system, "R"; 3)certainly index, "T"; and 4) the confidence index, "C".The parameters controlling the analysis are the numberof participating experts, the number of possible outputsymbols that can be produced by an expert, theprobability distribution of each expert's output, and thevoting schema. The paper presents an enumeratedsimulation approach for analyzing voting systems whichcan be used when the use of theoretical models arechallenged by dependencies between experts oruncommon probability distributions of the expert'soutput.
Shrubbery: A New Algorithm for Quickly Growing High-Quality Steiner Trees
Authors: G. Gréwal, T. Wilson, M. Xu, D. Banerji
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

As we move to deep sub-micron designs below 0.18microns, the delay, area, and power dissipation of a circuitis dominated by the interconnections (routes) between thetransistors. The interconnection pattern for each set ofpins that must be connected (net) is a Steiner tree, and theprimary sub-problem in (global) routing is to find aminimal Steiner tree. In this paper, we present a newalgorithm, called "shrubbery," for solving the Steiner treeproblem. We evaluate the performance of shrubbery byrunning simulations with a large number of benchmarksfrom SteinLib [1] and comparing our results to thoseobtained with the very popular Shortest Path Heuristic(SPH) developed by Takahashi and Matsuyama [2]. Ourresults show that shrubbery is able to consistently findoptimal or near optimal solutions, but in less time thanSPH.
ServiceCom: A Tool for Service Composition Reuse and Specialization
Authors: Bart Orriëns, Jian Yang, Mike P. Papazoglou
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Web services are becoming the dominant paradigm for distributed computing and electronic business. This has raised the opportunity for service providers and application developers to create value added services by combining web services. Several web service compositionsolutions have been proposed, e.g. BPEL4WS. However, these approaches are either not flexible or too complicated as they lack proper support for modularity and reusability. Motivated by the demand of a light-weighted tool of service composition, we developed ServiceCom, a tool for service composition specification, construction and execution. In this paper we discuss how ServiceCom suppors reusable web service composition specification, combination, and execution.