ppxscal/embedding_network huggingface dataset:
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results
Authors: Kurt Stockinger, Kesheng Wu, Scott Campbell, Stephen Lau, Mike Fisk, Eugene Gavrilov, Alex Kent, Christopher E. Davis, Rick Olinger, Rob Young, Jim Prewett, Paul Weber, Thomas P. Caudell, E. Wes Bethel, Steve Smith
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Our analytics task is to identify, characterize, and visualize anomalous subsets of as large of a collection of network connection data as possible. We use a combination of HPC resources, advanced algorithms, and visualization techniques. To effectively and efficiently identify the salient portions of the data, we rely on a multistage workflow that includes data acquisition, summarization (feature extraction), novelty detection, and classification. Once these subsets of interest have been identified and automatically characterized, we use a stateof- the-art high-dimensional query system to extract this data for interactive visualization. Our approach is equally useful for other large-data analysis problems where it is more practical to identify interesting subsets of the data for visualization than it is to render all data elements. By reducing the size of the rendering workload, we enable highly interactive and useful visualizations.
Bagging with Adaptive Costs
Authors: Yi Zhang, W. Nick Street
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Ensemble methods have proved to be highly effective in improving the performance of base learners under most circumstances. In this paper, we propose a new algorithm that combines the merits of some existing techniques, namely bagging, arcing and stacking. The basic structure of the algorithm resembles bagging, using a linear support vector machine (SVM). However, the misclassification cost of each training point is repeatedly adjusted according to its observed out-of-bag vote margin. In this way, the method gains the advantage of arcing — building the classifier the ensemble needs — without fixating on potentially noisy points. Computational experiments show that this algorithm performs consistently better than bagging and arcing.
A new Mallows distance based metric for comparing clusterings
Authors: Ding Zhou, Jia Li, Hongyuan Zha
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing clustering results to tackle two issues insufficiently addressed or even overlooked by existing methods: (a) taking into account the distance between cluster representatives when assessing the similarity of clustering results; (b) constructing a unified framework for defining a distance based on either hard or soft clustering and ensuring the triangle inequality under the definition. Our measure is derived from a complete and globally optimal matching between clusters in two clustering results. It is shown that the distance is an instance of the Mallows distance---a metric between probability distributions in statistics. As a result, the defined distance inherits desirable properties from the Mallows distance. Experiments show that our clustering distance measure successfully handles cases difficult for other measures.
Reconfigurable Optical Interconnection System Supporting Concurrent Application-Specific Parallel Computing
Authors: Sacki Agelis, Magnus Jonsson
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Application specific architectures are highly desirable in embedded parallel computing systems at the same time as designers strive for using one embedded parallel computing platform for several applications. If this can be achieved the cost can be decreased in comparison to using several different embedded parallel computing systems. This paper presents a novel approach of running several high-performance applications concurrently on one single parallel computing system. By using a reconfigurable backplane interconnection system the applications can be run efficiently with high network flexibility since the interconnect network can be adapted to fit the application that is being processed for the moment. More precisely, this paper investigates how the Space Time Adaptive Processing (STAP) radar algorithm and the stripmap Synthetic Aperture Radar (SAR) algorithm can be mapped on a multi-cluster processing system with a reconfigurable optical interconnection system realized by a Micro-Optical-Electrical Mechanical System (MOEMS) crossbars. The paper describes the reconfigurable platform, the two algorithms and how they individually can be mapped on the targeted multiprocessor system. It is also described how these two applications can be mapped simultaneously on the optical reconfigurable platform. Implications and requirements on communication bandwidth and processor performance in different critical points of the two applications are presented. The results of the analysis show that an implementation is feasible with today's MOEMS technology, and that the two applications can be successfully run in a time-sharing scheme, both at the processing side and at the access for interconnection bandwidth.
A GPSS problem and solution
Authors: Theodore Brown
Venue: ACM SIGSIM Simulation Digest (1981)

