ppxscal/embedding_network huggingface dataset:
Multi-Channel Subspace Mapping Using an Information Maximization Criterion
Authors: Ahmed Al-Ani, Mohamed Deriche
Venue: Multidimensional Systems and Signal Processing (2004)

A new hybrid information maximization (HIM) algorithm is derived. This algorithm is able to perform subspace mapping of multi-channel signals, where the input (feature) vector for each of the channels is linearly transformed to an output vector. The algorithm is based on maximizing the mutual information (MI) between input and output sets for each of the channels, and between output sets across channels. Such formulation leads to a substantial redundancy reduction in the output sets, and the extraction of higher order features that exhibit coherence across time and/or space. In this paper, we develop the proposed algorithm and show that it combines efficiently the strengths of two well-known subspace mapping techniques, namely the principal component analysis (PCA) and the canonical correlation analysis (CCA). Unlike CCA, which is limited to two channels, the HIM algorithm can easily be extended to multiple channels. A number of simulations and real experiments are conducted to compare the performance of HIM to that of PCA and CCA.
Methodological Aspects in Designing Web-Based Collaborative Systems
Authors: José A. Aravena Reyes, Mauricio L. Aguilar Molina
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This work presents methodological aspects related with the development of web-based collaboration systems in Design and Education. Collaboration is highlighted as the fundamental aspect in the development of this kind of systems; it consists in a constructive and social process that is modeled in terms of protocols, which capture key acts of conversations involved in team working.
CoMine: Efficient Mining of Correlated Patterns
Authors: Young-Koo Lee, Won-Young Kim, Y. Dora Cai, Jiawei Han
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Association rule mining often generates a huge numberof rules, but a majority of them either are redundantor don not reflect the tue correlation relationship amongdata objects.In this paper, we re-examine this problemand show that two interesting measures, all_confidence(denoted as \alpha) and coherence (denoted as \gamma), both disclosegenuine correlation relationships and can be computedefficiently.Moreover, we propose two interestingalgorithms, CoMine(\alpha) and CoMine(\gamma), based onextensions of a pattern-growth methodology.Our performancestudy shows that the CoMine algorithms havehigh performance in comparison with their Apriori-basedcounterpart algorithms.
Mirror Adaptive Random Testing
Authors: T. Y. Chen, F. C. Kuo, R. G. Merkel, S. P. Ng
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Adaptive random testing (ART) has recently beenintroduced to improve the fault-detection effectivenessof random testing (RT) for certain types of failure-causingpatterns. However, ART requires extracomputations to ensure an even spread of test cases,which may render ART to be less cost-effective than RT.In this paper, we introduce an innovative approach,namely Mirror Adaptive Random Testing (MART), toreduce these computations. Our simulation resultsclearly show that MART does improve the cost-effectivenessof ART.
A CS1 course designed to address interests of women
Authors: Lauren Rich, Heather Perry, Mark Guzdial
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Literature on women in computing points out that computer science is not being effective at attracting and retaining women. Introduction to Media Computation is a new CS1 aimed especially at non-majors which was designed explicitly to address the concerns of women in computer science, such as the lack of relevance and creativity. The course is contextualized around the theme of manipulating and creating media. Of the 121 students who took the course (2/3 female), only three students dropped (all male), and 89% completed the course with a grade C or better. This paper presents data from interviews with women in the Media Computation class, then contrasts with interviews in a more traditional CS1.
Seven design rules for teaching students sound encapsulation and abstraction of object properties and member data
Authors: Michael R. Wick, Daniel E. Stevenson, Andrew T. Phillips
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Because encapsulation is a difficult concept for students to implement correctly, we propose a set of seven software design rules to be used as an aid for teaching the appropriate design and use of encapsulation of object properties.
Executive information systems use in organisational contexts: an explanatory user behaviour testing
Authors: George Ditsa
Venue: Information management: support systems & multimedia technology (2003)

