ppxscal/embedding_network huggingface dataset:
The truncated fourier transform and applications
Authors: Joris van der Hoeven
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the "jumps" in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, we gain a logarithmic factor with respect to the best previously known algorithms.
Abstraction and Refinement in Protocol Derivation
Authors: Anupam Datta, Ante Derek, John C. Mitchell, Dusko Pavlovic
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Protocols may be derived from initial components bycomposition, refinement, and transformation. Addingfunction variables to a previous protocol logic, we developan abstraction-instantiation method for reasoning abouta class of protocol refinements. The main idea is to viewchanges in a protocol as a combination of finding a meaningful "protocol template" that contains function variables in messages, and producing the refined protocol asan instance of the template. Using higher-order protocol logic, we can develop a single proof for all instances of a template. A template can also be instantiated to another template, or a single protocol may be an instance of more than one template, allowing separate protocol properties to be proved modularly. These methods are illustrated using some challenge-response and key exchangeprotocol templates and an exploration of the design spacesurrounding JFK (Just Fast Keying) and related protocols from the IKE (Internet Key Exchange) family, which produces some interesting protocols not previously studied in the open literature.
Service based framework for knowledge portals
Authors: S. Ramakrishnan, A. Cambrell
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper describes our work on establishing an on-line learning community to facilitate the interactions of the student (teams) in their group projects. It is illustrated with a Portal in the capstone project of our Bachelor of Software Engineering (BSE) course. [2] reported on our Monash University Software Engineering (MUSE) Studio Lab and the innovative software engineering capstone project experience. Our student teams used to store the various artefacts, which were produced as part of the SE Studio (capstone) projects on the servers in the studio lab. However, these SE product and process artefacts were not accessible uniformly through a web browser in a MUSE Portal. The Portal environment is aimed at providing a virtual learning space, knowledge aggregation and user management. In this paper, we provide details of our pedagogical service based framework, which has been designed and built to provide features to Portal users. The framework supports services such as group/team collaboration, task tracking, and project planning.The collaboration and learning services available from our Knowledge Portal is based on the learning activities as defined by [1] Nonaka1994. Nonaka defines: socializing to exchange views and develop trust between team members, dialoguing to share mental models and develop common vocabulary, systemising to combine knowledge by visualising interactions and constructing artifacts and exercising to communicate and reflect on outcomes. We follow a similar approach to enable team members to discuss and reflect on group findings with respect to SE processes & products during the year long SE Studio project, and reflect over individual thesis components.A pedagogical service based framework can service the current pedagogical needs of the SE group projects, other related subjects, and SE Honours research projects and is also extendible with more services on a demand basis. The focus has been on allowing custom subject specific services to be created without having the inherent overheads.A pedagogical framework with service based architecture has been built to provide services to the Portal users. The Portal Environment is the front-end through which services are exposed. Examples of services are: task tracking and project planning in group projects; collaboration between team members in a group project in a subject unit; knowledge repository of product/project assets; calendar facility etc. Support infrastructure services of user authentication, role and service allocation etc. are also managed via the portal environment.We show how on-line learning communities can be supported using the MUSE knowledge portal. The framework supports services such as team collaboration, task tracking, and project planning. The url for MUSE Portal is http://museportal.csse.monash.edu.au:8080/MUSEPortalWeb/.
Safety of abstract interpretations for free, via logical relations and Galois connections
Authors: Kevin Backhouse, Roland Backhouse
Venue: Science of Computer Programming (2004)

Algebraic properties of logical relations on partially ordered sets are studied. It is shown how to construct a logical relation that extends a collection of base Galois connections to a Galois connection of arbitrary higher-order type. "Theorems-for-free" is used to show that the construction ensures safe abstract interpretation of parametrically polymorphic functions. The properties are used to show how abstract interpretations of program libraries can be constructed.
Simulations between multi-dimensional deterministic and alternating cellular automata
Authors: Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
Venue: Fundamenta Informaticae (2003)

We present simulation and separation results between multi-dimensional deterministic and alternating cellular automata (CAs). It is shown that for any integers k ≥ l ≥ 1, every k-dimensional t(n)-time deterministic CA can be simulated by an l-dimensional O(t(n)k-l+1/k-l+2)-time alternating CA. This result is a dimension reduction theorem and also a time reduction theorem: (i) Every multi-dimensional deterministic CA can be simulated by a one-dimensional alternating CA without increasing time complexity. (ii) Every deterministic computation in a multi-dimensional deterministic CA can be sped up quadratically by alternations when the dimension is fixed. Furthermore, it is shown that there is a language which can be accepted by a one-dimensional alternating CA in t(n) time but not by any multi-dimensional deterministic CA in t(n) time.
A Policy Driven Approach to Email Services
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

