ppxscal/embedding_network huggingface dataset:
The Inca Test Harness and Reporting Framework
Authors: Shava Smallen, Catherine Olschanowsky, Kate Ericson, Pete Beckman, Jennifer M. Schopf
Venue: Proceedings of the 2004 ACM/IEEE conference on Supercomputing (2004)

Virtual organizations (VOs), communities that enable coordinated resource sharing among multiple sites, are becoming more prevalent in the high-performance computing community. In order to promote cross-site resource usability, most VOs prepare service agreements that include a minimum set of common resource functionality, starting with a common software stack and evolving into more complicated service and interoperability agreements. VO service agreements are often difficult to verify and maintain, however, because the sites are dynamic and autonomous. Automatedverification of service agreements is critical: manual and user tests are not practical on a large scale. The Inca test harness and reporting framework is a generic system for the automated testing, data collection, verification, and monitoring of service agreements. This paper describes Incaýs architecture, system impact, and performance. Inca is being used by the TeraGrid project to verify software installations, monitor service availability, and collect performance data.
A New Architecture for Managing Enterprise Log Data
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Server systems invariably write detailed activity logs whose value is widespread, whether measuring marketing campaigns, detecting operational trends or catching fraud or intrusion. Unfortunately, production volumes overwhelm the capacity and manageability of traditional data management systems, such as relational databases. Just loading 1,000,000 records is a big deal today, to say nothing of the billions of records often seen in high-end network security, network operations and web applications. Since the magnitude of the problem is scaling with increases in CPU and networking speeds, it doesn't help to wait for faster systems to catch up.This paper discusses the issues involving large-scale log management, and describes a new type of data management platform called a Log Management System, which is specifically designed to cost effectively compress, manage and analyze log records in their original, unsummarized form. To quote Tom Lehrer, "I have a modest example here" - in this case commercial software that can store and process logs in parallel across a cluster of Linux-based PCs using a combination of SQL and perl. The paper concludes with some lessons we learned in building the system.
USER TESTING A PROGRAMMING LANGUAGE: EXPERIENCE AND METHODOLOGY
Authors: Adriane Donkers, Marta Arnaldo, Richard Dillon, Jo Tombaugh
Venue: ACM SIGCHI Bulletin (1991)

Members of the Computer User Research and Evaluation Laboratory at Carleton University conducted usability tests during development of a 4th generation database programming language. Although the basic usability testing approach can be applied to the development of a programming language, there are several methodological issues that require careful consideration when user testing a language. The issues are outlined below.
A Fibre-Optic AWG-Based Real-Time Network and Its Applicability to High-Performance Embedded Computing
Authors: Annette Bohm, Magnus Jonsson, Kristina Kunert, Hoai Hoang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

In this paper, an architecture and a Medium Access Control (MAC) protocol for a multi-wavelength optical communication network, applicable in short range communication systems like System Area Networks (SANs), are proposed. The main focus lies on guaranteed support for hard and soft real-time traffic. The network is based upon a single-hop star topology with an Arrayed Waveguide Grating (AWG) at its center. Traffic scheduling is centralized in one node (residing together with the AWG in a hub), which communicates through a physical control channel. The AWG's property of spatial wavelength reuse and the combination of fixed-tuned and tunable transceivers in the nodes enable simultaneous control and data transmission. A case study with defined real-time communication requirements in the field of Radar Signal Processing (RSP) was carried out and indicates that the proposed system is very suitable for this kind of application.
Educating software engineers: an industry viewpoint
Authors: Donald J. Reifer
Venue: ACM SIGSOFT Software Engineering Notes (2005)

When Peter Henderson asked me to comment on the software engineering curricula proposed by the IEEE and ACM Joint Task Force1, I was thrilled. I thought the idea of academics asking for industry input to be strikingly original. I then dug into the proposed curriculum to determine if it would help prepare those from academia entering the software engineering workforce with the skills, knowledge and abilities they need to build quality software products on-time and within budget. Software engineers in most industrial organizations are problem solvers who perform difficult tasks like interfacing with users, developing requirements, specifying interfaces, performing design tradeoffs, developing algorithms and testing and evaluating products. They must be able to communicate with others from associated engineering disciplines, like communications and systems engineering, and work as members of interdisciplinary teams.
On Flow Marking Attacks in Wireless Anonymous Communication Networks
Authors: Xinwen Fu, Ye Zhu, Bryan Graham, Riccardo Bettati, Wei Zhao
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