One of the reasons I enjoyed Schriber's, "Simulation Using GPSS" so much when I first read it was that it contains short examples of non-trival language usage. I appreciated the way the language blocks were made use of. I felt I learned alot on how to <u>really</u> use the language. This note is written in this vain. It is based on a real modelling problem that was presented to me. In this note I have only taken those aspects of the problem that show the structure of the GPSS program that I wish to emphasis. Think about how you might solve it.
Finite Buffer Queue Analysis and Scheduling for Heavy-Tailed Traffic in Packet-SwitchingWireless Networks
Authors: Shahram Teymori, Weihua Zhuang
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Recent research based on traffic measurements shows that Internet traffic flows have a fractal nature (i.e., selfsimilarity property), which causes an underestimation of network engineering parameters when using the conventional Poisson model. Preliminary field measurements demonstrate that packet data traffic in wireless communications also exhibits self-similarity. In this paper, we investigate the queuing behavior of self-similar traffic flows for data applications in packet-switching wireless networks. The traffic is generated by an on-off source with heavytailed on periods. We extend a previous relationship among the asymptotic distribution of loss probability, finite buffer size, traffic specifications, and transmission rate for a wireline system to a wireless system, taking into account wireless propagation channel characteristics. We also investigate the multiplexing of heavy-tailed traffic flows with a fi- nite buffer for the downlink transmission of a cellular network. Computer simulation results demonstrate that assumptions made in the theoretical analysis are reasonable and the derived relationship is accurate.
Explanation-Augmented SVM: an approach to incorporating domain knowledge into SVM learning
Authors: Qiang Sun, Gerald DeJong
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We introduce a novel approach to incorporating domain knowledge into Support Vector Machines to improve their example efficiency. Domain knowledge is used in an Explanation Based Learning fashion to build justifications or explanations for why the training examples are assigned their given class labels. Explanations bias the large margin classifier through the interaction of training examples and domain knowledge. We develop a new learning algorithm for this Explanation-Augmented SVM (EA-SVM). It naturally extends to imperfect knowledge, a stumbling block to conventional EBL. Experimental results confirm desirable properties predicted by the analysis and demonstrate the approach on three domains.
Power Efficient Error Control for Bluetooth-based Sensor Networks
Authors: Joao H. Kleinschmidt, Walter C. Borelli, Marcelo E. Pellenz
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper studies different error control schemes in wireless sensor networks with Bluetooth technology. The tradeoff between reliability and energy consumption of Bluetooth packets are analyzed, using different error control techniques, such as retransmission and channel coding The AUX1 packet is utilized for custom coding and also are proposed adaptive techniques based on the number of hops of the network. The wireless channel is modeled with Rayleigh fading. The results obtained may be used as references to determine the packet type in a sensor application.
Important Aspects of Geometric Numerical Integration
Authors: Ernst Hairer
Venue: Journal of Scientific Computing (2005)

At the example of Hamiltonian differential equations, geometric properties of the flow are discussed that are only preserved by special numerical integrators (such as symplectic and/or symmetric methods). In the `non-stiff' situation the long-time behaviour of these methods is well-understood and can be explained with the help of a backward error analysis. In the highly oscillatory (`stiff') case this theory breaks down. Using a modulated Fourier expansion, much insight can be gained for methods applied to problems where the high oscillations stem from a linear part of the vector field and where only one (or a few) high frequencies are present. This paper terminates with numerical experiments at space discretizations of the sine-Gordon equation, where a whole spectrum of frequencies is present
Ensuring Preset Level of Robustness in Control Systems for Objects with the Distributed Parameters
Authors: Valery Goncharov, Vladislav Rudnicki
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The problem of sampled-data regulator synthesis of automatic control system is considered. For the decision of the problem, the Real Interpolation Method is offered. Two important procedures, which guarantee decreasing of computation costs in comparison with traditional methods, are in its basis. Firstly, a special discrete transformation of time functions is used and derivable functions-images have real argument. Secondly, these functions are replaced with discrete forms, which can describe control system, its elements and signals. The offered way of problem decision is illustrated with numerical example.
Topology Selection for Fault-Tolerant Beacon Vector Routing in Wireless Sensor Networks
Authors: Luke Demoracski, D. R. Avresky
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper presents a performance analysis comparison for different topology types that can be used with an improved fault-tolerant Beacon Vector Routing (BVR) protocol. The topology types of Mesh, Torus, FCR, and Communication Graph are compared. The performance of these topology types is analyzed using BVR and three-phase faulttolerant BVR. Performance metrics include throughput, latency, overhead, saturation points, and packet success rate in the presence of multiple node failures. Using this analysis, we recommend for the user a given topology type, depending on the desired tradeoffs for their given application.
An Electronic Commerce System Prototype and Its Implementations
Authors: Bo Meng, Huanguo Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper we introduce and develop an electronic commerce system prototype based on web technology. The electronic commerce system prototype includes merchant system, server electronic wallet, and payment gateway. The server electronic wallet supports multi-payment protocols and instruments and is secure and extensible. The payment gateway is a general payment gateway and can supports several bank payment gateway interfaces.
Loop Parallelisation for the Jikes RVM
Authors: Jisheng Zhao, Ian Rogers, Chris Kirkham, Ian Watson
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most computer programs tend to be serial in nature. This paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. The performance on a current desktop processor is slower than without parallel threads, caused by thread creation costs, but with these costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.
Design of optical networks: performance bounds, complexity and algorithms
Authors: Mohamed Elsayed Mostafa Saad
Venue:  (2005)