The primary original design goal for email was toprovide best-effort message delivery. Unfortunately, asthe ever increasing uproar over SPAM demonstrates, theexisting email infrastructure is no longer well suited tothe worldwide set of email users - particularly email receivers.Rather than propose yet another band-aid solutionto SPAM, this paper rethinks email from the requirementsperspective, albeit with the constraint of designing a systemsuitable for incremental adoption in the current environment.Our result to this exercise is a policy driven emailservice in which the interests of each principal can be articulatedand accommodated. Our scheme rewards faithfulsenders with better quality of service and discourages misbehavior.Our scheme provides receivers with policy-drivencontrol over whether and how a given message appears inthe recipients mailbox.
Software Implementation for Mobile Agents in Peer-to-Peer-Networks - A Case Study
Authors: Daniel Lubke, Jorge Marx Gomez
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The topic of mobile agents has been of great interest to researchers in the last years. However, research concentrated on academic systems, like simulation or other applications in the area of artificial intelligence, or on systems with central authorities and in a trustworthy environment. This paper shows how a framework suitable for open (and therefore untrusted) peer-to-peer-networks has been developed as part of our research activities.
Labelled and unlabelled enumeration of k-gonal 2-trees
Authors: Gilbert Labelle, Cédric Lamathe, Pierre Leroux
Venue: Journal of Combinatorial Theory Series A (2004)

In this paper, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or k-sided polygons (k-gons), where k ≥ 3 is given. This generalization, to k-gonal 2-trees, is natural and is closely related, in the planar case, to some specializations of the cell-growth problem. Our goal is the labelled and unlabelled enumeration of k-gonal 2-trees according to the number n of k-gons. We give explicit formulas in the labelled case, and, in the unlabelled case, recursive and asymptotic formulas.
A Comparative Evaluation of Term Weighting Methods for Information Filtering
Authors: Nikolaos Nanas, Victoria Uren, Anne de Roeck
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Users of information filtering systems can not be expected to provide large amounts of information to initialize a profile. Therefore, term weighting methods for information filtering have somewhat different requirements to those for information retrieval and text categorization. We present a comparative evaluation of term weighting methods, including a new method, relative document frequency, designed specifically for information filtering. The best weighting methods appear to be those that favor information provided by the user, over information from a general collection.
Embedded DRAM design and architecture for the IBM 0.11-µm ASIC offering
Authors: J. E. Barth, J. H. Dreibelbis, E. A. Nelson, D. L. Anand, G. Pomichter, P. Jakobsen, M. R. Nelms, J. Leach, G. M. Belansek
Venue: IBM Journal of Research and Development (2002)

This paper presents an overview of the macro design, architecture, and built-in self-test (BIST) implementation as part of the IBM third-generation embedded dynamic random-access memory (DRAM) for the IBM Blue LogicÂ® 0.11-Âµm application-specific integrated circuit (ASIC) design system (CU-11). Issues associated with embedding DRAM in an ASIC design are identified and addressed, including fundamental DRAM core function, user interface, test, and diagnosis. Macro operation and organization are detailed and contrasted with traditional DRAM designs. The use of BIST, a key enabler for embedded DRAM, is discussed while highlighting innovations required by the embedded DRAM.
Web Services as Information Systems Innovation: A Theoretical Framework for Web Service Technology Adoption
Authors: Marc N. Haines
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

This article presents a theoretical frameworkdistinguishing four systematically different levels ofWeb Service technology adoption. Based onSwanson's IS innovation theory the conjecture ismade that each level of Web Service technologyadoption has important differences in adoptionrequirements and the potential outcomes. Theframework is intended to be a conceptual basis formethods to evaluate Web Service technology adoptionand may consequently help devise strategies toeffectively adopt Web Service technology.
Characterization and modeling of nanometric SiO2 dielectrics
Authors: C. Leroux, P. Mur, N. Rochat, D. Rouchon, R. Truche, G. Reimbold, G. Ghibaudo
Venue: Microelectronic Engineering (2004)

