ppxscal/embedding_network huggingface dataset:
Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors
Authors: Akhilesh Kumar, Laxmi N. Bhuyan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

Shared memory multiprocessors with cache require careful consideration of cache parameters while implementing an algorithm to obtain optimal performance. In this paper, we study the implementation of some existing FFT algorithms and analyze the number of cache misses based on the problem size, number of processors, cache size, and block size. We also propose a new FFT algorithm which minimizes the number of cache misses.
Specifications of a high-level conflict-free firewall policy language for multi-domain networks
Authors: Bin Zhang, Ehab Al-Shaer, Radha Jagadeesan, James Riely, Corin Pitcher
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

Multiple firewalls typically cooperate to provide security properties for a network, despite the fact that these firewalls are often spatially distributed and configured in isolation. Without a global view of the network configuration, such a system is ripe for misconfiguration, causing conflicts and major security vulnerabilities. We propose FLIP, a high-level firewall configuration policy language for traffic access control, to enforce security and ensure seamless configuration management. In FLIP, firewall security policies are defined as high-level service-oriented goals, which can be translated automatically into access control rules to be distributed to appropriate enforcement devices. FLIP guarantees that the rules generated will be conflict-free, both on individual firewall and between firewalls. We prove that the translation algorithm is both sound and complete. FLIP supports policy inheritance and customization features that enable defining a global firewall policy for large-scale enterprise network quickly and accurately. Through a case study, we argue that firewall policy management for large-scale networks is efficient and accurate using FLIP.
ITI 2000. Proceedings of the 22nd International Conference on Information Technology Interfaces (Cat. No.00EX411)
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The following topics were covered: computer systems and networks; software engineering and programming languages; information systems and databases; intelligent systems; multimedia and Internet computing; data analysis and statistics; biometrics; modelling, simulation and optimisation; mathematics and computation; design; and technical presentation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Shape Background Modeling: The Shape of Things That Came
Authors: Nathan Jacobs, Robert Pless
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Detecting, isolating, and tracking moving objects in an outdoor scene is a fundamental problem of visual surveillance. A key component of most approaches to this problem is the construction of a background model of intensity values. We propose extending background modeling to include learning a model of the expected shape of foreground objects. This paper describes our approach to shape description, shape space density estimation, and unsupervised model training. A key contribution is a description of properties of the joint distribution of object shape and image location. We show object segmentation and anomalous shape detection results on video captured from road intersections. Our results demonstrate the usefulness of building scene-specific and spatially-localized shape background models.
On secure and pseudonymous client-relationships with multiple servers
Authors: Daniel Bleichenbacher, Eran Gabber, Phillip B. Gibbons, Yossi Matias, Alain Mayer
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

This paper introduces a cryptographic engine, Janus, that assists clients in establishing and maintaining secure and pseudonymous relationships with multiple servers. The setting is such that clients reside on a particular subnet (e.g., corporate intranet, ISP) and the servers reside anywhere on the Internet. The Janus engine allows for each client-server relationship to use either weak or strong authentication on each interaction. At the same time, each interaction preserves privacy by neither revealing a client's true identity ("modulo" the subnet) nor the set of servers with which a particular client interacts. Furthermore, clients do not need any secure long-term memory, enabling scalability and mobility. The interaction model extends to allow servers to send data back to clients via e-mail at a later date. Hence, our results complement the functionality of current network anonymity tools and remailers
Uncertainty Explicit Assessment of Off-the-Shelf Software: Selection of an Optimal Diverse Pair
Authors: Ilir Gashi, Peter Popov
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Assessment of software COTS components is an essential part of component-based software development. Sub-optimal selection of components may lead to solutions with low quality. The assessment is based on incomplete knowledge about the COTS components themselves and other aspects, which may affect the choice such as the vendor's credentials, etc. We argue in favor of assessment methods in which uncertainty is explicitly represented ("uncertainty explicit' methods) using probability distributions. We have adapted a model (developed elsewhere [17]) for assessment of a pair of COTS components to take account of the fault (bug) logs that might be available for the COTS components being assessed. We also provide empirical data from a study we have conducted with off-the-shelf database servers, which illustrate the use of the method.
Mobile phone based RFID architecture for secure electronic Payments using RFID credit cards
Authors: Geethapriya Venkataramani, Srividya Gopalan
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Online shopping using electronic payment scheme has gained a lot of popularity in recent years. In an electronic payment scheme using normal credit cards there is no way to genuinely identify owner of the credit card. Credit card fraud is the fastest growing crime all over the world. Any effort to plug the security hole especially for online payment is considered worthwhile. RFID enabled credit cards are becoming increasingly popular as contactless credit cards [1]. We envision a future where RFID credit cards will be used for online shopping. RFID system has tremendous potential to render electronic payments more secure than normal credit cards. The word RFID enabled credit cards may bring in mixed passion, enthusiasm and perhaps even rage! This is partly paranoia and partly reality. The reality is that an intruder can read RFID cards without the user even noticing it. This brings in a zone of discomfort and leads to paranoia. Certain interactivity should exist to bring back this comfort to the user. This paper tries to make an effort in that direction. In this paper we propose mobile phone based architecture for secured electronic payments using RFID credit cards.
The flowchart interpreter for introductory programming courses
Authors: M. A. Perez-Quinones
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

