ppxscal/embedding_network huggingface dataset:
Performance evaluation of exclusive cache hierarchies
Authors: Ying Zheng, B. T. Davis, M. Jordan
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Memory hierarchy performance, specifically cache memory capacity, is a constraining factor in the performance of modern computers. This paper presents the results of two-level cache memory simulations and examines the impact of exclusive caching on system performance. Exclusive caching enables higher capacity with the same cache area by eliminating redundant copies. The experiments presented compare an exclusive cache hierarchy with an inclusive cache hierarchy utilizing similar L1 and L2 parameters. Experiments indicate that significant performance advantages can be gained for some benchmark through the use of an exclusive organization. The performance differences are illustrated using the L2 cache misses and execution time metrics. The most significant improvement shown is a 16% reduction in execution time, with an average reduction of 8% for the smallest cache configuration tested. With equal size victim buffer and victim cache for exclusive and inclusive cache hierarchies respectively, some benchmarks show increased execution time for exclusive caches because a victim cache can reduce conflict misses significantly while a victim buffer can introduce worst-case penalties. Considering the inconsistent performance improvement, the increased complexity of an exclusive cache hierarchy needs to be justified based upon the specifics of the application and system.
Simulation output analysis based on excursions
Authors: James M. Calvin
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We consider the steady state output analysis problem for a process that satisfies a functional central limit theorem. We construct asymptotically valid confidence intervals for the steady-state mean using normalized excursions of the simulated process. An alternative approach splits the output at the last zero crossing of the normalized path. The methods use a bounded memory of size determined by the user.
Process management for federal agencies
Authors: Ed Stephan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This case study examines the variation in the key attributes of discrete event simulation when dynamic modeling is applied to a variety of business processes within the Federal Civil Government. The key simulation attributes that will be compared and contrasted include: the rate of arrival of work entities, the degree to which work is subdivided, the frequency with which work is batched, activity duration, the degree of correlation between successive work entity arrivals, and perspectives on simulation results. The business process application areas examined include personnel recruitment, help desk operation, call center operation, logistics, image capture, and image processing.
Experimental and numerical investigation of shock response in 3.5 and 2.5&#x00a0;in. form factor hard disk drives
Authors: Aravind N. Murthy, Bert Feliss, Donald Gillis, Frank E. Talke
Venue: Microsystem Technologies (2006)

The shock performance of the head/disk interface (HDI) of 3.5 and 2.5&#x00a0;in. hard disk drives (HDDs) is investigated. The displacement of the actuator arm, the suspension, and the disk due to linear shock loads is studied experimentally for both non-operating and operating states of the disk drive. A finite element model of the disk drive was developed to simulate the shock response. Numerical simulation results and experimental results are compared and presented.
ReStore: Symptom-Based Soft Error Detection in Microprocessors
Authors: Nicholas J. Wang, Sanjay J. Patel
Venue: IEEE Transactions on Dependable and Secure Computing (2006)

Device scaling and large-scale integration have led to growing concerns about soft errors in microprocessors. To date, in all but the most demanding applications, implementing parity and ECC for caches and other large, regular SRAM structures have been sufficient to stem the growing soft error tide. This will not be the case for long and questions remain as to the best way to detect and recover from soft errors in the remainder of the processor—in particular, the less structured execution core. In this work, we propose the ReStore architecture, which leverages existing performance enhancing checkpointing hardware to recover from soft error events in a low cost fashion. Error detection in the ReStore architecture is novel: symptoms that hint at the presence of soft errors trigger restoration of a previous checkpoint. Example symptoms include exceptions, control flow misspeculations, and cache or translation look-aside buffer misses. Compared to conventional soft error detection via full replication, the ReStore framework incurs little overhead, but sacrifices some amount of error coverage. These attributes make it an ideal means to provide very cost effective error coverage for processor applications that can tolerate a nonzero, but small, soft error failure rate. Our evaluation of an example ReStore implementation exhibits a 2x increase in MTBF (mean time between failures) over a standard pipeline with minimal hardware and performance overheads. The MTBF increases by 20x if ReStore is coupled with protection for certain particularly vulnerable pipeline structures.
Distributed medium access control for wireless mesh networks: Research Articles
Authors: Ho Ting Cheng, Hai Jiang, Weihua Zhuang
Venue: Wireless Communications Mobile Computing (2006)

