ppxscal/embedding_network huggingface dataset:
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
Authors: Baruch Awerbuch, Robert D. Kleinberg
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Minimal delay routing is a fundamental task in networks. Since delays depend on the (potentially unpredictable) traffic distribution, online delay optimization can be quite challenging. While uncertainty about the current network delays may make the current routing choices sub-optimal, the algorithm can nevertheless try to learn the traffic patterns and keep adapting its choice of routing paths so as to perform nearly as well as the best static path. This online shortest path problem is a special case of online linear optimization, a problem in which an online algorithm must choose, in each round, a strategy from some compact set S ⊆ Rd so as to try to minimize a linear cost function which is only revealed at the end of the round. Kalai and Vempala[4] gave an algorithm for such problems in the transparent feedback model, where the entire cost function is revealed at the end of the round. Here we present an algorithm for online linear optimization in the more challenging opaque feedback model, in which only the cost of the chosen strategy is revealed at the end of the round. In the special case of shortest paths, opaque feedback corresponds to the notion that in each round the algorithm learns only the end-to-end cost of the chosen path, not the cost of every edge in the network.We also present a second algorithm for online shortest paths, which solves the shortest-path problem using a chain of online decision oracles, one at each node of the graph. This has several advantages over the online linear optimization approach. First, it is effective against an adaptive adversary, whereas our linear optimization algorithm assumes an oblivious adversary. Second, even in the case of an oblivious adversary, the second algorithm performs better than the first, as measured by their additive regret.
Evaluation of Transient Fault Susceptibility in Microprocessor Systems
Authors: P. Gawkowski, J. Sosnowski
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The paper addresses the problem of evaluating transient fault impact on COTS microprocessor systems. We present the problem of fault effect propagation from low logical to software and application levels.Such an analysis is needed to optimize error detection and correction mechanisms at hardware and software levels. For this purpose we use sophisticated fault injectors.The usefulness of the presented approach was proved in many experiments described in the paper.It may support hardware/software co-design.
An uncaught exception analysis for Java
Authors: Jang-Wu Jo, Byeong-Mo Chang, Kwangkeun Yi, Kwang-Moo Choe
Venue: Journal of Systems and Software (2004)

