ppxscal/embedding_network huggingface dataset:
Evaluation modeling in performance and resource allocation for residential broadband gateways
Authors: Barry Luong
Venue:  (2003)

The growth of the broadband network technology, i.e., digital cables and subscriber lines has made it possible to merge voice, data, audio, and video services into a single pipe from which the broadband gateway can redistribute these services to individual devices such as televisions, telephones, facsimiles, audio systems, and Internet applications connected to residential networks. The study of performance qualities of the broadband gateway is vital for the successful design of the broadband gateway, since it has to distribute a variety of data that can be either sensitive to reliability or susceptible to delay and jitter. Moreover, random traffic characteristics of each continuous media service complicate the analysis of the system and raise the cost of building the system. A high performance system that is too expensive to build would not be desirable. Because of these issues, it is natural to model the performance (performance modeling) of the broadband gateway and the engineering management resources (resource allocation modeling) of the development by applying mathematics. Besides integrating technologies into the broadband gateway to guarantee quality of service (QoS), the performance study undertaken herein, will introduce the queueing, regression and Markov models. These models are investigated to model traffic generated from multimedia services and to estimate the amount of system resources such as memory, bandwidth and processing power cycles needed for the broadband gateway. Outputs derived from models are used to evaluate the performance of the gateway design, to measure the burst in transmitting data and to predict QoS that the broadband gateway can provide. For resource allocation modeling, queueing theory, Markov processes, and linear regression are applied to model software management and maintenance during the development and testing phases of a software system. The model helps verify the progress of the testing phase and estimate its cost. Based on results derived from this model, a decision can be made about changes in the workforce early rather than letting the product miss the scheduled deadlines. Moreover, the model helps developers and managers measure such data as product reliability, quality of service, and accurately estimate the number of developers needed for product maintenance.
The reality helmet: a wearable interactive experience
Authors: Daniel Fallman, Kalle Jalkanen, Henrik Lörstad, John Waterworth, Jonas Westling
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The Reality Helmet is an interactive experience, in which the user's vision and hearing is shielded off from the world. Video and sound is nevertheless recorded by the Reality Helmet, but through computer processing it presents sound to the user as vision, and likewise, vision is turned into a soundscape. The result is a form of artificial synesthesia. Other than as an appreciated art installation, which seems to make people calm and reflective, the Reality Helmet is used to explore relationships between the wearer's sense of presence and the kind of realism provided by the interactive environment.
Software Analysis Process - which order of activities, is preferred? An Experimental Comparison Using FOOM Methodology
Authors: Judith Kabeli, Peretz Shoval
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

Data modeling and functional modeling are two mainactivities of the analysis process. Traditionaldevelopment methodologies usually emphasizefunctional modeling via dataflow diagrams (DFDs),while object-oriented (OO) methodologies emphasizedata modeling via class diagrams. UML includesvarious techniques for both data (structure) andfunctional (behavior) modeling which can be utilizedin various ways. In fact, different methodologiesutilize data modeling and process modelingtechniques in different ways and orders.This study is concerned with the ordering ofmodeling activities in the analysis stage. Our mainquestion is if it is better to create first a functionalmodel and then a data model, or vice versa? Weconduct a comparative experiment in which the twoopposing orders are examined. We use the FOOMmethodology as a platform for the experiment as itenables the production of both a functional model(hierarchical OO-DFDs) and a data model (an initialclass diagram), which are synchronized. The resultsof the experiment reveal that an analysis process thatbegins with data modeling provides better productsthan one that begins with functional modeling.
Exploiting Symmetries to Test Programs
Authors: Arnaud Gotlieb
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Symmetries often appear as properties of many artificalsettings. In Program Testing, they can be viewed as propertiesof programs and can be given by the tester to checkthe correctness of the computed outcome. In this paper, weconsider symmetries to be permutation relations betweenprogram executions and use them to automate the testingprocess. We introduce a software testing paradigm calledSymmetric Testing, where automatic test data generation iscoupled with symmetries checking to uncover faults insidethe programs. A practical procedure for checking that aprogram satisfies a given symmetry relation is described.The paradigm makes use of Group theoretic results as aformal basis to minimize the number of outcome comparisonsrequired by the method. This approach appears tobe of particular interest for programs for which neither anoracle, nor any formal specification is available. We implementedSymmetric Testing by using the primitive operationsof the Java unit testing tool Roast [9]. The experimental resultswe got on faulty versions of classical programs of theSoftware Testing community tend to show the effectivenessof the approach.
Wordsieve: context analysis for personal informational retrieval
Authors: Travis Ladell Bauer
Venue:  (2003)