This paper studies the degradation of anonymity in a flow-based wireless mix network under flow marking attacks, in which an adversary embeds a recognizable pattern of marks into wireless traffic flows by electromagnetic interference. We find that traditional mix technologies are not effective in defeating flow marking attacks, and it may take an adversary only a few seconds to recognize the communication relationship between hosts by tracking suchartificial marks. Flow marking attacks utilize frequency domain analytical techniques and convert time domain marks into invariant feature frequencies. To counter flow marking attacks, we propose a new countermeasure based on digital filtering technology, and show that this filter-based counter-measure can effectively defend a wireless mix network from flow marking attacks.
Effective Bandwidth-Based QoS Provisioning for Real-Time Audio/Video Streaming over MIMO-OFDM Wireless Networks
Authors: Jia Tang, Xi Zhang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We propose a cross-layer design scheme to support the real-time quality of service (QoS) guarantees for heterogeneous mobile users over downlink MIMO-OFDM wireless networks. Inspired by the effective bandwidth theory originally established for wired networks, we develop the approach to apply the theory into wireless networks. Based on MIMO-OFDM infrastructure employed at the physical (PHY)-layer, we analytically derive the medium access control (MAC)-layer admission-control and time-slot allocation algorithms to guarantee the statistical delay-bound for different real-time users. Simulation results show that the proposed scheme can efficiently support the wireless QoS requirement for diverse real-time mobile users.
A data streaming algorithm for estimating subpopulation flow size distribution
Authors: Abhishek Kumar, Minho Sung, Jun (Jim) Xu, Ellen W. Zegura
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands, detect traffic anomalies, and improve network performance through traffic engineering. Previous work on estimating the flow size distribution for the complete population of flows has produced techniques that either make inferences from sampled network traffic, or use data streaming approaches. In this work, we identify and solve a more challenging problem of estimating the size distribution and other statistical information about arbitrary subpopulations of flows. Inferring subpopulation flow statistics is more challenging than the complete population counterpart, since subpopulations of interest are often specified a posteriori (i.e., after the data collection is done), making it impossible for the data collection module to "plan in advance".Our solution consists of a novel mechanism that combines data streaming with traditional packet sampling to provide highly accurate estimates of subpopulation flow statistics. The algorithm employs two data collection modules operating in parallel --- a NetFlow-like packet sampler and a streaming data structure made up of an array of counters. Combining the data collected by these two modules, our estimation algorithm uses a statistical estimation procedure that correlates and decodes the outputs (observations) from both data collection modules to obtain flow statistics for any arbitrary subpopulation. Evaluations of this algorithm on real-world Internet traffic traces demonstrate its high measurement accuracy.
Glasses Removal from Facial Image Using Recursive Error Compensation
Authors: Jeong-Seon Park, You Hwa Oh, Sang Chul Ahn, Seong-Whan Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

In this paper, we propose a new method of removing glasses from a human frontal facial image. We first detect the regions occluded by the glasses and generate a natural looking facial image without glasses by recursive error compensation using PCA reconstruction. The resulting image has no trace of the glasses frame or of the reflection and shade caused by the glasses. The experimental results show that the proposed method provides an effective solution to the problem of glasses occlusion and we believe that this method can also be used to enhance the performance of face recognition systems.
Data Centric Cache Measurement on the Intel ltanium 2 Processor
Authors: Bryan R. Buck, Jeffrey K. Hollingsworth
Venue: Proceedings of the 2004 ACM/IEEE conference on Supercomputing (2004)

Processor speed continues to increase faster than the speed of access to main memory, making effective use of memory caches more important. Information about an applicationýs interaction with the cache is therefore critical to performance tuning. To be most useful, tools that measure this information should relate it to the source code level data structures in an application. We describe how to gather such information by using hardware performance counters to sample cache miss addresses, and present a new tool named Cache Scope that does this using the Intel Itanium 2 performance monitors. We present experimental results concerning Cache Scopeýs accuracy and perturbation of cache behavior. We also describe a case study of using Cache Scope to tune two applications, achieving 24% and 19% reductions in running time.
The geometric error for homographies
Authors: Ondřej Chum, Tomáš Pajdla, Peter Sturm
Venue: Computer Vision and Image Understanding (2005)