Accurate characterization and modeling of nanometric oxide is important for advanced CMOS technologies involving either thin SiO2 dielectric or high-K gate stack. For this purpose, the limit of characterization and modeling have been investigated on two different lots, with targeted oxide thickness from 3.5 to 0.6 nm. Electrical characterizations are firstly evaluated in regard to targeted oxide thickness. Then, thickness obtained through quantum modeling are compared to other physical measurements.
Procedural Modeling of Cracks and Fractures
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper presents a procedural method for modelingcracks and fractures in solid materials such as glass, metaland stone. Existing physically based techniques are computationallydemanding and lack control over crack andfracture propagation. Our procedural approach providesthe designer with simple tools to control the pattern of thecracks and the size and shape of fragments. Given a fewparameters, our method automatically creates a vast rangeof types of cracks and fragments of different shapes.
Development of dental implant movement (IM) checker for dental implant mobility assessment
Authors: Sastra Kusuma Wijaya, Takuya Sumikawa, Keiji Saratani, Takayoshi Kawazoe, Hisao Oka
Venue: Technology and Health Care (2004)

This study aimed at developing a dental implant movement (IM) checker for assessing quantitative dental implant mobility. The design of the instrument was based on the tooth mobility (TM) tester, which was previously developed by our group. The IM checker consists of a newly developed measuring probe which has the size of a typical dental drill so that it would be easy to measure at all regions of dental implants. The probe has a bimorph ceramics transducer for actuating an implant at constant frequency and force amplitude and for detecting acceleration response. A set of strain gauges were attached to the bimorph ceramics for detecting preload during measurement. A new digital data acquisition system was used to eliminate measurement artifacts mainly due to probe handling. The IM checker could discriminate the artificial dental implant models in the range of clinical tooth mobility MO with variation less than 6%. The measuring time needed by five operators was less than 15 s. Accordingly, the IM checker has sufficient measuring reliability and therefore it could be introduced in dental clinics.
Topology discovery in heterogeneous IP networks: the NetInventory system
Authors: Yuri Breitbart, Minos Garofalakis, Ben Jai, Cliff Martin, Rajeev Rastogi, Avi Silberschatz
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Knowledge of the up-to-date physical topology of an IP network is crucial to a number of critical network management tasks, including reactive and proactive resource management, event correlation, and root-cause analysis. Given the dynamic nature of today's IP networks, keeping track of topology information manually is a daunting (if not impossible) task. Thus, effective algorithms for automatically discovering physical network topology are necessary. Earlier work has typically concentrated on either 1) discovering logical (i.e., layer-3) topology, which implies that the connectivity of all layer-2 elements (e.g., switches and bridges) is ignored, or 2) proprietary solutions targeting specific product families. In this paper, we present novel algorithms for discovering physical topology in heterogeneous (i.e., multi-vendor) IP networks. Our algorithms rely on standard SNMP MIB information that is widely supported by modern IP network elements and require no modifications to the operating system software running on elements or hosts. We have implemented the algorithms presented in this paper in the context of the NetInventory topology-discovery tool that has been tested on Lucent's own research network. The experimental results clearly validate our approach, demonstrating that our tool can consistently discover the accurate physical network topology with reasonably small running-time requirements even for fairly large network configurations.
An approximate König's theorem for edge-coloring weighted bipartite graphs
Authors: José R. Correa, Michel X. Goemans
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We consider a generalization of edge coloring bipartite graphs in which every edge has a weight in [0,1] and the coloring of the edges must satisfy that the sum of the weights of the edges incident to a vertex v of any color must be at most 1. For unit weights, König's theorem says that the number of colors needed is exactly the maximum degree. For this generalization, we show that 2. 557 n + o(n) colors are sufficient where n is the maximum total weight adjacent to any vertex, improving the previously best bound of 2. 833n+O(1) due to Du et al. This question is motivated by the question of the rearrangeability of 3-stage Clos networks. In that context, the corresponding parameter n of interest in the edge coloring problem is the maximum over all vertices of the number of unit-sized bins needed to pack the weights of the incident edges. In that setting, we are able to improve the bound to 2. 5480 n + o(n), also improving a bound of 2. 5625n+O(1) of Du et al. Our analysis is interesting in its own and involves a novel decomposition result for bipartite graphs and the introduction of an associated continuous one-dimensional bin packing instance which we can prove allows perfect packing.
An Hierarchical Policy-Based Architecture for Integrated Management of Grids and Networks
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