Current JDK Java compiler relies on programmer's declarations (by throws clauses) for checking against uncaught exceptions of the input program. It is not elaborate enough to remove programmer's unnecessary handlers nor suggest to programmers for specialized handlings (when programmer's declarations are too broad). We propose a static analysis of Java programs that estimates their uncaught exceptions independently of the programmer's declarations. This analysis is designed and implemented based on set-based framework. Its cost-effectiveness is suggested by sparsely analyzing the program at method level (hence reducing the number of unknowns in the flow equations). We have shown that our interprocedural exception analysis is more precise than JDK-style intraprocedural analysis, and also that our analysis can effectively detect uncaught exceptions for realistic Java programs.
Digital blush: towards shame and embarrassment in multi-agent information trading applications
Authors: Jeremy Pitt
Venue: Cognition, Technology and Work (2004)

This paper explores the possibility of, and potential for, using a socio-cognitive theory of shame and embarrassment in agent-agent socio-economic interaction. We use this theory to specify an idea of digital blush, i.e. a representation of the state of embarrassment of an agent according to an evaluation of its behaviour by its peers. Through a detailed worked example, we demonstrate how digital blush offers a higher-level, finer-grained control of/over agent behaviour than typically strict, rule-based security mechanisms. We propose digital blush both as a computational device for self-regulation in certain types of multi-agent information trading applications, and, by representing an agent&#x2019;s shame and embarrassment through some form of status visualisation, discuss its potential as a socio-technical device for affecting &#x201c;presence&#x201d;, especially in what we refer to as socio-cognitive grids.
Evaluation of User Intervention Mechanisms for Privacy on SME Online Trust
Authors: Dawn N. Jutla, E. Kevin Kelloway, Said Saifi
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

This paper describes empirical results that quantitatively show that user intervention tools for privacy significantly contribute towards online trust. We extend a seminal, validated measurement scale for online trust by adding measurement items for 5 user intervention (UIVs) mechanisms for trust: P3P, cookie crushers, encryption, pseudonymizer, and anonymizing tools. From analysis of 242 valid user responses collected in fall 2003, we find that those users willing to adopt user intervention mechanisms have statistically significant higher mean online trusting intentions. These usersý mean trusting beliefs in small and medium size e-business is stronger than non-adopters and those undecided users sitting on the fence. Finally, we show our amendments to online trust theory to be plausible using the structural equation modeling technique and data for all groups of users.
Applying Support Vector Machines to Breast Cancer Diagnosis using Screen Film Mammogram Data
Authors: Walker H. Land,  Jr., Lut Wong, Dan McKee, Mark Embrechts, Rizly Salih, Frances Anderson
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper explores the use of different Support Vector Machines (SVM) kernels, andcombinations of kernels, to ascertain the diagnostic accuracy of a screen film mammogramdata set containing ¿ 2500 samples from five different institutions.This research hasdemonstrated that: (1) Specifically improves, on the average, of about 4% at 100% sensitivityand about 18%, on the average, at 98% sensitivity.This means that approximately 52 and 134 women would not have to undergo biopsy, at 100% and 98% sensitivity, when compared to the case of every women being biopsied, which would be necessary to identify all cancers in the absence of a computer aided diagnostic (CAD) process, (2) Positive Predictive Value (PPV) at these same values of sensitivity are much better, ranging from 48% to 51% as sensitivity is decreased from 100 to 98%.Finally, the average specifically over the top 10% or the ROC curve (which is the average specificity between 90-100% sensitivity) is about 30%.This means that, on the average, 440 women would not have to undergo biopsy, when compared to the case of all women being biopsied.
Modelling and verification of interworking between SIP and H.323
Authors: Ligang Wang, Anjali Agarwal, J. William Atwood
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

There are currently two standards for signaling and control of Internet telephone calls, namely ITU-T Recommendation H.323 and the IETF session initiation protocol (SIP). Both protocols provide similar functionality using different mechanisms. Both H.323 and SIP provide interoperability, flexibility and scalability in different aspects and environments. Interworking between SIP and H.323 is essential to ensure full end-to-end connectivity through the network, although the current number of deployed commercial SIP endpoints is relatively small compared to widely deployed H.323 endpoints.To formally specify the SIP-H.323 Interworking, this paper gives a new system model for interworking between SIP and H.323. Five main components of this system are modeled using system description language and message sequence chart: H.323 endpoint, H.323 gatekeeper, SIP-H.323 Interworking facility, SIP server, SIP endpoint. We design and define the internal structure and behavior for each component, which is established for simulating and verifying interworking between SIP and H.323. Under two different configurations that both protocols work within the same administrative domain and that both protocols are operating in separate administrative domains, we use a series of scenarios to show that our model meets the functional specifications outlined in the SIP-H323-Interworking specification documents.
New literacies in language learning and teaching: Selected papers from EUROCALL 2003
Authors: Liam Murray
Venue: ReCALL (2004)

Contained within this issue is a selection of papers presented at the 2003 annual EUROCALL Conference, hosted during September in Limerick, Ireland. This was the second time that Ireland had the privilege of welcoming EUROCALLers, the first being the conference at Dublin City University in 1997 organised by Fran&ccedil;oise Blin. The theme of EUROCALL 2003, &ldquo;New literacies in language learning and teaching&rdquo;, aimed to focus attention on the changing concepts and practices concerning literacy brought about by technological developments, particularly in relation to language learning and teaching. Sub-themes focused on the changes in practices involving literacy brought about by the World Wide Web; the need to re-interpret current teaching paradigms; the relationship between the more &ldquo;traditional&rdquo; language skills and the &ldquo;new literacies&rdquo;; interactivity, learner interaction, and feedback; and spoken and written corpora in language teaching and learning. This last theme re-introduced to EUROCALL an important research area which had been well represented in the early days of the association, and has led directly to the creation of a new SIG within the association in March 2004.
Comparison of UDDI Registry Replication Strategies
Authors: Chenliang Sun, Yi Lin, Bettina Kemme
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

UDDI registries are intended to become the world-widelookup mechanism for web-services. As such, the registryhas to provide high throughput, low response times, highavailability, and access to accurate data. Replication is oftenused to satisfy such requirements. Various replicationstrategies exist, favoring different subsets of the above performancemetrics. In this paper, we have a closer look attwo very different replication strategies. One strategy followsthe UDDI speci£cation, the second uses a middlewarebased replication tool. In this paper, we provide a comparisonof these two approaches focusing on performance andease of integration with an existing UDDI implementation.
Decentralized Authentication Mechanisms for Object-based Storage Devices
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

Network-attached object-based storage separatesdata-path from control-path and enables directinteraction between clients and the storage devices.Clients interact with the file manager only toacquire the meta-data information and some cryptographicprimitives, for example, access keys. Most ofthe current schemes rely on a centralized file managerto support these activities.This paper presents security mechanisms for decentralizedauthentication for object-based storage. Theschemes are novel in several ways. First of all, they reducethe load on the file manager and free the systemfrom central point of failure and denial of service attacks.We exploit Role-based Access Control (RBAC) toprovide scalability and design authentication schemesthat efficiently utilize RBAC. In most of the cases, theclient needs to acquire only one access key from thefile manager, which can be used by the client to furtherderive role-keys for the roles that he/she is permittedto play within an organization. Further, the numberof cryptographic keys required for the purpose of authenticationin these schemes is less as compared to theexisting schemes. Finally, we also present two simpleschemes that enable the clients to access objects storedon any device on the network using a single identity key.
Subgroup Discovery with CN2-SD
Authors: Nada Lavrač, Branko Kavšek, Peter Flach, Ljupčo Todorovski
Venue: The Journal of Machine Learning Research (2004)

This paper investigates how to adapt standard classification rule learning approaches to subgroup discovery. The goal of subgroup discovery is to find rules describing subsets of the population that are sufficiently large and statistically unusual. The paper presents a subgroup discovery algorithm, CN2-SD, developed by modifying parts of the CN2 classification rule learner: its covering algorithm, search heuristic, probabilistic classification of instances, and evaluation measures. Experimental evaluation of CN2-SD on 23 UCI data sets shows substantial reduction of the number of induced rules, increased rule coverage and rule significance, as well as slight improvements in terms of the area under ROC curve, when compared with the CN2 algorithm. Application of CN2-SD to a large traffic accident data set confirms these findings.
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
Authors: Garry Robins, Malcolm Alexander
Venue: Computational Mathematical Organization Theory (2004)

We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite graphs of directors and companies, but direct comparison of empirical datasets is often problematic because graphs have different numbers of nodes and different densities. We compare empirical bipartite graphs to simulated random graph distributions conditional on constraints implicit in the observed datasets. We examine bipartite graphs directly, rather than simply converting them to two 1-mode graphs, allowing investigation of bipartite statistics important to connection redundancy and bipartite connectivity. We introduce a new bipartite clustering coefficient that measures tendencies for localized bipartite cycles. This coefficient can be interpreted as an indicator of inter-company and inter-director closeness&semi; but high levels of bipartite clustering have a cost for long range connectivity. We also investigate degree distributions, path lengths, and counts of localized subgraphs. Using this new approach, we compare global structural properties of US and Australian interlocking company directors. By comparing observed statistics against those from the simulations, we assess how the observed graphs are structured, and make comparisons between them relative to the simulated graph distributions. We conclude that the two networks share many similarities and some differences. Notably, both structures tend to be influenced by the clustering of directors on boards, more than by the accumulation of board seats by individual directors&semi; that shared multiple board memberships (multiple interlocks) are an important feature of both infrastructures, detracting from global connectivity (but more so in the Australian case)&semi; and that company structural power may be relatively more diffuse in the US structure than in Australia.
New upper bounds on feedback vertex numbers in butterflies
Authors: Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee
Venue: Information Processing Letters (2004)

Butterflies are undirected graphs of bounded degree. They are widely used as interconnection networks. In this paper we study the feedback vertex set problem for butterflies. We show that the feedback vertex set found by Luccio's algorithm [Inform. Process. Lett. 66 (1998) 59-64] for the k-dimensional butterfly Bk is of size ⌊(3k + 1)2k + 1/9⌋. Besides, we propose an algorithm to find a feedback vertex set of size either ⌊(3k + 1)2k + 1/9⌋ - 2k - 1/3 or ⌊(3k + 1)2k + 1/9⌋ - 2k - 2 ⌈k/2⌉ - 2⌊k/2⌋ + 1 / 3 for Bk depending on whether k is even or odd.
Security or Cosmetology?
Authors: Michael A. Caloyannides
Venue: IEEE Security and Privacy (2004)

We have lulled ourselves into accepting government-mandated "cosmetic" measures in place of substantive security on the erroneous assumption that a little security is better than none. Under public pressure to "do something" after a major security incident, governments often feel compelled to come up with quick fixes that appease the populace. In truth, such cosmetic populist security is worse than no security at all because it lulls us into dropping our guard.Keywords: airport security, government-mandated, quick fix, 9/11
Sylvester&#x2013;Gallai Theorem and Metric Betweenness
Authors: Vasek Chv&#x00e1;tal
Venue: Discrete Computational Geometry (2004)

Sylvester conjectured in 1893 and Gallai proved some 40 years later that every finite set S of points in the plane includes two points such that the line passing through them includes either no other point of S or all other points of S. There are several ways of extending the notion of lines from Euclidean spaces to arbitrary metric spaces. We present one of them and conjecture that, with lines in metric spaces defined in this way, the Sylvester--Gallai theorem generalizes as follows: in every finite metric space there is a line consisting of either two points or all the points of the space. Then we present meagre evidence in support of this rash conjecture and finally we discuss the underlying ternary relation of metric betweenness.
A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking
Authors: Yoshifumi Manabe, JaeHyrk Park
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper presents a quorum-based distributed algorithmfor the extended group mutual exclusion problem. Inthe group mutual exclusion problem, multiple processes canenter a critical section simultaneously if they belong to thesame group. Processes in different groups cannot enter acritical section at the same time. In the extended group mutualexclusion, each process is a member of multiple groupsat the same time. Each process can select which group itbelongs at making a request. The algorithm for the groupmutual exclusion cannot be applied for this extended problem,since there can be a case that two processes are preventedfrom entering a critical section simultaneously evenwhen they are capable of doing so. We call the above situationunnecessary blocking. We present a quorum-basedalgorithm that prevents unnecessary blocking and show itscorrectness proof.
Simulations between cellular automata on trees extended by horizontal edges
Authors: Thomas Worsch
Venue: Fundamenta Informaticae (2003)

In this paper we consider cellular automata where the graph defined by the neighbourhood relations between the cells is a tree "with additional edges". This includes hyperbolic CA defined by regular tessellations of the two-dimensional hyperbolic plane. It is shown that all X-tree CA and all hyperbolic CA can C-simulate each other with constant slowdown, independent of the "branching factors" of the underlying trees.
Numerical solutions of the Burgers' equation by the least-squares quadratic B-spline finite element method
Authors: S. Kutluay, A. Esen, I. Dag
Venue: Journal of Computational and Applied Mathematics (2004)

In this study, a least-squares quadratic B-spline finite element method for calculating the numerical solutions of the one-dimensional Burgers-like equations with appropriate boundary and initial conditions is presented. Three test problems have been studied to demonstrate the accuracy of the present method. Results obtained by the method have been compared with the exact solution of each problem and are found to be in good agreement with each other. A Fourier stability analysis of the method is also investigated.
Physically Based Simulation of Cracks on Drying 3D Solids
Authors: Kimiya Aoki, Ngo Hai Dong, Toyohisa Kaneko, Shigeru Kuriyama
Venue: Proceedings of the Computer Graphics International (2004)

Cracking is a natural phenomenon commonly observedon the surface of such objects as concrete, clay walls, ricefields, pottery, and tree barks. This paper describes a newphysically based method for synthesizing 3D cracking patternsin clay solids by incorporating a moisture model. Weemploy actually measured values of the physical parametersused in the model. In addition, we describe a new methodfor dealing with a 3D freeform object based upon the close-packedstructure. Animated synthesis of not only externalcracks but also internal cracks of 3D freeform solids is possible.
Protocol Decode Based Stateful Firewall Policy Definition Language
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

The policies for thwarting attacks on systems varygreatly in complexity, ranging from simple staticfirewall rules to complex stateful protocol statemachine analysis. As intrusion detection systems aregetting integrated into firewall solutions, there is aneed for a language that can define both firewallpolicies and system intrusion behavior and exhibitinter-operable traits. This paper presents an XMLbased, self-documenting State-Aware FirewallLanguage (SAFire) that is designed to express thevarious kinds of firewall and intrusion behavior.
Interactive Rendering with LOD Control and Occlusion Culling Based on Polygon Hierarchies
Authors: Tokuo Tsuji, Hongbin Zha, Ryo Kurazume, Tsutomu Hasegawa
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a new method of combiningdynamic control of LOD and conservative occlusionculling based on a new hierarchical data structure ofpolygons. Our method is effective for rendering a largeamount of data in complex environments.
Adaptive ordering of pipelined stream filters
Authors: Shivnath Babu, Rajeev Motwani, Kamesh Munagala, Itaru Nishizawa, Jennifer Widom
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications and capture a large class of multiway stream joins. We focus on the problem of ordering the filters adaptively to minimize processing cost in an environment where stream and filter characteristics vary unpredictably over time. Our core algorithm, A-Greedy (for Adaptive Greedy), has strong theoretical guarantees: If stream and filter characteristics were to stabilize, A-Greedy would converge to an ordering within a small constant factor of optimal. (In experiments A-Greedy usually converges to the optimal ordering.) One very important feature of A-Greedy is that it monitors and responds to selectivities that are correlated across filters (i.e., that are nonindependent), which provides the strong quality guarantee but incurs run-time overhead. We identify a three-way tradeoff among provable convergence to good orderings, run-time overhead, and speed of adaptivity. We develop a suite of variants of A-Greedy that lie at different points on this tradeoff spectrum. We have implemented all our algorithms in the STREAM prototype Data Stream Management System and a thorough performance evaluation is presented.