ppxscal/embedding_network huggingface dataset:
WebEv -- A Collaborative Environment for Supporting Measurement Frameworks
Authors: Lerina Aversano, Thierry Bodhuin, Gerardo Canfora, Maria Tortorella
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Assessment activities play a key role when an enterprise wants to evolve its business processes for adopting innovative information and communication technologies. The assessment regards business processes and supporting software systems and, to be effective, it requires the support of adequate software environments that facilitate the collaboration among the involved assessors. The definition and implementation of such a kind of environment implies the previous definition of a measurement framework that may guide the specification and design of the environment.This paper presents the collaborative software environment WebEv to support any kind of assessment framework whose definition is based on the Goal Question Metric paradigm. The environment is flexible and easily customizable to any context and arising needs. It can represent a practical mean for the collection of the available quantitative information regarding the processes and/or software systems of an enterprise.
Meta Model Approach for Mediation
Authors: Masataro Shiroiwa, Takao Miura, Isamu Shioya
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this work, we discuss how to interpret traditionalData Flow Diagram (DFD) by Unified Modeling Language(UML) for the purpose of integrating legacy systems withmodern systems. To do that we introduce DFD meta modelby using UML class diagrams and Object Constraint Language(OCL). We utilize the meta model to capture DFD semanticsand establish close correspondence between DFDexpressions and the expressions that can be derived by instantiatingthe meta framework. At the same time we describeprocedures to generate UML descriptions from DFDbased on the correspondence.
Dynamics of deterministic and stochastic paired excitatory-inhibitory delayed feedback
Authors: Carlo R. Laing, André Longtin
Venue: Neural Computation (2003)

We examine the effects of paired delayed excitatory and inhibitory feedback on a single integrate-and-fire neuron with reversal potentials embedded within a feedback network. These effects are studied using bifurcation theory and numerical analysis. The feedback occurs through modulation of the excitatory and inhibitory conductances by the previous firing history of the neuron; as a consequence, the feedback also modifies the membrane time constant. Such paired feedback is ubiquitous in the nervous system. We assume that the feedback dynamics are slower than the membrane time constant, which leads to a rate model formulation. Our article provides an extensive analysis of the possible dynamical behaviors of such simple yet realistic neural loops as a function of the balance between positive and negative feedback, with and without noise, and offers insight into the potential behaviors such loops can exhibit in response to time-varying external inputs. With excitatory feedback, the system can be quiescent, can be periodically firing, or can exhibit bistability between these two states. With inhibitory feedback, quiescence, oscillatory firing rates, and bistability between constant and oscillatory firing-rate solutions are possible. The general case of paired feedback exhibits a blend of the behaviors seen in the extreme cases and can produce chaotic firing. We further derive a condition for a dynamically balanced paired feedback in which there is neither bistability nor oscillations. We also show how a biophysically plausible smoothing of the firing function by noise can modify the existence and stability of fixed points and oscillations of the system. We take advantage in our mathematical analysis of the existence of an invariant manifold, which reduces the dimensionality of the dynamics, and prove the stability of this manifold. The novel computational challenges involved in analyzing such dynamics with and without noise are also described. Our results demonstrate that a paired delayed feedback loop can act as a sophisticated computational unit, capable of switching between a variety of behaviors depending on the input current, the relative strengths and asymmetry of the two parallel feedback pathways, and the delay distributions and noise level.
Data mining applications for self-organizing maps
Authors: Mark J. Embrechts
Venue:  (2003)

Self-Organizing Maps (SOM) are unsupervised learning neural networks. They provide a mapping from high-dimensional data onto a lower dimensional output map, while preserving the topology of the input data. SOM visualization methods are used to extract knowledge and useful information from the data. According to this process, the SOM is extensively used in data mining applications. We develop novel SOM techniques for data exploration and predictions: a novel SOM mode to predict the response variable for data based on the nearest neighbor learning in the SOM; a Kernel-SOM, where the data are first transformed into a radial-basis function kernel matrix before applying the SOM to enhance clustering and classification of the SOM; and a novel modified SOM method to improve cluster visualization. We applied the SOM and these novel techniques as clustering and classification tools for several high-dimensional applications. The SOM was applied to Human Serum Albumin dataset, magnetocardiogram data, and DNA splice junction data. For the human serum albumin data, the SOM is applied to reveal highly correlated descriptors and to predict a biological response. In the magnetocardiogram data application of the SOM, the objective is to apply the SOM for heart disease patient and non-heart disease patient classification based on the magnetocardiogram patterns. For the DNA splice junction dataset, the SOM is applied to classify gene sequences in human DNA.
Stream function approach for determining optimal surface currents
Authors: G. N. Peeren
Venue: Journal of Computational Physics (2003)