We address the problem of finding optimal point correspondences between images related by a homography: given a homography and a pair of matching points, determine a pair of points that are exactly consistent with the homography and that minimize the geometric distance to the given points. This problem is tightly linked to the triangulation problem, i.e., the optimal 3D reconstruction of points from image pairs. Our problem is non-linear and iterative optimization methods may fall into local minima. In this paper, we show how the problem can be reduced to the solution of a polynomial of degree eight in a single variable, which can be computed numerically. Local minima are thus explicitly modeled and can be avoided. An application where this method significantly improves reconstruction accuracy is discussed. Besides the general case of homographies, we also examine the case of affine transformations, and closely study the relationships between the geometric error and the commonly used Sampson's error, its first order approximation. Experimental results comparing the geometric error with its approximation by Sampson's error are presented.
Double Arrays, Triple Arrays and Balanced Grids
Authors: John P. McSorley, N. C. Phillips, W. D. Wallis, J. L. Yucas
Venue: Designs, Codes and Cryptography (2005)

Triple arrays are a class of designs introduced by Agrawal in 1966 for two-way elimination of heterogeneity in experiments. In this paper we investigate their existence and their connection to other classes of designs, including balanced incomplete block designs and balanced grids.
Gatekeeper: Monitoring Auto-Start Extensibility Points (ASEPs) for Spyware Management
Authors: Yi-Min Wang, Roussi Roussev, Chad Verbowski, Aaron Johnson, Ming-Wei Wu, Yennun Huang, Sy-Yen Kuo
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Spyware is a rapidly spreading problem for PC users causing significant impact on system stability and privacy concerns. It attaches to extensibility points in the system to ensure the spyware will be instantiated when the system starts. Users may willingly install free versions of software containing spyware as an alternative to paying for it. Traditional anti-virus techniques are less effective in this scenario because they lack the context to decide if the spyware should be removed.In this paper, we introduce Auto-Start Extensibility Points (ASEPs) as the key concept for modeling the spyware problem. By monitoring and grouping "hooking" operations made to the ASEPs, our Gatekeeper solution complements the traditional signature-based approach and provides a comprehensive framework for spyware management. We present ASEP hooking statistics for 120 real-world spyware programs. We also describe several techniques for discovering new ASEPs to further enhance the effectiveness of our solution.
Evaluation of rule interestingness measures with a clinical dataset on hepatitis
Authors: Miho Ohsaki, Shinya Kitaguchi, Kazuya Okamoto, Hideto Yokoi, Takahira Yamaguchi
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

This research empirically investigates the performance of conventional rule interestingness measures and discusses their practicality for supporting KDD through human-system interaction in medical domain. We compared the evaluation results by a medical expert and those by selected measures for the rules discovered from a dataset on hepatitis. Recall, Jaccard, Kappa, CST, X2-M, and Peculiarity demonstrated the highest performance, and many measures showed a complementary trend under our experimental conditions. These results indicate that some measures can predict really interesting rules at a certain level and that their combinational use will be useful.
A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks
Authors: Alireza Hodjat, David D. Hwang, Ingrid Verbauwhede
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois Field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois Field of GF(2^n) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]×(n/3) clock cycles. For the case of GF(2^{163}) the point multiplication delay is 165888 clock cycles.
Field-Programmable Analog Filters Array with Applications for Fuzzy Inference Systems
Authors: Silviu Ionita, Emil Sofron
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Encouraged by the recent progress in the FPAA technology, we propose a flexible membership functions synthesis method based on the configurable filter blocks. Based on the actual paradigm of FPAA we consider an interesting and promising idea to implement the membership functions using the frequency-response curves of the analog filters. The other specific functional blocks can be implemented with programmable analog structures obtaining a complete unit for fuzzy inference processing.
A privacy-sensitive approach to distributed clustering
Authors: Srujana Merugu, Joydeep Ghosh
Venue: Pattern Recognition Letters (2005)

