ppxscal/embedding_network huggingface dataset:
TCP Connection Game: A Study on the Selfish Behavior of TCP Users
Authors: Honggang Zhang, Don Towsley, Weibo Gong
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

We present a game-theoretic study of the selfish behavior of TCP users when they are allowed to use multiple concurrent TCP connections so as to maximize their goodputs or other utility functions. We refer to this as the TCP connection game. A central question we ask is whether there is a Nash Equilibrium in such a game, and if it exists, whether the network operates efficiently at such a Nash Equilibrium. Combined with the well known PFTK TCP Model [12], we study this question for three utility functions that differ in how they capture user behavior. The bad news is that the loss of efficiency or price of anarchy can be arbitrarily large if users have no resource limitations and are not socially responsible. The good news is that, if either of these two factors is considered, efficiency loss is bounded. This may partly explain why there will be no congestion collapse if many users use multiple connections.
A 14b 100-MS/s Time-Interleaved A/D Converter
Authors: Väinö Hakkarainen, Mikko Aho, Lauri Sumanen, Mikko Waltari, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (2006)

This article presents a 14-bit, 100-MS/s time-interleaved pipeline ADC, which samples input signal from 210-MHz IF-band. Digital self-calibration is employed to compensate gain mismatch and offset between time-interleaved channels as well as mismatches arise from a single ADC channel. A timing skew-insensitive parallel S/H circuit is utilized in order to avoid timing skew between parallel ADC channels. The ADC, fabricated in a 0.35-¿m BiCMOS (SiGe) takes an area of 10.2 mm2, reaches an ENOB of 11.4 bits with a 79.9-dB SFDR at 192.5-MHz input and draws 1.4 W from a 3.0-V supply.
Large-Scale First-Principles Molecular Dynamics simulations on the BlueGene/L Platform using the Qbox code
Authors: Francois Gygi, Robert K. Yates, Juergen Lorenz, Erik W. Draeger, Franz Franchetti, Christoph W. Ueberhuber, Bronis R. de Supinski, Stefan Kral, John A. Gunnels, James C. Sexton
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We demonstrate that the Qbox code supports unprecedented large-scale First-Principles Molecular Dynamics (FPMD) applications on the BlueGene/L supercomputer. Qbox is an FPMD implementation specifically designed for large-scale parallel platforms such as BlueGene/L. Strong scaling tests for a Materials Science application show an 86% scaling efficiency between 1024 and 32,768 CPUs. Measurements of performance by means of hardware counters show that 36% of the peak FPU performance can be attained.
Comparing rankings of search results on the web
Authors: Judit Bar-Ilan
Venue: Information Processing and Management: an International Journal (2005)

The Web has become an information source for professional data gathering. Because of the vast amounts of information on almost all topics, one cannot systematically go over the whole set of results, and therefore must rely on the ordering of the results by the search engine. It is well known that search engines on the Web have low overlap in terms of coverage. In this study we measure how similar are the rankings of search engines on the overlapping results.We compare rankings of results for identical queries retrieved from several search engines. The method is based only on the set of URLs that appear in the answer sets of the engines being compared. For comparing the similarity of rankings of two search engines, the Spearman correlation coefficient is computed. When comparing more than two sets Kendall's W is used. These are well-known measures and the statistical significance of the results can be computed. The methods are demonstrated on a set of 15 queries that were submitted to four large Web search engines. The findings indicate that the large public search engines on the Web employ considerably different ranking algorithms.
An MDA-Oriented .NET Metamodel
Authors: Jamal Abd-Ali, Karim El Guemhioui
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

As an intermediate step within a larger endeavor aiming at the definition of automatic transformations between two widespread technologies, namely EJB and .Net Components, we propose and discuss a metamodel for the .Net platform that captures the appropriate modeling concepts required for the definition and automatic generation of .Net PSMs from (legacy) J2EE PSMs.
Low-cost distributed learning of a Gaussian mixture model for multimedia content-based indexing on a peer-to-peer network
Authors: A. Nikseresht, M. Gelgon
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