An introductory programming course offers students problem solving analysis and design experience as well as exposure to the basic tenets of algorithmic thinking. Unfortunately, most introductory programming courses tend to concentrate on the syntax of a programming language (such as Basic, Pascal, C++, Java, etc.) at the expense of problem solving activities. The Flowchart Interpreter (FLINT) program supports problem solving activities while utilizing minimal-syntax flowcharts as visual representations of problem solving algorithms. FLINT provides the immediate feedback of an interpreted language as well as tools for simulation designed for use by novice programmers. This paper discusses the motivation for FLINT, including an analysis of the problems of typical introductory programming courses. An experimental study confirming the utility of flowcharts for introductory programming students is presented. Finally, the FLINT system is described in terms of its use by beginning programmers.
Studying Versioning Information to Understand Inheritance Hierarchy Changes
Authors: Filip Van Rysselberghe, Serge Demeyer
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

With the widespread adoption of object-oriented programming, changing the inheritance hierarchy became an inherent part of today's software maintenance activities. Unfortunately, little is known about the "state-of-thepractice" with respect to changing an application's inheritance hierarchy, and consequently we do not know how the change process can be improved. In this paper, we report on a study of the hierarchy changes stored in a versioning system to explore the answers to three research questions: (1) why are hierarchy changes made? (2) what kind of hierarchy changes are made? (3) what is the impact of these changes? Based on the results of this study, we formulate 7 hypotheses which should be investigated further to make conclusive interpretations on how hierarchy changes fit in the actual change process.
A Protocol for Macro Mobility and Multihoming Notification in Wireless Mesh Networks
Authors: Rainer Baumann, Olga Bondareva, Simon Heimlicher, Martin May
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Wireless mesh networks are cost-efficient means to provide ubiquitous Internet access. For building large-scale wireless mesh networks, multiple access networks are joined together into one large network. In such large networks, nodes have to communicate with the Internet via multiple access gateways. The problem in such scenarios is how to make mesh nodes aware of the gateway over which data is sent towards the Internet. The goal of this paper is to propose a routing protocol-independent method that allows nodes to (i) determine when they are switching the access network; (ii) to support switching of access networks; and (iii) to support multihoming.
CELP speech coding based on an adaptive pulse position codebook
Authors: T. Amada
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

CELP coders using pulse codebooks for excitations such as ACELP have the advantages of low complexity and high speech quality. At low bit rates, however, the decrease of pulse position candidates and the number of pulses degrades reconstructed speech quality. This paper describes a method for adaptively allocating of pulse position candidates. In the proposed method, N efficient candidates of pulse positions are selected out of all possible positions in a subframe. The amplitude envelope of an adaptive code vector is used for selecting N efficient candidates. The larger the amplitude is, the more pulse positions are assigned. Using an adaptive code vector for the adaptation, the proposed method requires no additional bits for the adaptation. Experimental results show that the proposed method increases WSNRseg by 0.3 dB and MOS by 0.15.
Using Autonomic Principles to Manage Converged Services in Next Generation Networks
Authors: John Strassner
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