While data mining algorithms are often designed to operate on centralized data, in practice data is often acquired and stored in a distributed manner. Centralization of such data before analysis may not be desirable, and often not possible due to a variety of real-life constraints such as security, privacy and communication costs. This paper presents a general framework for distributed clustering that takes into account privacy requirements. It is based on building probabilistic models of the data at each local site, whose parameters are then transmitted to a central location. We mathematically show that the best representative of all the local models is a certain ''mean'' model, and empirically show that this model can be approximated quite well by generating artificial samples from the local models using sampling techniques, and then fitting a global model of a chosen parametric form to these samples. We also propose a new measure that quantifies privacy based on information theoretic concepts, and show that decreasing privacy improves the quality of the global model and vice versa. Empirical results are provided on different kinds of data to highlight the generality of our framework. The results show that high quality global clusters can be achieved with little loss of privacy.
Comparative performance analysis of mobile runtimes on Intel XScale&reg; technology
Authors: Jason Domer, Murthi Nanja, Suresh Srinivas, Bhaktha Keshavachar
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

Mobile Runtime Environments such as Java*2 Micro Edition (J2ME*) and Microsoft WinCE.NET* Compact Framework* are becoming standard managed application execution environments on memory constrained devices. A variety of implementations exists, and so too are a variety of systems they could run on, and finally a variety of workloads. It becomes important to understand how they compare.In this paper we describe comparative performance analysis of mobile runtimes on products with Intel XScale&reg; micro-architecture. We were interested in a number of comparisons. These include CLDC vs. CDC workloads, Interpreters vs. JIT compilers, and J2ME vs. Native applications. In addition we compare runtimes when memory subsystem improves and MHz varies.We find that when comparing how mobile runtimes utilize the underlying micro-architecture, multiple implementations have similar stall analysis. We find that JIT (Just-In-Time) compilers are about 4-6 times faster than interpreters. For a class of applications we measured, J2ME apps were about two times slower than their C counterparts. We find that memory subsystem improvements have minor impact on interpreters but have much more impact on JIT compilers.
Society of neurons: an arts/science project
Authors: Warren Neidich, Robert Zimmer, Thibaud de Souza
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This artwork is one of the deliverables of an arts/science initiative supported by an interdisciplinary program run by Arts Council England and the Arts and Humanities Research Board of the UK. The artwork has two forms: one is a dynamically changing website and the other is a series of three-dimensional sculptures, each of which records a segment of history of the website. The website itself---which we think of as a web brain---evolves using principles that model those that are posited as the processes that happen in brains as they learn. The website evolution is informed by interaction with a large community of users and therefore acts as a collective memory of a society of individuals.
How to Deal with the VRPTW by using Multi-Agent Coalitions
Authors: Imen Boudali, Wajdi Fki, Khaled Ghedira
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The Vehicle Routing Problem with Time Windows (VRPTW) is a well known combinatorial optimization problem often met in many fields of industrial applications. We are interested in a coalition based multi-agent model (Coal-VRP) for the VRPTW. However, this model presents some drawbacks due to its spatial and temporal complexity. In order to overcome these drawbacks while maintaining the solution quality, we propose in this paper a new version of this model called DyCoal-VRP. It is essentially based on dynamic generation of coalitions. An experimental validation of our model is achieved on the base of Solomon's benchmark.
An Autonomous Pricing Strategy toward Market Economy in Computational Grids
Authors: Yang Jin, Yang Shoubao, Li Maosheng, Fu Qianfei
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

One of the key steps in economy based grid resource allocation is to make reasonable prices for the grid resources. For resources' prices decide the resource flow in the Grid, further influence Grid resources' trading efficiency. This article, instead of discussing the pricing algorithm, argues an autonomous pricing mechanism that leaves the prices to be decided by the Grid traders within their trading process. We firstly point out the factors that influence the resources' prices; then make out the trading flow for resource consumer agents and provider agents. By doing these, the two trading agents can decide their price due to the dynamic changes of the Grid environment without any manmade interferences. Since price is the core of market economy, the autonomous pricing strategy provides us with a foundation to use the invisible hand of market to allocate the Grid resource.
CGI-based applications for distributed embedded systems for monitoring temperature and humidity
Authors: Grisha Spasov, Nikolay Kakanakov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper discusses the using of Common Gateway Interface in developing web-based distributed embedded systems. It shows the tree-layer model in developing client-server applications. An example using a BECK microcontroller SC12 in application for monitoring temperature and relative humidity in rooms with controlled microclimate is shown. SC12 is a system-on-chip with embedded RTOS, TCP/IP stack and CGI software.