In many areas in industrial engineering, one may be faced with the question how an electromagnetic device has to be designed such that both a rather complex set of requirements such as geometrical constraints has to be fulfilled, and of which the magnetic properties has to be optimal in some sense. Given an electromagnetic design, a variety of methods exist to compute the additional magnetic properties and hence verify the constraints. However, the problem in which the optimal parameters are to be calculated given a set of constraints, is in general harder to solve. In this paper, we focus on quasi-static electromagnetic problems, where the problem is to find a certain conductor shape confined to an arbitrary but given surface, and electromagnetic properties are prescribed. Also conductive surfaces may be present, which affect these electromagnetic properties. With some additional assumptions the shape optimization problem can be formulated as a quadratic optimization problem with linear constraints.
Comparisons in Hoare's Find Algorithm
Authors: Peter Kirschenhofer, Helmut Prodinger
Venue: Combinatorics, Probability and Computing (1998)

We study the number of comparisons in Hoare's Find algorithm. Using trivariate generating functions, we get an explicit expression for the variance of the number of comparisons, if we search for the jth element in a random permutation of n elements. The variance is also asymptotically evaluated under the assumption that j is proportional to n. Similar results for the number of passes (recursive calls) are given, too.
A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem
Authors: Jun Han, Graham McMahon, Stephen Sugden
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper studies the capacitated minimum spanningtree (CMST) problem, which is one of the mostfundamental and significant problems in the optimaldesign of local computer networks. A solution methodusing a node-oriented branch and bound technique isintroduced and its performance is presented. We show theadvantages of the algorithm while illustrating the processof searching for the optimal solution. Techniques forfinding tighter lower bounds are emphasized.Computational experiences demonstrate the algorithm'seffectiveness.
An empirical evaluation of international capital flows for developing countries
Authors: Suhejla Hoti
Venue: Mathematics and Computers in Simulation (2004)