Wireless mesh networking is an emerging technology for future broadband wireless access. The ad hoc manner of wireless mesh networks (WMNs) determines that distributed medium access control (MAC) protocols are desired. Multimedia traffic with heterogeneous quality of service (QoS) requirements is expected to be supported in small-, medium-, and large-scale WMNs. Wireless mesh routers in WMNs are located in fixed sites with low (or no) mobility and no power constraints, thus comprising a robust and reliable wireless mesh backbone. Different networking characteristics between the mesh backbone and various mesh client networks give rise to the demand of heterogeneous MAC design. Due to new design purposes and new networking structures, existing MAC protocols designed for mobile ad hoc networks may not be effective or efficient for multi-purpose WMNs. This paper provides an overview of distributed MAC protocols based on their underlying design objectives and methodology, discusses their features and suitability for WMNs, and identifies potential challenges and open research issues. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Organizational Petri Nets for protocol design and enactment
Authors: Stéphanie Combettes, Chihab Hanachi, Christophe Sibertin-Blanc
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

To integrate protocols in real organizations, we need to take into account three complementary dimensions: the protocols behavior, the structure and deontic aspects of the organization being considered and its informational model. Basic Petri Nets (PN) are known to deal suitably with the behavioral aspect while some high level extensions are intended to take into account one of the additional dimensions. This paper proposes a formalism called Organizational Petri nets to capture these three dimensions in a coherent framework. We give the definition of this new formalism, precise its semantics and illustrate its use through an example.
The Video Conferencing Learning Environment in Distance Education: A Study of the Interaction Pattern
Authors: Omar Majid, Zuraidah A. Rahman, Noraida A. Ghani, Saw Kim Guan, Rozhan M. Idrus, Hanafi Atan
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This article reports on the study undertaken to elucidate the pattern of interactions in the Video Conferencing Learning Environment (VCLE) used as a course delivery mechanism in distance learning. The study involved transcribing the recorded course delivery sessions conducted in the VCLE for three undergraduate Physics courses. The model of interaction used in this study was based on the Oliver & McLoughlin [5] interaction model consisting of five interactive dimensions, namely, the social, procedural, expository, explanatory and cognitive dimensions across five combinations of dialogue exchanges between teachers, students and the class as a whole. The results revealed that there were high frequencies of two-way exchanges between teachers and students in the expository, explanatory and cognitive interactive dimensions. The implication of these findings in terms of the quality of knowledge construction and high level student understanding of the course contents will be discussed and elaborated.
Adapting the geometry of a sensor subarray
Authors: H. Alnajjar, D. M. Wilkes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors present an algorithm for adapting the size and geometry of a subarray (of a much larger array) to optimize the detection and resolution performance of the subarray. This allows the efficient and accurate use of high resolution direction of arrival (DOA) estimation algorithms. The two source case is analyzed in detail and a critical distance definition is developed that plays a major role in analyzing the resolution performance of an array. A simple procedure is presented for designing a planar array yielding high resolution performance.
Palmprint Recognition Based on 2-Dimension PCA
Authors: Junwei Tao, Wei Jiang, Zan Gao, Shuang Chen, Chao Wang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