Optical networks that employ wavelength division multiplexing (WDM) are promising candidates for meeting the high bandwidth requirements of emerging communication applications. This thesis focuses on algorithmic and complexity issues of fundamental, but NP-hard, resource allocation problems arising in the design of multifiber WDM networks. In the routing and wavelength assignment (RWA) problem, we are given a multifiber network with limited fiber and wavelength resources, and a set of connection requests between pairs of nodes. We seek to allocate paths and wavelengths to the connection requests as to maximize the carried traffic of connections. We show that provably optimal solutions to the linear programming (LP-) relaxation of this problem can be obtained by considering only one wavelength. This leads to an upper bound on the carried traffic that scales to an arbitrarily large number of wavelengths. We also introduce a greedy algorithm that provides integer solutions guaranteed to be within a factor of (1 &minus; 1e ) of the optimal solution by considering one wavelength at a time. The adaptability to dynamically changing traffic patterns has been identified as one of the most important features of WDM networks. Given a new set of connection requests, we investigate the problem of reconfiguring the network such the carried traffic of connections is maximized while the disruption of ongoing connections and services is completely avoided. We present an algorithm that considers one wavelength at a time, provides optimal and near-optimal solutions and tends to balance loads among wavelengths. Given a combination of unprotected and dedicated edge-disjoint path (1 + 1) protected connection requests and a finite set of fiber types whose costs reflect an economy of scale, we consider the WDM network design problem of allocating fibers on the links of a multifiber WDM network with wavelength converters at minimum cost, such that all connection requests can be simultaneously routed. It is known that a solution induced by &ldquo;simply&rdquo; routing each connection along the shortest path (pair) minimizes the total wavelength mileage, but may not minimize the total fiber cost. We theoretically quantify the increase in fiber cost due to shortest path routing. In particular, we prove that the total cost of a shortest path based solution is guaranteed to lie within a certain factor of the minimum possible cost. We also demonstrate that shortest path routing is asymptotically cost-optimal in heavily loaded networks with general topologies, and in large networks with some special topologies, e.g., the ring, the ShuffleNets and the mesh(-torus). We extend most of these results to networks with no wavelength conversion and a single fiber type.
A Comprehensive Context Model for Next Generation Ubiquitous Computing Applications
Authors: Jie Sun, ZhaoHui Wu
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In recent years, there has been much research on ubiquitous computing, including context aware computing that is an important field in ubiquitous computing. The primary focus of this paper is on context modeling. We study the characteristics of context and so the requirements on the modeling. Besides, we also take into account the development requirements of next generation context-aware application. We study the context modeling approaches of some famous existing projects and find that few models meet all these requirements. In this paper, we propose a comprehensive model, which meets these requirements. We implement this model in a middleware called Scudware.
The GriddLeS Data Replication Service
Authors: Tim Ho, David Abramson
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The Grid provides infrastructure that allows an arbitrary application to be executed on a range of different computational resources. When input files are very large, or when fault tolerance is important, the data may be replicated. Existing Grid data replication middleware suffers from two shortcomings. First, it typically requires modification to existing applications. Second, there is limited support on automatic resource selection and a user usually chooses the replica manually to optimize the performance of the system. In this paper we discuss a middleware layer called the GriddLeS Replication Service (GRS) that sits above existing replication services, solving both of these shortcomings. Two case studies are presented that illustrate the effectiveness of the approach.
Performance Analysis of a Hybrid Key Establishment Protocol for Wireless Sensor Networks
Authors: Panayiotis Kotzanikolaou, Dimitrios D. Vergados, Giannis Stergiou
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Distributed Sensor Networks are becoming increasingly popular, as they can be used in a variety of applications. However, limitations arising from the sensor nodes structure, such as limitations in energy, memory and computing power require new networking techniques to be introduced. DSNs are in general more vulnerable to security threats than other wired or wireless networks. Several key establishment schemes for multiphase deployment have been presented, however such schemes are unable to provide adequate security against attacks, such as fake generation attacks. In this paper, the performance analysis of the hybrid key establishment protocol proposed by Kotzanikolaou et al. [8] for wireless sensor networks is analyzed.
The &para; key: nuisance or necessity?
Authors: Jonathan Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