Executive Information Systems (EIS) are designed to enhance the managerial roles of executives, including other senior managers, in organizations. Despite reported growth in the popularity of EIS, there are reports of low usage of these systems that, in part, contributes to their failures in organizations. The majority of prior EIS research has focused on documenting the features, benefits, development methodologies, and implementation of the systems. However, very few research studies address the problem of low EIS usage from behavioural point of the user. This chapter reports on a research on the use of EIS in organizational settings. The primary focus of the research is to investigate factors that explain users' behaviour towards using EIS. It is also aimed at identifying the relative importance of those factors that determine the use of EIS. The research model is based on Triandis' theoretical framework, a model from organizational behaviour. The research model is used to hypothesis that EIS use (behaviour) is determined by EIS experience and ability to use EIS (habits); subjective norms, roles, values and social situations (social factors); perceived usefulness of EIS (consequences); user satisfaction with EIS information, system, support, and plan (affect); and EIS development processes, management processes and organisational environment (facilitating conditions). Field data obtained by survey questionnaire from CEOs, CFOs and one other executive from 255 organisations using EIS in Australia were used to test and confirm the appropriateness of the behavioural model through correlation and regression analyses. The results of the study have some implications for research and practice.
Dynamic Context-aware Access Control for Grid Applications
Authors: Guangsen Zhang, Manish Parashar
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

The emerging Grid infrastructure presents many challengesdue to its inherent heterogeneity, multi-domain characteristic,and highly dynamic nature. One critical challengeis providing authentication, authorization and accesscontrol guarantees. In this paper, we present the SESAMEdynamic context-aware access control mechanism for pervasiveGrid applications. SESAME complements currentauthorization mechanisms to dynamically grant and adaptpermissions to users based on their current context. The underlingdynamic role based access control (DRBAC) modelextends the classic role based access control (RBAC). Wealso present a prototype implementation of SESAME andDRBAC with the Discover computational collaboratory andan experimental evaluation of its overheads.
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
Authors: Steven Noel, Sushil Jajodia, Brian O'Berry, Michael Jacobs
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

In-depth analysis of network security vulnerabilitymust consider attacker exploits not just in isolation, butalso in combination. The general approach to thisproblem is to compute attack paths (combinations ofexploits), from which one can decide whether a given setof network hardening measures guarantees the safety ofgiven critical resources. We go beyond attack paths tocompute actual sets of hardening measures (assignmentsof initial network conditions) that guarantee the safety ofgiven critical resources. Moreover, for given costsassociated with individual hardening measures, wecompute assignments that minimize overall cost. Bydoing our minimization at the level of initial conditionsrather than exploits, we resolve hardening irrelevanciesand redundancies in a way that cannot be done throughpreviously proposed exploit-level approaches. Also, weuse an efficient exploit-dependency representation basedon monotonic logic that has polynomial complexity, asopposed to many previous attack graph representationshaving exponential complexity.
Two Models in Optimization and Control
Authors: A. I. Propoi
Venue: Automation and Remote Control (2004)

The phase space of a controllable system was considered as the space of indices partially ordered by the domination cone. It was shown in what way the cone varies with increasing number of indices or interacting systems. Approaches to constructing on the domination cone of a metric enabling numerical evaluation of the cone elements were analyzed.
An interval component for continuous constraints
Authors: Laurent Granvilliers
Venue: Journal of Computational and Applied Mathematics (2004)

Local consistency techniques for numerical constraints over interval domains combine interval arithmetic, constraint inversion and bisection to reduce variable domains. In this paper, we study the problem of integrating any specific interval arithmetic library in constraint solvers. For this purpose, we design an interface between consistency algorithms and arithmetic. The interface has a two-level architecture: functional interval arithmetic at low-level, which is only a specification to be implemented by specific libraries, and a set of operations required by solvers, such as relational interval arithmetic or bisection primitives. This work leads to the implementation of an interval component by means of C++ generic programming methods. The overhead resulting from generic programming is discussed.
SPI: an open interface integrating highly interactive electronic CAD tools
Authors: J. P. Schupp, J. Cockx, L. Claesen, H. De Man
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the SPI Interface as an interface unifying the integration of electronic CAD tools. The goal of the interface is to provide a direct communication and interactive feedback between the primary design tools (schematics editors, symbolic layout editors, module generators etc.) and intelligent verification tools (electrical debugging, timing verification, simulation etc.).The SPI Interface is not a framework but complementary to existing frameworks. It is the specification of a Structure Procedural Interface together with some utilities to standardise the communication among CAD Tools and to support their integration.SPI offers a novel interface that supports, in an easy and efficient way, the integration of in-house as well as foreign CAD Tools. SPI will be made available and promoted in the European Electronic CAD Community.
Proactive congestion control for high speed networks
Authors: Tamer Dağ, Ioannis Stavrakakis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The next generation high speed networks which are characterized by large bandwidth propagation delay products are expected to support applications with diverse traffic characteristics and Quality of Service (QoS) requirements. Since statistical multiplexing is employed in these networks, congestion control and avoidance mechanisms are required for the delivery of QoS required by various applications.A number of reactive flow control schemes have been developed in the past for best effort applications. It has been well established that these schemes are not effective for networks with large bandwidth propagation delay products as the feedback information generated in the network can be outdated by the time it reaches the sources. In this paper, this problem (referred to as the bandwidth mismatch problem) is investigated and a proactive feedback (PF) based flow control scheme which attempts to eliminate the bandwidth mismatch problem by generating and transmitting early feedback messages is introduced. With cooperation among the network nodes and sources, the PF based flow control scheme can significantly increase the QoS delivered to the best effort applications. In addition to the increased level of delivered QoS, fair rate allocations to the best effort applications are also possible since the efficiency of the scheme becomes independent of the length of the propagation delays, once the bandwidth mismatch is eliminated.
A Bayesian Belief Network for Assessing the Likelihood of Fault Content
Authors: Sousuke Amasaki, Yasunari Takagi, Osamu Mizuno, Tohru Kikuno
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