PCA (principal component analysis) is a successful feature detection method for pattern recognition. It is the optimal dimension compression technique based on second-order information, in the sense of mean-square error. It deals with image vector whose dimension is usually high. 2DPCA is a novel PCA method for image matrix, and it can calculate the covariance matrix more precise. In this paper we combined the new 2DPCA method and PCA to palmprint recognition, and first we apply 2DPCA to the image matrix and we make an improvement in the selection of principal components. We select the principal component that is better for classification. Then we apply 1DPCA to the projected vectors for dimension reduction. At last we apply the method to PolyU Palmprint Database. The experiment result shows that our method got more recognition rate with lower dimensions.
Beyond essentialist critiques: the co-development of individual and society within Erik Erikson's psychosocial theory of identity development
Authors: Sage Rose, Cecil Robinson
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Erikson's psychosocial theory is often positioned as essentialist, creating the groundwork for criticisms about the resolution of crises as a universal aspect of identity development towards a unified and coherent Self. These critiques represent an oversimplification of Erikson's theory and overlook the centrality of the co-development of the individual and society within his theory of identity development. To justify this claim, we examine Erikson's concepts of ego identity (1959, 1968), and demonstrate overlap with Holland, Lachicotte, Skinner, and Cain's 'figured worlds' framework (1998). The purpose of these comparisons is to problematize essentialist critiques of Erikson and create a dialogic space for socio-cultural researchers to consider Erikson's psychosocial theory of identity formation when exploring relationships between identity, agency, power and cultural worlds of practice.
Sharing and presenting multimedia and context information within online communities using mobile terminals
Authors: H. Keranen, T. Rantakokko, J. Mantyjarvi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Online communities enabled by mobile communication have needs for sharing experiences and common interests in a context sensitive manner. However, due to the current division of creation, delivery and access functionality of multimedia to applications, much user effort is needed to communicate efficiently. This paper presents an approach for a user interface for mobile terminals to present and share multimedia with context information within an online community. The approach utilizes a map-based interface and domain object model-based user interface technique to present multimedia objects and the context of community members. We show with a user scenario that our user interface approach enhances the ability of online communities to share experiences and common interests in the form of multimedia with context information.
Extension of Bernstein polynomials to infinite dimensional case
Authors: Lorenzo D'Ambrosio
Venue: Journal of Approximation Theory (2006)

The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are modelled on classical Bernstein polynomials and represent a possible extension to an infinite dimensional setting.The same idea is generalized to obtain from a given approximation process for function defined on a real interval a new approximation process for vector-valued mappings defined on subsets of a real Hilbert space.
Boundary Extraction in Natural Images Using Ultrametric Contour Maps
Authors: Pablo Arbelaez
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a low-level system for boundary extraction and segmentation of natural images and the evaluation of its performance. We study the problem in the framework of hierarchical classification, where the geometric structure of an image can be represented by an ultrametric contour map, the soft boundary image associated to a family of nested segmentations. We define generic ultrametric distances by integrating local contour cues along the regions boundaries and combining this information with region attributes. Then, we evaluate quantitatively our results with respect to ground-truth segmentation data, proving that our system outperforms significantly two widely used hierarchical segmentation techniques, as well as the state of the art in local edge detection.
Stability Index Method for Global Minimization
Authors: James Dover, Semion Gutman
Venue: Journal of Global Optimization (2006)

The Stability Index Method (SIM) combines stochastic and deterministic algorithms to find global minima of multidimensional functions. The functions may be nonsmooth and may have multiple local minima. The method examines the change of the diameters of the minimizing sets for its stopping criterion. At first, the algorithm uses the uniform random distribution in the admissible set. Then normal random distributions of decreasing variation are used to focus on probable global minimizers. To test the method, it is applied to seven standard test functions of several variables. The computational results show that the SIM is efficient, reliable and robust.
Measures on the unit circle and unitary truncations of unitary operators
Authors: M. J. Cantero, L. Moral, L. Velázquez
Venue: Journal of Approximation Theory (2006)

In this paper, we obtain new results about the orthogonality measure of orthogonal polynomials on the unit circle, through the study of unitary truncations of the corresponding unitary multiplication operator, and the use of the five-diagonal representation of this operator.Unitary truncations on subspaces with finite co-dimension give information about the derived set of the support of the measure under very general assumptions for the related Schur parameters (an). Among other cases, we study the derived set of the support of the measure when limn|an+1/an| = 1, obtaining a natural generalization of the known result for the López class limnan+1/an ∈ T, limn|an| ∈ (0,1).On the other hand, unitary truncations on subspaces with finite dimension provide sequences of unitary five-diagonal matrices whose spectra asymptotically approach the support of the measure. This answers a conjecture of L. Golinskii concerning the relation between the support of the measure and the strong limit points of the zeros of the para-orthogonal polynomials.Finally, we use the previous results to discuss the domain of convergence of rational approximants of Carathéodory functions, including the convergence on the unit circle.
TIDL: mixed presence groupware support for legacy and custom applications
Authors: Peter Hutterer, Benjamin S. Close, Bruce H. Thomas
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