I am a freelance technical writer and programmer with a long-standing interest in text processing systems. Right now I'm helping to write a phototypesetting system that will run on a large, time-shared computer. It will be used by many different kinds of people in many (its seller hopes) installations. 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
Planning with POMDPs Using a Compact, Logic-Based Representation
Authors: Chenggang Wang, Jim Schmolze
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a convenient and efficient way. Representations built on logic allow for problems to be specified in a compact and transparent manner. Moreover, decision making algorithms can assume and exploit structure found in the state space, actions, observations, and success criteria, and can solve with relative efficiency problems with large state spaces. In recent years researchers have sought to combine the benefits of logic with the expressiveness of POMDPs. In this paper, we show how to build upon and extend the results in this fusing of logic and decision theory. In particular, we present a compact representation of POMDPs and a method to update beliefs after actions and observations. The key contribution is our compact representation of belief states and of the operations used to update them. We then use heuristic search to find optimal plans that maximize expected total reward given an initial belief state.
Sign-based learning schemes for pattern classification
Authors: A. D. Anastasiadis, G. D. Magoulas, M. N. Vrahatis
Venue: Pattern Recognition Letters (2005)

This paper introduces a new class of sign-based training algorithms for neural networks that combine the sign-based updates of the Rprop algorithm with the composite nonlinear Jacobi method. The theoretical foundations of the class are described and a heuristic Rprop-based Jacobi algorithm is empirically investigated through simulation experiments in benchmark pattern classification problems. Numerical evidence shows that this new modification of the Rprop algorithm exhibits improved learning speed in all cases tested, and compares favorably against the Rprop and a recently proposed modification, the improved Rprop.
Hybrid Bitrate/PSNR Control for H.264 Video Streaming to Roaming Users
Authors: Fabio De Vito, Federico Ridolfo, Juan Carlos De Martin
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In wireless communications, the available throughput depends on several parameters, like physical layer, base station distance, fading and interference. Users experience changes in bandwidth within a cell and among same-technology cells, but also among different networks. Moreover, in case of video transmission, the user may specify a desired quality level. The source should encode the stream at a quality as close as possible to this value, without exceeding the available bitrate. We propose a technique to decide whether to encode at constant quality, if resources are enough, or at constant bitrate, if the throughput is not sufficient. With negligible complexity, it proved to obtain better PSNR/bitrate ratios, with respect to only constant bitrate and only constant PSNR coding. We also show this algorithm working in a realistic scenario of a user roaming among heterogeneous networks (WLAN and UMTS). Also in this case, the algorithm proved to achieve high quality/bitrate ratios.
Rule-based Component Development
Authors: Jeong Ah Kim, JinYoung Taek, SunMyung Hwang
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Upon component design, there is a need to define rules regarding variability discovered during the development for business applications separately in order to increase extensibility and reusability of components. Component adaptation techniques through either interface wrapping or redefinition of the implementation class carry limitations in supporting the reuse of components. Consequently, designs which take future reusability of components into consideration during the component development process are very important. Within this research, we propose ACM(Adaptable Component Model) for separating the stable and basic properties from variable properties. Also we propose new component architecture to include rule components defining the variable part. Also, reusability of components is verified through re-defining rules for application onto an insurance sales system.