This work deals with estimation of a probability density, which is a common issue in multimedia pattern recognition. The originality comes from its computation in a distributed manner, since the study is motivated by the perspective of a multimedia indexing and retrieval peer-to-peer system over the internet. In a decentralized fashion, algorithms and data from various contributors would cooperate towards a collective statistical learning.In this setting, aggregation of probabilistic Gaussian mixture models of the same class, but estimated on several nodes on different data sets, is a typical need, which we address herein. The proposed approach for fusion only requires moderate computation at each node and little data to transit between nodes. Both properties are obtained by aggregating models via their (few) parameters, rather than via multimedia data itself. Mixture models are in fact concatenated, then reduced to a suitable number of Gaussian components. A modification on Kullback divergence leads to an iterative scheme for estimating this aggregated model. We provide experimental results on a speaker recognition task with real data, in a gossip propagation setting.
The Role of Information Systems within Corporate Strategy and Management Policies: New Challenges
Authors: Jean-Pierre Corniou
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Until now, IT engineers, and particularly project teams working to tight deadlines, have felt that they are little more than IT masons, with no clear overall vision of what they are on. Today they have to become bona fide architects, which take time. It is also necessary to federate - within a department in charge of IT landscaping and functional architecture - the IT architecture skills which will define the overall corporate model and ensure interoperability between information systems. This high-level team then constructs a global vision, and guarantees coherence between the various system components through direct involvement in making important, formative decisions such as drawing up benchmark reference systems and defining projects.
MASIM: a process-oriented simulation language and its implementation via a macroprocessor
Authors: Hans Auer, Ulrike Maschtera
Venue: ACM SIGSIM Simulation Digest (1985)

In this paper a process-oriented simulation language and its implementation via the macroprocessor MORTRAN (in Fortran IV) are described. The advantages of the presented language are its modular structure, data typing and its problemoriented simulation operations. The essential point of the implementation was to show, in what an easy way a process-oriented language including modern software concepts can be implemented in "old and wide-spread" Fortran.
Proposal of a method for protecting private information in user context
Authors: Yuichi NAKATANI, Tetsuro TOKUNAGA, Hitoshi YAMAGUCHI, Tadashi ITOH
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

In a ubiquitous computing environment, people can obtain and transmit information anytime, anywhere. In this situation, a user's context plays a key role. Unfortunately, the ubiquitous environment introduces some problems. The first is ease of access to what users truly want. The second important problem is handling private information. In utilizing a ubiquitous environment, all of a user's context is held online, and applications may share them to propose advanced services. Therefore, a user's context is automatically transmitted or attached as metadata. The context, however, includes the user's private information. Therefore, we need a system that separates information into private and public elements and treats them differently. In view of this, we consider how to attach metadata and how to extract and protect transmitted private information, in the specific case of blog entries. We propose a method of protecting private information that expands the existing item definition format in the CaTaC platform. This method will support the establishment of new communication methods using blogs in the near future.
Fuzzy based resource management framework for high throughput computing
Authors: K. P. Kumar, A. Agarwal, R. Krishnan
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

We suggest a fuzzy based scheduling policy, which not only considers the distributed ownerships and heterogeneous environments but also handles the dynamic state of the cluster (load etc) more effectively. The algorithm aims at finding the best schedule for the combined set of jobs using fuzzy logic. Two fuzzy membership functions, resource fuzzy set and priority fuzzy set, are computed based on each job's requirements against each available node and user priority and are combined using a convex combination of fuzzy numbers to arrive at a final fuzzy value. This value indicates the extent to which the job can be executed on the given node. The result, of this formulates a score matrix, which is converted to a cost matrix and solved for minimum cost using the Hungarian approach of assignment. One of the important factors in this approach is that of deciding weights for the resources. We argue that the weights for each resource cannot be static. We propose a pairwise comparison of all resources to arrive at the weights for each resource for each job. This framework we feel is highly scalable and adapts to dynamic changes in the cluster. Unlike the other approaches, which primarily address the issue of locating a resource that matches the jobs' requirements, this method addresses the issue of performance/throughput of the cluster also.
Early versus late fusion in semantic video analysis
Authors: Cees G. M. Snoek, Marcel Worring, Arnold W. M. Smeulders
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Semantic analysis of multimodal video aims to index segments of interest at a conceptual level. In reaching this goal, it requires an analysis of several information streams. At some point in the analysis these streams need to be fused. In this paper, we consider two classes of fusion schemes, namely early fusion and late fusion. The former fuses modalities in feature space, the latter fuses modalities in semantic space. We show by experiment on 184 hours of broadcast video data and for 20 semantic concepts, that late fusion tends to give slightly better performance for most concepts. However, for those concepts where early fusion performs better the difference is more significant.
The Pentium Chronicles: Introduction
Authors: Robert P. Colwell
Venue: Computer (2006)