In this paper, we present a framework to use an arbitrary number of mouse and keyboard input devices controlling Swing based Java applications. These devices can be distributed amongst any number of host computers on a network. We use this framework to provide independent input devices to a number of users on different host computers. These users can then work collaboratively on applications.A major limitation for current real-time groupware is that contemporary graphic environments do not support more than one system cursor and keyboard. The Transparent Input Device Layer (TIDL) is a framework we have developed that provides an easy-to-use API for Java applications to gain support for multiple independent input devices. We have also created a wrapper application to retrofit legacy applications with support for multiple distributed input devices at runtime. This support can be injected without altering or recompiling the application's source code. TIDL allows multiple devices to work across window and application boundaries. Applications supporting multiple input devices can employ features such as simultaneous drag-and-drop and the entry of text in multiple textboxes. In addition, different applications running simultaneously can use multi-device support independently and at the same time. We present four applications that use TIDL to enable distributed groups to work collaboratively. One of these applications has been developed to make active use of TIDL, the other three applications are applications we have found on the web and gain support for multiple independent devices through the wrapper application.
A note on the Dwork-Naor timed deniable authentication
Authors: Yunlei Zhao
Venue: Information Processing Letters (2006)

In this paper, we present an improved Dwork-Naor 2-round timed deniable authentication scheme with reduced computational and communication complexity. The improved protocol is convenient for authenticating arbitrarily large files (e.g., the contents of a large data-base or a large software), and its first message (from the verifier to the authenticator) is independent on the message to be authenticated by the authenticator.
Comparison of the Data-based and Gene Ontology-Based Approaches to Cluster Validation Methods for Gene Microarrays
Authors: Nadia Bolshakova, Anton Zamolotskikh, Padraig Cunningham
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The paper presents a comparison of the data-based and Gene Ontology (GO)-based approaches to cluster validation methods for gene microarray analysis. We apply a homogeneous approach to obtaining metrics from different GO-based similarity measures and a normalization of validation index values, that allows us to compare them to each other as well as to databased validation indices. The results show strong correlation between both GO-based and data-based validation indices. The results suggest that this may represent an effective tool to support biomedical knowledge discovery tasks based on gene expression data.
A platform-independent distributed runtime for standard multithreaded Java
Authors: Michael Factor, Assaf Schuster, Konstantin Shagin
Venue: International Journal of Parallel Programming (2006)

JavaSplit is a portable runtime environment for distributed execution of standard multithreaded Java programs. It gains augmented computational power and increased memory capacity by distributing the threads and objects of an application among the available machines. Unlike previous works, which either forfeit Java portability by using a nonstandard Java Virtual Machine (JVM) or compromise transparency by requiring user intervention in making the application suitable for distributed execution, JavaSplit automatically executes standard multithreaded Java on any heterogenous collection of Java-enabled machines. Each machine carries out its part of the computation using nothing but its local standard (unmodified) JVM. Neither the programmer nor the person submitting the program for execution needs to be aware of JavaSplit or its distributed nature. We evaluate the efficiency of JavaSplit on several combinations of operating systems, JVM implementations, and communication hardware.
The Case of Multi-hop Peer-to-Peer Implementation of Mobile Social Applications
Authors: Panayotis Antoniadis, Costas Courcoubetis
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In this paper we consider issues related to the design of mobile social software in a multi-hop peer-to-peer environment. We believe that by enabling multi-hop peer-topeer communication could in certain cases make social mobile applications more attractive in terms of location privacy or embarassement, but also more effective in terms of the quality and quantity of the matches achieved. Such an approach could thus contribute in the construction of a critical mass which is necessary for the success of these applications and probably one of the reasons they are not yet widely deployed. On the other hand, it introduces significant implemention challenges related to the contruction and management of a dynamic ad-hoc network. We focus on the provision of the suitable incentives for packet forwarding which is a fundamental problem that needs to be addressed in this context since the ad-hoc nature of the mobile social applications constitutes pricing and reputation (or accounting) based approaches of limited applicability. In this paper we argue that suitable memory-less mechanisms should be devised sketching two such mechanisms for different types of packets exchanged in a mobile social application. Interestingly, as we explain, our proposed mechanisms enforcing contribution while consuming have a more general applicability and could also be used in other applications such as the peer-to-peer resource sharing in ubiquitous computing. We finally discuss several strategic issues that should be also taken into account but are ignored by the corresponding literature and more specifically the consideration of mobility and power transimission as part of the rational strategy of peers participaing in such a system.