A fundamental problem in supporting users during information access is to identify their various task contexts to provide customized information. This can be seen as the task of identifying context-differentiating features in a stream of information. This dissertation is an exploration of the possibility of developing an unsupervised, competition-based feature extraction algorithm which does not require complex sets of rules or perform complex statistical analysis. The thesis of this dissertation is that term extraction for personal information agents can be done by learning terms which have a large variance in their occurrence frequencies over time, that this can be at least as effective as standard information retrieval techniques, and that this information can be learned without comprehensive corpus analysis, making it suitable for use in personal information retrieval. This dissertation will define the problem of context analysis more broadly to suggest applicability in other domains. An unsupervised term extraction algorithm, WordSieve, is presented. WordSieve learns to differentiate task contexts of users engaged in information access and represents the context in a manner suitable for indexing and retrieval. Two implementations of WordSieve are discussed and their performance assessed, comparing them to three common indexing techniques for a controlled personal information retrieval task. The experiments demonstrate the ability of WordSieve to generate task-relevant indices of comparable or better quality using only local information.
Modeling the emergence of bilingual acoustic clusters: a preliminary case study
Authors: Mark Laws, Richard Kilgour, Nikola Kasabov
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

This paper presents some preliminary results of an original study to model the emergence of bilingual acoustic clusters of both New Zealand English and New Zealand Maori speech. This is performed using true on-line learning in a connectionist architecture. The study represents a joint collaborative analysis, which applies the bilingual data as training examples to a connectionist-based evolving clustering method algorithm. The algorithm returns a structure containing acoustic clusters plotted using visualization techniques that could be used as the foundations for future speech classification systems. The following experiments are based on the notion that approximately 75% of the phonological units in New Zealand English and New Zealand Maori occupy similar acoustic space, they sound the same, and therefore they can be used to classify new unknown speech units or words.
Innovator or Owner? Information Sharing, Incomplete Contracts and Governance in Financial Risk Management Systems
Authors: Kunsoo Han, Robert J. Kauffman, Barrie R. Nault
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Financial risk management has become increasingly important in the financial industry during the last decade, especially due to the financial disasters in the mid-1990s. Value-at-risk (VAR), developed by J. P. Morgan in the late 1980s, has been the most widely accepted risk measurement methodology because it provides a single number summary of an institution's portfolio risk. To promote VAR, Morgan provided RiskMetrics, a VAR-based risk management service, for its clients (borrowers). Later, RiskMetrics was spun off as an independent company providing fee-based services. Building upon the theory of incomplete contracts and other related theories, we develop a game theoretic model to explain why adoption of the free RiskMetrics service stalled and how the change in ownership structure of the service led to wider adoption. In particular, we examine a situation where the borrowers have heterogeneous portfolio riskiness and this differential riskiness affects the value they can gain from the service and the impact of the service provider exploiting their private risk information.Our results suggest that the most important roadblock to borrowers' adoption of the free service might have been the potential damage from the service provider's information exploitation. When the service was spun off, borrowers' concern was reduced due to the multi-party independent ownership structure, which led to wider adoption. The spin-off was Morgan's strategic move to maximize long-term profits from RiskMetrics.
Optimized Neighbour Prefetch and Cache for Client-server Based Walkthrough
Authors: Zhi Zheng, Tony K. Y. Chan
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

We present a position-based neighbour prefetch algorithmfor client-server based walkthrough. This algorithmpredicts which neighbouring viewcell will be needed inthe near future according to the current view position ofthe client and prefetches the pre-computed potential visibleset (PVS) for that viewcell to the client-side cache. Ouralgorithm has a low memory requirement for the client-sidecache. With the same cache size, our algorithm offersa much better performance than the simple neighbourprefetch method. We also provide a delta-transmission algorithmto optimize the prefetch transmission procedure byavoiding transmitting those geometries that are already inthe client-side cache. A cache management and entry replacementstrategy is also proposed to maintain the client-sidecache.
Guiding component form design using decision consequence knowledge support
Authors: Jonathan C. Borg, Xiu-Tian Yan, Neal P. Juster
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