An excerpt from The Pentium Chronicles: The People, Passion, and Politics Behind the Landmark Chips (Wiley-IEEE Computer Society Press, 2006) offers a project manager's firsthand account of the technical and management challenges facing the team that conceived Intel's P6 microarchitecture--the most successful general-purpose processor ever created.
A Finite Difference Scheme for Option Pricing in Jump Diffusion and Exponential L&eacute;vy Models
Authors: Rama Cont, Ekaterina Voltchkova
Venue: SIAM Journal on Numerical Analysis (2005)

We present a finite difference method for solving parabolic partial integro-differential equations with possibly singular kernels which arise in option pricing theory when the random evolution of the underlying asset is driven by a L&eacute;vy process or, more generally, a time-inhomogeneous jump-diffusion process. We discuss localization to a finite domain and provide an estimate for the localization error under an integrability condition on the L&eacute;vy measure. We propose an explicit-implicit finite difference scheme which can be used to price European and barrier options in such models. We study stability and convergence of the scheme proposed and, under additional conditions, provide estimates on the rate of convergence. Numerical tests are performed with smooth and nonsmooth initial conditions.
On the application of partial evaluation to the optimisation of cardiac electrophysiological simulations
Authors: Jonathan Cooper, Steve McKeever, Alan Garny
Venue: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (2006)

Simulating the human heart is a challenging problem, with simulations being very time consuming---some can take days to compute even on high performance computing resources. There is considerable interest in optimisation techniques, with a view to making whole-heart simulations tractable. Reliability of heart model simulations is also of great concern, particularly considering clinical applications. Simulation software should be easily testable (against empirical data) and maintainable, which is often not the case with extensively hand-optimised software. Automating any optimisations will greatly improve this situation. This paper presents a framework for automatically optimising cardiac ionic cell models. An abstract format for such models, CellML [9], has been developed at Auckland University and is gaining in popularity. We utilise this format and investigate robust transformations of models that lead to reduced simulation times. In particular, we demonstrate that partial evaluation [13] is a promising technique for this purpose, and that it combines well with a lookup table technique, commonly used in cardiac modelling, which we have automated. In our tests, the technique of partial evaluation gives a speedup of 1.2 times. Further, applying such transformations prior to the lookup table optimisation results in additional speedups from the latter technique. When both optimisations are used we obtain nearly a 5-fold speedup, compared with a speedup of 1.7 times when lookup tables alone are used.
Analysis of computer algebra system tutorials using cognitive load theory
Authors: Vicky Kouba
Venue:  (2005)

Most research in the area of Computer Algebra Systems (CAS) has been designed to compare the effectiveness of instructional technology to traditional lecture-based formats. While results are promising, research also indicates evidence of the steep learning curve imposed by the technology. Yet, no studies have been conducted to investigate this critical issue. This study used Cognitive Load Theory to design and compare three types of CAS tutorials, investigating the split attention and redundancy hypotheses. To test the split attention hypothesis, two groups (both using the computer during training) were compared. One group used a traditional (split-source) manual, while the other group used an integrated manual. Contrary to predictions based on Cognitive Load Theory, there were no significant differences in performance between the two groups. To test the redundancy hypothesis, two groups (both using the integrated manual) were compared. One group used the computer in conjunction with the manual, while the other used the manual alone. Results did not demonstrate the redundancy effect, as there were no significant differences in performance between groups. Qualitative data obtained from observation and post-interviews are integrated throughout and prove helpful in explaining these discrepancies. A significant interaction was found between math ability and treatment, indicating that the tutorial using the integrated manual without the computer was only beneficial to higher ability learners.
Path Vector Face Routing: Geographic Routing with Local Face Information
Authors: Ben Leong, Sayan Mitra, Barbara Liskov
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined notion of "faces". In this paper, we demonstrate that we can improve routing performance by storing a small amount of local face information at each node. We present a protocol, Path Vector Exchange (PVEX), that maintains local face information at each node efficiently, and a new geographic routing algorithm, Greedy Path Vector Face Routing (GPVFR), that achieves better routing performance in terms of both path stretch and hop stretch than existing geographic routing algorithms by exploiting available local face information. Our simulations demonstrate that GPVFR/PVEX achieves significantly reduced path and hop stretch than Greedy Perimeter Stateless Routing (GPSR) and somewhat better performance than Greedy Other Adaptive Face Routing (GOAFR+) over a wide range of network topologies. The cost of this improved performance is a small amount of additional storage, and the bandwidth required for our algorithm is comparable to GPSR and GOAFR+ in quasi-static networks.
Using simulation in health manpower planning
Authors: Charles R. Standridge
Venue: ACM SIGSIM Simulation Digest (1979)