Network resources will always be heterogeneous, and thus have different functionalities and programming models. This adversely affects interoperability. Seamless Mobility is one example of how next generation networks and devices require a new approach for network management. This letter is an abstract of my ICAC 2006 keynote, which describes how our new FOCALE architecture can be used in such an environment. This approach establishes a common "lingua franca" through the combination of information models and knowledge engineering, which together can be used to discover and program semantically similar functionality for heterogeneous devices regardless of the data and language used by each device. FOCALE is a semantically rich, contextaware, policy-based architecture for orchestrating the behavior of heterogeneous and distributed computing resources.
Marginal MAP estimation using Markov chain Monte Carlo
Authors: C. P. Robert
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Markov chain Monte Carlo (MCMC) methods are powerful simulation-based techniques for sampling from high-dimensional and/or non-standard probability distributions. These methods have recently become very popular in the statistical and signal processing communities as they allow highly complex inference problems in defection and estimation to be addressed. However, MCMC is not currently well adapted to the problem of marginal maximum a posteriori (MMAP) estimation. In this paper, we present a simple and novel MCMC strategy called state-augmentation for marginal estimation (SAME), that allows MMAP estimates to be obtained for Bayesian models. The methodology is very general and we illustrate the simplicity and utility of the approach by examples in MAP parameter estimation for hidden Markov models (HMMs) and for missing data interpolation in autoregressive time series.
A Methodology & Tool for Determining Inter-component Dependencies Dynamically in J2EE Environments
Authors: Umesh Bellur
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The emergence of server side component models such as J2EE has considerably simplified the construction of enterprise applications. However the dependence of the enterprise on these applications and their proliferation has shifted the complexity in managing the environment in which these applications operate. The difficulty in management is cheifly due to the inter-dependencies that exist between the components that make up these applications. Changing one component can have unpredictable side effects in the performance and functional behavior of other components because of this coupling. Self management or autonomic computing looks into techniques of self for self-configuration, self-healing and self protection. We believe that in order for a middleware to be self-managing, it is first necessary to obtain and maintain its topology which characterizes the components and their inter-dependencies making up this complex distributed environment. We present here a methodology and a tool to non-intrusively and dynamically extract and store the component topology from a distributed execution environment. The techniques presented in this paper have been evolved primarily for a J2EE environment although they can be applied without loss of generality to any distributed object system.
Knowledge Discovery across Documents through Concept Chain Queries
Authors: Wei Jin, Rohini K. Srihari
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper focuses on detecting links between two concepts across text documents (e.g. two persons). We interpret such a query as finding the most meaningful evidence trail across documents that connect these two concepts. Here we propose a fast and efficient algorithm to perform this task. It is based on the idea of hypothesis generation originated by Swanson called "complementary structures in disjoint literatures" (CSD). We adapted the technique by (i) developing an alternate method of generating semantic profiles and (ii) extending the technique to generate concept chains. Counterterrorism corpus is used to evaluate the performance of this approach and demonstrates the effectiveness of our algorithm.
Review of SEASTAR2000 Promoted by the COE Bangkok Office: Sea Turtles, Mekong Giant Catfish, Dugongs and Human Beings
Authors: Nobuaki Arai
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