This paper describes a generic approach to guiding designers when making decisions during the early stages of design. The objective of the research is to enable designers to foresee unintended life-cycle consequences during mechanical component design. Engineering design is a process of evolving solutions to a design problem through the commitment of decisions. As a designer commits a new design decision, a more concrete design solution is generated. Decisions made can have intended and unintended consequences on the performance of the life phase activities that follow, such as manufacturing, assembly, and disposal. Many existing tools only consider the impact of the design solution on later life-cycle phases when the solution is almost complete. This makes changes expensive and difficult. This paper presents a novel approach to how consequences encountered in down stream life-cycle phases can be brought to the designer's attention early in generation of component form. For this purpose, a knowledge model has been derived from a phenomena model. The phenomena model describes how life-cycle consequences are generated during component synthesis. An insight into the representation of the resultant knowledge model is discussed through examples. The implementation of a prototype Knowledge Intensive CAD tool, entitled FORESEE, aimed at supporting life-oriented, feature-based component synthesis and exploration, is also described. The results of the evaluation of FORESEE with a range of designers show that by using the system designers are motivated to explore alternative design solutions and are able to make more informed design decisions. This highlights that the knowledge structure provides a base for extending feature-based component design to a &lsquo;Design Synthesis for Multi-X&rsquo; approach.
Improving the Quality of the Personalized Electronic Program Guide
Authors: Derry O'Sullivan, Barry Smyth, David C. Wilson, Kieran Mcdonald, Alan Smeaton
Venue: User Modeling and User-Adapted Interaction (2004)

As Digital TV subscribers are offered more and more channels, it is becoming increasingly difficult for them to locate the right programme information at the right time. The personalized Electronic Programme Guide (pEPG) is one solution to this problem; it leverages artificial intelligence and user profiling techniques to learn about the viewing preferences of individual users in order to compile personalized viewing guides that fit their individual preferences. Very often the limited availability of profiling information is a key limiting factor in such personalized recommender systems. For example, it is well known that collaborative filtering approaches suffer significantly from the sparsity problem, which exists because the expected item-overlap between profiles is usually very low. In this article we address the sparsity problem in the Digital TV domain. We propose the use of data mining techniques as a way of supplementing meagre ratings-based profile knowledge with additional item-similarity knowledge that can be automatically discovered by mining user profiles. We argue that this new similarity knowledge can significantly enhance the performance of a recommender system in even the sparsest of profile spaces. Moreover, we provide an extensive evaluation of our approach using two large-scale, state-of-the-art online systems--PTVPlus, a personalized TV listings portal and Físchlár, an online digital video library system.
A First Look at ASP.NET v 2.0
Authors: Alex Homer, Dave Sussman, Rob Howard
Venue:  (2003)

Alex Homer is managing director of Stonebroom, Ltd., a software-development, consulting, and training organization. He was formerly lead technical author and reviewer for Wrox Press, specializing in Microsoft Web and database technologiesDave Sussman speaks frequently at Microsoft development conferences and has been writing about ASP since its earliest releases.Rob Howard founded Telligent Systems, a solutions company specializing in Microsoft enterprise technologies. As Program Manager at Microsoft, he helped design ASP.NET's Web services support, caching, session state, and other features. His books include A First Look at ASP.NET v. 2.0 (Addison-Wesley, 2003) and ASP.NET Developer's Cookbook (Sams, 2003).
On the use of the cyclomatic number to measure program complexity
Authors: James L. Elshoff, Michael Marcotty
Venue: ACM SIGPLAN Notices (1978)

The October 1977 issue of SIGPLAN Notices carries an article that compares functionally equivalent programs that differ in their internal structure. The basis for comparing the programs is a measure called cyclomatic complexity whose value is the cyclomatic number of the graph that corresponds to the flow of control of the program. One program is of particular interest since all of the well-structured versions of the program that are discussed have a higher cyclomatic complexity than the unstructured version. In this paper another well-structured version of the program is presented for which the cyclomatic complexity is reduced to that of the original unstructured version. In the process, some of the shortcomings of the cyclomatic number as a complexity measure are revealed.
Time-frequency signal analysis based on the windowed fractional Fourier transform
Authors: Ljubiša Stankovic´, Tatiana Alieva, Martin J. Bastiaans
Venue: Signal Processing (2003)