The management of the underlying network infrastructure,which supports the grid communications, isnot proceeded through the same management systemsused for the grid management. In this scenario, anintegrated management of grids and networks could turnthe maintenance processes easier. This paper proposesan hierarchical policy-based architecture, whose goal isto allow such desired integration, where grid policies aretranslated to network policies following mapping rulesdefined by network administrators. It also describes aprototype implemented based on the architecture.
HARMONICA: Enhanced QoS Support with Admission Control for IEEE 802.11 Contention-based Access
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Currently deployed IEEE 802.11 WLANs work mostlywith Distributed Coordination Function (DCF) mode at theMAC layer, which does not provide QoS support. The upcomingIEEE standard 802.11e achieves service differentiationby assigning different Channel Access Parameters(CAPs) to different traffic classes at the MAC layer. However,such relative differentiation does not yield QoS guarantee.In practice, appropriately selecting CAPs a prioriis difficult. Time-varying traffic loads also make the use offixed CAPs inefficient for both QoS support and channel utilization.In this work, we propose a novel architecture calledHARMONICA, in which the access point dynamically selectsthe best CAPs for each traffic class to optimally matchtheir QoS requirements. We present and discuss a simple admissioncontrol mechanism used by HARMONICA to avoidcongestion. Our simulation results demonstrate that underan interference-free environment, HARMONICA can guaranteethe QoS for all traffic classes while simultaneouslyachieving quasi-optimal channel utilization.
A classification paradigm for distributed vertically partitioned data
Authors: Jayanta Basak, Ravi Kothari
Venue: Neural Computation (2004)

In general, pattern classification algorithms assume that all the features are available during the construction of a classifier and its subsequent use. In many practical situations, data are recorded in different servers that are geographically apart, and each server observes features of local interest. The underlying infrastructure and other logistics (such as access control) in many cases do not permit continual synchronization. Each server thus has a partial view of the data in the sense that feature subsets (not necessarily disjoint) are available at each server. In this article, we present a classification algorithm for this distributed vertically partitioned data.We assume that local classifiers can be constructed based on the local partial views of the data available at each server. These local classifiers can be any one of the many standard classifiers (e.g., neural networks, decision tree, k nearest neighbor). Often these local classifiers are constructed to support decision making at each location, and our focus is not on these individual local classifiers. Rather, our focus is constructing a classifier that can use these local classifiers to achieve an error rate that is as close as possible to that of a classifier having access to the entire feature set. We empirically demonstrate the efficacy of the proposed algorithm and also provide theoretical results quantifying the loss that results as compared to the situation where the entire feature set is available to any single classifier.
Block triangular preconditioners for symmetric saddle-point problems
Authors: V. Simoncini
Venue: Applied Numerical Mathematics (2004)

In this paper we study the spectral properties and the computational performance of a block triangular preconditioner for the solution of the general symmetric saddle-point problem. We provide estimates for the region containing both the nonreal and the real eigenvalues. Moreover, we show that an indefinite inner product can be employed to devise an efficient short-term recurrence Krylov subspace solver to be used with the analyzed preconditioner. Numerical experiments on a variety of application problems are also reported.
C-AFM characterization of the dependence of HfAlOx electrical behavior on post-deposition annealing temperature
Authors: X. Blasco, J. Pétry, M. Nafría, X. Aymerich, O. Richard, W. Vandervorst
Venue: Microelectronic Engineering (2004)

The dependence of the electrical behavior of thin HfAlOx layers (5 nm) on post-deposition annealing temperature (TA) has been studied at a nanometer scale using conductive atomic force microscopy (CAFM) and high resolution transmission electron microscopy (HR-TEM). Topography, current maps and current-voltage (I-V) characteristics have been collected by CAFM. Current maps show an increase in conduction inhomogeneity for samples exposed to TA ≥ 900 °C: spots with current about one order of magnitude larger than the background region are present. The dielectric layer structure also becomes more inhomogeneous: HR-TEM images reveal that for TA ≥ 900 °C HfO2 grains appear on the HfAlOx layer, whereas for lower TA the HfAlOx layer is homogeneous. Moreover, for TA ≥ 900 °C the high-k/Si interface becomes rougher. Therefore, the increase in conduction inhomogeneity for samples annealed above 800 °C is believed to be caused by the material transition from an amorphous to a poly(nano)crystalline structure combined with the increase of the high-k/SiO2 interface roughness.
Error Reduction by Parallel Repetition&#x2014;A Negative Result
Authors: Uriel Feige, Oleg Verbitsky
Venue: Combinatorica (2002)

We show that no &#xfb01;xed number of parallel repetitions su&#xfb03;ces in order to reduce the error in two-prover one-round proof systems from one constant to another. Our results imply that the recent bounds proven by Ran Raz, showing that the number of rounds that suffice is inversely proportional to the answer length, are nearly best possible.
An extension to on-line multiplication lower bound results
Authors: David R. Cheriton
Venue: ACM SIGACT News (1974)

The improved lower bound result of Fischer et al. <2> is extended to a larger class of machines, namely from uniform BAM's to "simple" BAM's.