This paper discusses the development of a health manpower planning model for the primary health care system of Indiana. The model developed was a GASP IV based simulation model. In the course of this research, several other issues were found to be as important as model building. These included data acquisition, analysis, and management, definition of system performance measures and the development of a team effort including physicians and systems analysts. Moreover, strengths and weaknesses of using a simulation approach in the analysis of the health manpower system became apparent as the research progressed.
On Methods to Improve Location Based Logic Diagnosis
Authors: Wei Zou, Wu-Tung Cheng, Sudharkar M. Reddy, Huaxing Tang
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The general flow of location based logic diagnosis begins with finding a set of locations which can explain one or more Single Location at-a Time (SLAT) failing patterns [16], then a heuristic method is used to find subsets of locations which can explain all the SLAT failing patterns are determined as the results of logic diagnosis. However, since the observed test fails may correspond to logic failures from multiple locations, the existing heuristics may find incomplete or wrong locations of the defect due to the ignorance of the correlation between the logic failure locations and the defect. In this work, we first propose several techniques to analyze the relationship of logic failure locations and collapse multiple logic failure locations into single defects, and then use a minimum set covering algorithm to find final diagnosis candidates. In this way, we can not only identify defect type but also improve diagnosis accuracy and resolution. Experimental results on both simulated defects and silicon defects are given to demonstrate effectiveness of the proposed method.
An automatic data generating system for data base simulation and testing
Authors: Norman R. Lyons
Venue: ACM SIGSIM Simulation Digest (1977)

It would seem in this age where much is heard of the "information explosion," the last thing the world needs is an automatic system for the generation of data. And yet, there are many instances in management systems design where such a system is very useful.
Address-Value Delta (AVD) Prediction: Increasing the Effectiveness of Runahead Execution by Exploiting Regular Memory Allocation Patterns
Authors: Onur Mutlu, Hyesoon Kim, Yale N. Patt
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

While runahead execution is effective at parallelizing independent long-latency cache misses, it is unable to parallelize dependent long-latency cache misses. To overcome this limitation, this paper proposes a novel technique, address-value delta (AVD) prediction. An AVD predictor keeps track of the address (pointer) load instructions for which the arithmetic difference (i.e., delta) between the effective address and the data value is stable. If such a load instruction incurs a long-latency cache miss during runahead execution, its data value is predicted by subtracting the stable delta from its effective address. This prediction enables the pre-execution of dependent instructions, including load instructions that incur long-latency cache misses. We describe how, why, and for what kind of loads AVD prediction works and evaluate the design tradeoffs in an implementable AVD predictor. Our analysis shows that stable AVDs exist because of patterns in the way data structures are allocated in memory. Our results show that augmenting a runahead processor with a simple, 16-entry AVD predictor improves the average execution time of a set of pointer-intensive applications by 12.1%.
Angle-resolved XPS study on chemical bonds in ultrathin silicon oxynitride films
Authors: S. Shinagawa, H. Nohira, T. Ikuta, M. Hori, M. Kase, T. Hattori
Venue: Microelectronic Engineering (2005)

It was found by applying maximum entropy concept to angle-resolved Si 2p and N 1s photoelectron spectra that the distribution of nitrogen atoms and their bonding configurations in oxynitride films formed by nitridation of silicon oxide in nitrogen plasma followed by annealing is quite different from those in oxynitride films formed by nitridation of silicon oxide in NO ambient. Here, the nearest neighbors of silicon and nitrogen atoms determined from the deconvolution of Si 2p and N 1s spectra were considered.
A Method for Evaluating Uncertainties in the Early Development Phases of Embedded Real-Time Systems
Authors: Jakob Axelsson
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In the early phases of embedded real-time systems development, design decisions are made with large consequences on the quality of the resulting product. At the same time, only limited information is available about key attributes, which makes it difficult to get correct decisions. In this paper, it is studied how to include uncertainty in the information in early phases and to handle the risks involved. Using Monte Carlo simulation, the uncertainties are evaluated based on estimations of basic parameters. The technique is applied to schedulability analysis, and it is shown that the results can be counter-intuitive, and thus that current design practice can lead to higher risk than assumed by the designers.