Flows of international capital to developing countries have fluctuated substantially over the last three decades. Empirical evidence concerning the main causes of international capital flows is, in general, mixed. There is strong support for the 'push' view that external factors have been important in driving capital inflows to emerging markets. However, the apparent importance of 'push' factors does not preclude the relevance of 'pull' phenomena. 'Pull' factors may be necessary to explain the geographic distribution of capital flows over time. During 1970-1990, international capital flows were mainly in the form of bank lending directed to governments and/or to the private sector. In the 1990s, capital flows took the form of foreign direct investment (FDD and portfolio investment (PI), including bond and equity flows. The purpose of the paper is to examine the nature of foreign direct investment and portfolio investment, both of which help to finance investment and stimulate economic growth in the developing world. A quantitative classification of empirical international capital flows models forms the database for the paper. After classifying and describing the data, various theoretical and empirical model specifications used in the literature are reviewed analytically and empirically. A comparison of trends and volatilities in international capital flows for nine representative developing countries is given for 1977-2001.
Integrated Ambient Services as Enhancement to Physical Marketplaces
Authors: Seng Wai Loke, Arkady Zaslavsky
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Ambient services are services that are related to the surrounding physical environment of the user, and can be considered a form of location-based services. Different kinds of ambient shopping services have been developed to aid users including brokerage services, navigational services, comparison shopping, product search, location-based auctions, wireless advertising, and even informational services where a user can point a device to a particular product or shop to find out more about it. With mobile devices, these services are made available at the point when the user needs it, for example, when they are at a shopping mall or in a busy tourist shopping complex. This paper proposes a conceptual framework of how a set of locally useful ambient services can be meaningfully organized based on the user's physical location and intended tasks to enhance a physical marketplace such as a shopping street or a shopping mall. We also outline an architecture for the system and how rule-based service composition can be performed on the client-side.
A mapping-independent primitive for the triangulation of parametric surfaces
Authors: Marco Attene, Bianca Falcidieno, Michela Spagnuolo, Geoff Wyvill
Venue: Graphical Models (2003)

This paper describes a new technique for the triangulation of parametric surfaces. Most earlier methods sample the parameter domain, and the wrong choice of parameterization can spoil the triangulation or even cause the algorithm to fail. Conversely, we use a local tessellation primitive to sample and triangulate the surface. The sampling is almost uniform and the parameterization becomes irrelevant. If sampling density or triangle shape has to be adaptive, the resulting uniform mesh can be used either as an initial coarse mesh for a refinement process, or as a fine mesh to be reduced.
Inequalities for Means of Restricted First-Passage Times in Percolation Theory
Authors: Sven Erick Alm, John C. Wierman
Venue: Combinatorics, Probability and Computing (1999)

A simple geometric argument establishes an inequality between the sums of two pairs of first-passage times. This result is used to prove monotonicity, convexity and concavity results for first-passage times with cylinder and half-space restrictions.
An investigation of knowledge management implementation strategies
Authors: Nakkiran N. Sunassee, David A. Sewry
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

This paper details research conducted in the area of knowledge management implementation strategies. An investigation of the literature reveals that when organisations initiate a knowledge management effort, most of them tend to over-emphasise the role of information technology at the expense of the human factor. A preliminary survey of local organisations using Duffy's Knowledge Management Benchmarking Questionnaire confirms these findings, and a framework which will address the shortcomings in current knowledge management implementation strategies is proposed. An empirical study testing the validity of the framework is described, and the study concludes that the proposed framework has displayed its validity.
A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem
Authors: Min-Shiang Hwang, Eric Jui-Lin Lu, Iuon-Chang Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In a (t,n) threshold proxy signature scheme, the original signer delegates the power of signing messages to a designated proxy group of n members. Any t or more proxy signers of the group can cooperatively issue a proxy signature on behalf of the original signer, but (t-1) or less proxy signers cannot. Previously, all of the proposed threshold proxy signature schemes have been based on the discrete logarithm problem and do not satisfy all proxy requirements. In this paper, we propose a practical, efficient, and secure (t,n) threshold proxy signature scheme based on the RSA cryptosystem. Our scheme satisfies all proxy requirements and uses only a simple Lagrange formula to share the proxy signature key. Furthermore, our scheme requires only 5 percent of the computational overhead and 8 percent of the communicational overhead required in Kim's scheme.
ProxyTeller: A Proxy Placement Tool for Content Delivery under Performance Constraints
Authors: Peter Triantafillou, Ioannis Aekaterinidis
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

The efficient delivery of web content has been identified as a key issue of research for some time. Forward (or reverse) proxies, which are positioned along the request route from the users' browsers to the origin content servers, maintain a cache with copies of content from their origin servers. The strategic placement of proxies across the backbone ISP or the Content Delivery Network can drastically improve the performance of the system (in terms of network bandwidth savings, origin server load, and user-request latency).The ultimate goal of this work is to develop a tool that decides on the position and the number of proxies required in order to achieve given performance improvements (expressed in terms of network bandwidth, origin server load, and user-latency). We believe such a tool will be very helpful to ISPs/CDNs, content providers, and end-users and is, thus, very much lacking.
Determination of the hardness and elastic modulus of low-k thin films and their barrier layer for microelectronic applications
Authors: Lu Shen, Kaiyang Zeng, Yihua Wang, Babu Narayanan, Rakesh Kumar
Venue: Microelectronic Engineering (2003)

This paper presents the experimental results and analysis of the elastic modulus and hardness for several thicknesses of dielectric films, namely low-k films and their barrier layer, using the nano-indentation technique. The elastic modulus and hardness of the films were determined by "normal" nano-indentation analysis. The data were then analyzed by rearranging the load-displacement data (P-h) obtained by nano-indentation in such a way that the applied load divided by the corresponding displacement (P/h) versus the displacement (h) was obtained, which effectively differentiates the film-only mechanical properties from those of the substrate. The low-k film, carbon-doped silicon oxide (SiOC), was prepared using a parallel plate PECVD system. The dielectric constant of the low-k film was measured to be 3.09, which is much lower than that of commonly used dielectric materials such as SiO2 (k ∼ 3.9). The hardness and elastic modulus of the film were measured to be approximately 2.23 and 13.98 GPa, respectively. To enhance the mechanical properties of the low-k thin film, a low-k barrier layer (SiCN:H) with better mechanical properties was deposited between the low-k film and the substrate or on top of the low-k film. It was found that the barrier layer improved the mechanical properties of the low-k film and the barrier layer stacked in certain circumstances. The effects of the arrangement of the barrier layer and the low-k film on the mechanical behavior of the bi-layer system were studied in detail.
Linear and Hereditary Discrepancy
Authors: Benjamin Doerr
Venue: Combinatorics, Probability and Computing (2000)

Let A be an m &times; n matrix and q := &lfloor;log2(m)&rfloor;+1. In this article we improve the well-known bound lindisc(A) &le; 2 herdisc(A) and show thatformula hereAs with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.
Towards Survivable Intrusion Detection System
Authors: Dong Yu, Deborah Frincke
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Intrusion detection systems (IDS) are increasingly a key part of system defense, often operating under a high level of privilege to achieve their purposes. Therefore, the ability of an IDS to withstand attack is important in a production system.In this paper, we address the issue of survivable IDS. We begin by categorizing potential vulnerabilities in a generic IDS and classifying methods used to enhance IDS survivability. We then propose an efficient fault tolerance based Survivable IDS (SIDS) along with a systematic way to transform an original IDS architecture into this survivable architecture. Key components of SIDS include: a dual-functionality forward-ahead (DFFA) structure, backup communication paths, component recycling, system reconfiguration, and an anomaly detector. Use of the SIDS transformation should result in an improvement in IDS survivability at low cost.
Battery Modeling for Energy-Aware System Design
Authors: Ravishankar Rao, Sarma Vrudhula, Daler N. Rakhmatov
Venue: Computer (2003)

Advances in battery technology have not kept pace with rapidly growing energy demands. Most laptops, handheld PCs, and cell phones use batteries that take anywhere from 1.5 to 4 hours to fully charge but can run on this charge for only a few hours.The battery has thus become a key control parameter in the energy management of portables. To meet the stringent power budget of these devices, researchers have explored various architectural, hardware, software, and system-level optimizations to minimize the energy consumed per useful computation. Research in batteryaware optimization is now moving from stand-alone devices to networks of wireless devices specifically, ad hoc and distributed sensor networks.
A Probabilistic Model for Intelligent Web Crawlers
Authors: Ke Hu, Wing Shing Wong
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

With the enormous growth of the World Wide Web in recentyears, the issue of how to discover web pages efficientlyhas become an important challenge for web crawler designers.In this paper, we will outline a simple model to predictthe distribution of the search depth in a breadth-first searchto reach the first web pages relevant to a user query. Wedefine this probability as the crawler confidence. Recentstudies indicate that at a large scale the Web structure subscribesto power law distribution on several aspects [3][7].However, our work tries to model a microscopic linkagestructure of the Web from an intelligent crawler's point ofview. With the information provided by crawler confidence,an intelligent crawler can adjust its crawling behavior toachieve a higher harvest rate.
Introducing unit testing with BlueJ
Authors: Andrew Patterson, Michael Kölling, John Rosenberg
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

The teaching of testing has never been easy. The introduction of object orientation into first year courses has made it even more difficult, since more and smaller units need to be tested more often. In professional contexts this is addressed by the use of testing support software. Unfortunately, no adequate software to support testing for introductory students is widely available, leaving teachers and students of first year courses struggling.In this paper we describe an attempt to address this problem by combining two existing systems that partly address our needs. We describe an integration of JUnit into BlueJ, which creates a testing tool that exhibits the flexibility and ease-of-use of the BlueJ system combined with the structured unit test approach provided by JUnit.
Towards Simple, Easy-to-Understand, yet Accurate Classifiers
Authors: Doina Caragea, Dianne Cook, Vasant G. Honavar
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We design a method for weighting linear support vectormachine classifiers or random hyperplanes, to obtain classifierswhose accuracy is comparable to the accuracy of anon-linear support vector machine classifier, and whose resultscan be readily visualized. We conduct a simulationstudy to examine how our weighted linear classifiers behavein the presence of known structure. The results show thatthe weighted linear classifiers might perform well comparedto the non-linear support vector machine classifiers, whilethey are more readily interpretable than the non-linear classifiers.
Defect Diagnosis Using a Current Ratio Based Quiescent Signal Analysis Model for Commercial Power Grids
Authors: Chintan Patel, Ernesto Staroswiecki, Smita Pawar, Dhruva Acharyya, Jim Plusquellic
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Quiescent Signal Analysis (QSA) is a novel electrical-test-based diagnostic technique that uses IDDQ measurements made at multiple chip supply pads as a means of locating shorting defects in the layout. The use of multiple supply pads reduces the adverse effects of leakage current by scaling the total leakage current over multiple measurements. In previous work, a resistance model for QSA was developed and demonstrated on a small circuit. In this paper, the weaknesses of the original QSA model are identified, in the context of a production power grid (PPG) and probe card model, and a new model is described. The new QSA algorithm is developed from the analysis of IDDQ contour plots. A &ldquo;family&rdquo; of hyperbola curves is shown to be a good fit to the contour curves. The parameters to the hyperbola equations are derived with the help of inserted calibration transistors. Simulation experiments are used to demonstrate the prediction accuracy of the method on a PPG.