To predict software quality, we must consider variousfactors because software development consists of variousactivities, which the software reliability growth model(SRGM) does not consider.In this paper, we propose a model to predict the finalquality of a software product by using the Bayesian beliefnetwork (BBN) model. By using the BBN, we can constructa prediction model that focuses on the structure of the softwaredevelopment process explicitly representing complexrelationships between metrics, and handling uncertain metrics,such as residual faults in the software products. Inorder to evaluate the constructed model, we perform anempirical experiment based on the metrics data collectedfrom development projects in a certain company. As a resultof the empirical evaluation, we confirm that the proposedmodel can predict the amount of residual faults thatthe SRGM cannot handle.
Discovering Clusters in Gene Expression Data Using Evolutionary Approach
Authors: Patrick C. H. Ma, Keith C. C. Chan
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The combined interpretation of gene expression data and gene sequences offers a valuable approach to investigate the intricate relationships involving gene transcriptional regulation. The highly interactive expression data produced by microarray hybridization experiments allow us to find the clusters of coexpressed genes. By analyzing the upstream regions of the identified coexpressed genes, we can discover the regulatory patterns characterized by transcription factor binding sites, which govern the process of transcriptional regulation. This paper presents a generic clustering algorithm that uses a Hybrid GA approach to discoverclusters in gene expression data. The advantage of this method is that large search space can be effectively explored by utilizing the evolutionary algorithm techniques. Moreover, it is able to discover underlying patterns in noisy gene expression data for meaningful data groupings, and also statistically significant patterns hidden in each cluster can be extracted at the same time. Since the proposed method can handle both continuous-and discrete-valued data, it can be used with different microarray and biomedical data. To test its effectiveness, we have used it on real expression data. The experimental results reveal meaningful groupings and uncover many known transcription factor binding sites.
Using on-line surveys to measure three key constructs of the quality of human-computer interaction in web sites: psychometric properties and implications
Authors: Paul van Schaik, Jonathan Ling
Venue: International Journal of Human-Computer Studies (2003)

On-line surveys are now an important tool for data collection on the World Wide Web (the Web). Determining the psychometric properties of key constructs such as disorientation, ease of use and flow is of paramount importance in establishing the quality of users' interactions with web sites. The current study used techniques of experimental research and on-line surveys to investigate the psychometric properties of existing instruments for measuring these constructs using two response formats: visual analogue scale and Likert scale. A 2 × 2 design with response format and orientation support as independent variables was used. Ninety participants carried out an information retrieval task using an experimental on-line shopping site before completing the scales. Factor analysis confirmed the existence of three distinct scales that possessed high reliability. Evidence for validity, and to a lesser extent, sensitivity, was found. Although psychometric results generally converged, some differences between the two response formats were found. A framework for the comprehensive investigation of response formats of on-line questionnaires is proposed as a basis for future research. Practical implications for the on-line measurement of the quality of users' interactions with web-based systems are discussed.
A 5(3) pair of explicit ARKN methods for the numerical integration of perturbed oscillators
Authors: J. M. Franco
Venue: Journal of Computational and Applied Mathematics (2003)

A new embedded pair of explicit RKN methods specially adapted to the numerical integration of perturbed oscillators is obtained. This pair depends on a parameter v = ωh > 0 (h is the integration step and ω is the dominant frequency), and it has four stages and algebraic orders five and three. The numerical experiments carried out show that the new pair is very competitive when it is compared with high-quality codes proposed in the scientific literature.
An asymptotically optimal greedy algorithm for large optical burst switching systems
Authors: Lachlan L. H. Andrew, Yuliy Baryshnikov, E. G. Coffman
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