A new signal-adaptive joint time-frequency distribution for the analysis of nonstationary signals is proposed. It is based on a fractional-Fourier-domain realization of the weighted Wigner distribution producing auto-terms close to the ones in the Wigner distribution itself, but with reduced cross-terms. Improvement over the standard time-frequency representations is achieved when the principal axes of a signal (defined as mutually orthogonal directions in the time-frequency plane for which the width of the signal's fractional power spectrum is minimum or maximum) do not correspond to time and frequency. The computational cost of this fractional-domain realization is the same as the computational cost of the realizations in the time or the frequency domain, since the windowed Fourier transform of the fractional Fourier transform of a signal corresponds to the short-time Fourier transform of the signal itself, with the window being the fractional Fourier transform of the initial one. The appropriate fractional domain is found from the knowledge of three second-order fractional Fourier transform moments. Numerical simulations confirm a qualitative advantage in the time-frequency representation, when the calculation is done in the optimal fractional domain. The approach can be generalized to the time-frequency distributions from the Cohen class.
A framework for extending potency and reducing competitive risk in the IT strategic systems portfolio
Authors: James D. White, Theresa A. Steinbach, Linda V. Knight, Alan T. Burns
Venue: Business strategies for information technology management (2003)

This research proposes that, in addition to balancing risk in the total IT project portfolio as McFarlan suggested in 1981, organizations should also balance risk in their strategic IT portfolios. A framework is distilled from the literature that will both minimize the total risk of an organization's strategic project portfolio, and identify opportunities to extend the strategic life of its information systems. The framework's validity is assessed by using four classic cases in the strategic use of technology. Results indicate that overall strategic IT risk may be reduced by evaluating an organization's strategic IT portfolio against the five dimensions of the framework, and then seeking strategic IT projects and opportunities that would bring greater balance to the organization's efforts. In addition, by moving across boundaries in each of the five dimensions, strategic systems can adapt to competitive marketplace or technology changes, and thus maintain their strategic potency over extended time periods.
Automatic verification of functions with accumulating parameters
Authors: Andrew Ireland, Alan Bundy
Venue: Journal of Functional Programming (1999)

Proof by mathematical induction plays a crucial role in reasoning about functional programs. A generalization step often holds the key to discovering an inductive proof. We present a generalization technique which is particularly applicable when reasoning about functional programs involving accumulating parameters. We provide empirical evidence for the success of our technique and show how it is contributing to the ongoing development of a parallelizing compiler for Standard ML.
Contrast-based image attention analysis by using fuzzy growing
Authors: Yu-Fei Ma, Hong-Jiang Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Visual attention analysis provides an alternative methodology to semantic image understanding in many applications such as adaptive content delivery and region-based image retrieval. In this paper, we propose a feasible and fast approach to attention area detection in images based on contrast analysis. The main contributions are threefold: 1) a new saliency map generation method based on local contrast analysis is proposed; 2) by simulating human perception, a fuzzy growing method is used to extract attended areas or objects from the saliency map; and 3) a practicable framework for image attention analysis is presented, which provides three-level attention analysis, i.e., attended view, attended areas and attended points. This framework facilitates visual analysis tools or vision systems to automatically extract attentions from images in a manner like human perception. User study results indicate that the proposed approach is effective and practicable.
An infrastructure for context-awareness based on first order logic
Authors: Anand Ranganathan, Roy H. Campbell
Venue: Personal and Ubiquitous Computing (2003)

Context simplifies and enriches human-human interaction. However, enhancing human-computer interaction through the use of context remains a difficult task. Applications in pervasive and mobile environments need to be context-aware so that they can adapt themselves to rapidly changing situations. One of the problems is that there is no common, reusable model for context used by these environments. In this paper, we propose a model of context that is based on first order predicate calculus. The first order model allows complex rules involving contexts to be written. It also enables automated inductive and deductive reasoning to be done on contextual information. The first order model allows an expressive description of context using Boolean operators and existential and universal quantifiers. Based on this model, an infrastructure to enable context-awareness in ubiquitous computing environments has been developed. The infrastructure allows the easy development and deployment of various sensors and context-aware applications. It also allows distributed reasoning to take place. This context infrastructure is part of our smart spaces framework for ubiquitous computing, Gaia.
JRefleX: towards supporting small student software teams
Authors: Kenny Wong, Warren Blanchet, Ying Liu, Curtis Schofield, Eleni Stroulia, Zhenchang Xing
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

The success of a software development project depends on the technical competency of the development team, the quality of the tools they use, and the project-management decisions they make during the software lifecycle. Instructors of software-engineering courses that involve small project teams are often overwhelmed with the task of monitoring the progress of multiple teams. Without adequate monitoring and advice on best practices, problems in the team's process or the developed product may go unnoticed until it is too late to be easily fixed. This paper introduces the JRefleX environment, with components built upon Eclipse, to support the education of small software teams.
Algorithm to extract two-node bridges
Authors: Sujit Thomas Zachariah, Sreejit Chakravarty
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Current bridge fault extraction techniques are limited by performance and capacity constraints. In this paper, we present a fast and accurate algorithm to extract and rank two-node bridges based on the computation of their weighted critical area. Experimental results showing the algorithm's performance are presented.