We performed international studies at the COE Bangkok office established by the Informatics Research for Development of Knowledge Society Infrastructure in Thailand. The projects include the Southeast Asia sea turtle associative research (SEASTAR2000), the Mekong giant catfish tracking project (MCTP) and the dugong biological survey (DBS). All the species of the projects are heavily endangered and need a sufficient degree of protection. Very little is known of these species whilst the implementation of conservation measures is a pressing problem in Thailand and neighboring ASEAN countries. In these countries, the conservation policy sometimes poses some troubles because the area to be protected is also fishing ground where the local people live. We must appreciate the need for coexistence between the endangered species and the local people based on scientific knowledge.
Frequency offset estimation in OFDM systems in presence of IQ imbalance
Authors: S. Fouladifard, H. Shafiee
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The orthogonality between sub-carriers in OFDM systems is disrupted by offsets between the carrier frequencies in the transmitter and receiver, as well as by the so-called IQ mismatch in the mixers. When treated separately, effective algorithms exist for estimation and compensation of frequency offset as well as IQ imbalance. However, with both effects present, such algorithms do not lead to useful estimates of the related parameters. We propose a novel iterative technique for the estimation of the frequency offset in the presence of IQ imbalance. The proposed algorithm is tested on an OFDM communication system designed based on the specifications of IEEE 802.11a for wireless local area networks. Simulation results show that the frequency offset estimation algorithm works well even with large values of gain and phase imbalances in the receiver mixer. When an estimate of the frequency offset is obtained, and the complex baseband samples are corrected accordingly, any effective technique for the compensation of IQ imbalance can be applied.
A Bandwidth Allocation Scheme for Mobile Wireless IP Networks
Authors: T. Nyandeni, M. Adigun, J. Emuoyibofarhe, S. Sibiya
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The proliferation of wireless mobile networks has led to increasing demand for providing bandwidth guarantees to mobile users that are comparable to those received by users in the fixed networks. The constant increase of mobile users poses challenges on how to fairly and optimally distribute the limited bandwidth among the connections of different classes. This paper proposes a bandwidth allocation algorithm that reduces call blocking probability and call dropping probability. It also introduces a mechanism known as connection swapping to guarantee the availability of bandwidth to handoff calls.
myExperiment: social networking for workflow-using e-scientists
Authors: Carole Anne Goble, David Charles De Roure
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

We present the Taverna workflow workbench and argue that scientific workflow environments need a rich ecosystem of tools that support the scientists. experimental lifecycle. Workflows are scientific objects in their own right, to be exchanged and reused. myExperiment is a new initiative to create a social networking environment for workflow workers. We present the motivation for myExperiment and sketch the proposed capabilities and challenges. We argue that actively engaging with a scientist's needs, fears and reward incentives is crucial for success.
Pretenuring in Java by Object Lifetime and Reference Density Using Scratch-Pad Memory
Authors: K. F. Chong, C. Y. Ho, Anthony S. Fong
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Java has become a popular paradigm in software development. It is widely used in embedded systems and network computing because of its excellent robustness, modularity and security. Its built-in garbage collection automatically reclaims unused memory space. Current generational garbage collector works well with programs containing massive short-lived objects. However, the existence of hot-mature (i.e. frequently-accessed and long-lived) objects inhibits object reclamation. In this paper, we present two methodologies to exploit the locality for these objects. Firstly, we employ an on-chip scratchpad memory in memory hierarchy to preserve young and hot-mature objects. This reduces energy consumption and data accessing cycles for Java execution. Secondly, we introduce a pretenuring technique to segregate objects into separated memory regions based on the object lifetimes and reference densities, which minimizes the amount of object copying during garbage collections.
Motion-based Object Segmentation using Sprites and Anisotropic Diffusion
Authors: Andreas Krutz, Matthias Kunter, Thomas Sikora, Mrinal Mandal, Michael Frater
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Many algorithms have been developed to recognize regions, edges, color, and objects in images and videos. For applications like surveillance or object-based video coding, it is important to segment the foreground objects from the background. The task is very challenging in the case of a moving camera. We present a foreground segmentation approach that is designed for sprite coding as well as other applications, e.g. video surveillance. Accurate frame-toframe image registration and sprite generation build the pre-processing step. The segmentation algorithm operates on error images, which are produced by the image registration and subtraction from reconstructed background frames. It is processed in several steps including low-pass filtering using anisotropic diffusion. Experiments show excellent results with single- and multi-view test sequences.
An Adaptable Formal Model for Web Services Protocols
Authors: Pemadeep Ramsokul, Arcot Sowmya
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Agents require standard and reliable protocols to interact with service providers in order to provide high quality customer service over the web. Many useful web services protocols are coming on the market, but are often ambiguously specified by protocol designers and not fully verified. This can lead to interoperability problems among implementations of the same protocol as well as high software maintenance costs. We have recently proposed a formal hierarchical automata-based framework that aims to address these issues. In this paper, we extend our framework to overcome the two identified limitations, re-usability and adaptability, and describe how they are useful for conformance checking and for our observer-based technique for property specification. We also apply the extended framework on the WS-BusinessActivity's AtomicOutcome protocol suite and discuss our experience using the model.