As the number of wavelengths in OBS systems increases, the utilization achievable for a given blocking probability can be made to approach 100%. This paper shows that this property applies to a wavelength allocation algorithm of greedy type. Another property of this rule, one shared by most other wavelength assignment algorithms, is that, since lost traffic tends to occur near destinations, where the resource usage wasted by such traffic is large, very low blocking probabilities are important for efficient operation. To help identify regions of low blocking probability, we derive an asymptotically exact condition for zero blocking probabilities; it has a form reminiscent of the stability condition of the M/G/1 queue.
Approximation of Boolean Functions by Local Search
Authors: Andreas Albrecht, Chak-Kuen Wong
Venue: Computational Optimization and Applications (2004)

Usually, local search methods are considered to be slow. In our paper, we present a simulated annealing-based local search algorithm for the approximation of Boolean functions with a proven time complexity that behaves relatively fast on randomly generated functions. The functions are represented by disjunctive normal forms (DNFs). Given a set of m uniformly distributed positive and negative examples of length n generated by a target function F(x1,&hellip;,xn), where the DNF consists of conjunctions with at most &ell; literals only, the algorithm computes with high probability a hypothesis H of length m &middot; &ell; such that the error is zero on all examples. Our algorithm can be implemented easily and we obtained a relatively high percentage of correct classifications on test examples that were not presented in the learning phase. For example, for randomly generated F with n &equals; 64 variables and a training set of m &equals; 16384 examples, the error on the same number of test examples was about 19% on positive and 29% on negative examples, respectively. The proven complexity bound provides the basis for further studies on the average case complexity.
Hidden Markov Measure Field Models for Image Segmentation
Authors: Jose L. Marroquin, Edgar Arce Santana, Salvador Botello
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Parametric image segmentation consists of finding a label field that defines a partition of an image into a set of nonoverlapping regions and the parameters of the models that describe the variation of some property within each region. A new Bayesian formulation for the solution of this problem is presented, based on the key idea of using a doubly stochastic prior model for the label field, which allows one to find exact optimal estimators for both this field and the model parameters by the minimization of a differentiable function. An efficient minimization algorithm and comparisons with existing methods on synthetic images are presented, as well as examples of realistic applications to the segmentation of Magnetic Resonance volumes and to motion segmentation.
An architecture-based approach for service-oriented software development
Authors: Gerald C. Gannod
Venue:  (2003)

Legacy applications are prime candidates for software reuse as they have been relied upon for several years and often have a strong organizational commitment. Migrating existing legacy applications is a very likely requirement when moving to and adopting a new technology. A service-based development paradigm is one in which components are viewed as services. In this model, services interact and can be providers or consumers of data and behavior. This dissertation describes an architecture-based approach for the synthesis of services from legacy components and their subsequent integration with service-requesting client applications. The technique utilizes an architecture description language to describe services and achieves run-time integration using current middleware technology. This dissertation demonstrates and evaluates the approach by synthesizing and integrating example applications using the automated tools that have been created. The approach involves capturing the interface of legacy components as a software architecture specification. Once specified, the architecture specification is used to generate a service by wrapping the legacy components rising automated tools. In addition, once these services are stored in a repository, a software architecture specification is used to specify a client to utilize the services. This specification is then used to generate the client application using another automated cool. When the generated client application is executed or a network, it requests the interested services and binds and integrates with there.
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Authors: Roland Häggkvist, Jeannette Janssen
Venue: Combinatorics, Probability and Computing (1997)

In this paper we show that the list chromatic index of the complete graph Kn is at most n. This proves the list-chromatic conjecture for complete graphs of odd order. We also prove the asymptotic result that for a simple graph with maximum degree d the list chromatic index exceeds d by at most &Oscr;(d2&#x002F;3&radic;log d).
STM surface modification of the Si-SiO2-polymer system
Authors: V. M. Kornilov, A. N. Lachinov
Venue: Microelectronic Engineering (2003)

This paper presents the results of a STM investigation of the Si-SiO2 and Si-SiO2-polymer systems in air. Depending on the scanning parameters, such as the applied voltage and tunneling current, a modification of the Si-SiO2 surface was observed during the experiments. The possibility of a reversible modification was demonstrated. A thin polymer film was used to exclude the adsorption-desorption and electrochemical processes on the Si surface. Modification of the Si-SiO2- polymer surface was observed at scanning parameters similar to those used for modification of the Si-SiO2 system. The electronic mechanism of the surface modification based on tunneling of the charge through the oxide layer and its influence on the STM tunneling current is discussed.