ppxscal/embedding_network huggingface dataset:
Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities
Authors: Jie Tao, Wolfgang Karl
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the side of programmers or compilers with code level optimization or at system level through appropriate schemes, like reconfigurable cache organization and adequate prefetching or replacement strategies. For the former users need to know the problem, the reason, and the solution, while for the latter a platform is required for evaluating proposed and novel approaches.As existing simulation systems do not provide such information and platforms, we implemented a cache simulator that models the complete cache hierarchy and associated techniques. More specifically, it analyzes the feature of cache miss and provides information about the runtime accesses to data structures and the cache access behavior. Together with a visualization tool, this information enables the user to detect access hotspots and optimization strategies for tackling them. For supporting the study of different techniques with respect to cache configuration and management, this simulator models a variety of cache line replacement and prefetching policies, and allows the user to specify any cache organization, including cache size, cache set size, block size, and associativity. The simulator hence forms a research platform for investigating the influence of these techniques on the execution behavior of applications.
Discovering mappings in hierarchical data from multiple sources using the inherent structure
Authors: K. Sel&#x00e7;uk Candan, Jong Wook Kim, Huan Liu, Reshma Suvarna
Venue: Knowledge and Information Systems (2006)

Unprecedented amounts of media data are publicly accessible. However, it is increasingly difficult to integrate relevant media from multiple and diverse sources for effective applications. The functioning of a multimodal integration system requires metadata, such as ontologies, that describe media resources and media components. Such metadata are generally application-dependent and this can cause difficulties when media needs to be shared across application domains. There is a need for a mechanism that can relate the common and uncommon terms and media components. In this paper, we develop an algorithm to mine and automatically discover mappings in hierarchical media data, metadata, and ontologies, using the structural information inherent in these types of data. We evaluate the performance of this algorithm for various parameters using both synthetic and real-world data collections and show that the structure-based mining of relationships provides high degrees of precision.
Charge injection spectroscopy of Alq3 thin films deposited on bare and LiF-modified metal substrates
Authors: Toshihisa Anazawa, Mineharu Tsukada, Yuji Kataoka
Venue: Microelectronic Engineering (2005)

The local electronic properties of an electron-transfer material Alq"3 [tris(8-quinolinolate) aluminium] at the electrode interface of various metals, including base metal aluminium, were investigated using charge injection spectroscopy. We found that electron (hole) polaron energies vary strongly from one measured point to the other, but their energy distribution curves have significant peaks. We also found that the peak energy values changed, depending on the metal work functions. In addition, researchers think that the polaron energies at metal interfaces are lower than those in bulk. LiF-modified electrodes were also examined. On examination, we found that the electron polaron energies at the interface substantially decrease as the LiF thickness increases in the region of
Generalized model for scheduling in MIMO multiple access systems: a cross-layer approach
Authors: Marc Realp, Ana I. Pérez-Neira
Venue: Signal Processing (2006)

Research on scheduling in MIMO multiple access systems is traditionally carried out from an information-theoretic point of view. Such information-theoretic approaches are feasible in homogeneous systems where, although channel fading is assumed, all terminals use the same modulation format, channel coding scheme, data transmission rate, packet lengths and no traffic issues are considered. In these systems, to select the set of terminals that maximize the instantaneous sum capacity leads to the highest system throughput. Unfortunately, in heterogeneous systems this assumption is not always true. Consequently, there is a need to evaluate the effects of such heterogeneity from a network point of view. In this paper, following a cross-layer approach, a generalized model for scheduling in MIMO multiple access is presented. Such model allows to evaluate the effects of heterogeneity on system throughput. Particularly, this generalized model accommodates any kind of heterogeneity from multiuser diversity due to channel fading to heterogeneity due to different data transmission rates. Different scheduling policies are analyzed under this generalized model and further applied to a sensor network. The results obtained are useful to achieve practical insight of such scheduling policies.
2005 Special Issue: Emotion recognition in human-computer interaction
Authors: N. Fragopanagos, J. G. Taylor
Venue: Neural Networks (2005)

In this paper, we outline the approach we have developed to construct an emotion-recognising system. It is based on guidance from psychological studies of emotion, as well as from the nature of emotion in its interaction with attention. A neural network architecture is constructed to be able to handle the fusion of different modalities (facial features, prosody and lexical content in speech). Results from the network are given and their implications discussed, as are implications for future direction for the research.
Finding maximum (in modulus) complex-conjugate eigenvalues of arbitrarily high dimension
Authors: Yu. I. Titarenko
Venue: Cybernetics and Systems Analysis (2006)

Algorithms of determining maximum (in modulus) complex-conjugate eigenvalues are considered as applied to finding eigenvalues of high-dimension matrices according to the Khilenko method. An advantage of the algorithms is that the amount of calculation does not increase exponentially with the dimension of matrices.
Developing federation object models using ontologies
Authors: Tarun Rathnam, Christiaan J. J. Paredis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The reuse of existing simulations in multiple federations is an important goal of distributed simulation frameworks. However, in order to reuse a federate, its simulation code often has to be modified so as to comply with the object and interaction representations defined in a corresponding Federation Object Model (FOM). Such modifications imply added time and effort, which diminishes the efficacy of reuse in federation development. In this paper, we present an ontology-based framework for modeling federates and supporting their reuse in multiple federations. Ontologies are used to specify the semantics of objects and interactions in federate domains in a formal, computer-sensible fashion. Using these formal semantics the relationships between federate simulation concepts are described in a reusable fashion. In doing so, a suitable federation representation for a set of related federate concepts and the required set of transformations between federate and federation representations are automatically derived.
SVC Coded Video Streaming over DCCP
Authors: Burak Gorkemli, M. Reha Civanlar
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The Datagram Congestion Control Protocol (DCCP) is designed to be a replacement for the User Datagram Protocol (UDP) that is used for media delivery, with Congestion Control Identifier 3 (CCID3) tailored for video streaming applications. In this paper, we investigate the methods of streaming video, which is coded with the Scalable Video Coding (SVC) extension of H.264/AVC, over the Transmission Control Protocol (TCP) and DCCP (using CCID3), and try to come up with a solution such that the quality of the received video is maximized while both the number and the length of buffering events are minimized.
A reality check for tone-mapping operators
Authors: Michael Ashikhmin, Jay Goyal
Venue: ACM Transactions on Applied Perception (TAP) (2006)

A large number of high-quality tone-mapping operators is currently available. In addition to inherent practical value, comparing their performance is necessary to further advance the field and can provide better understanding of visual realism. In this paper, we show that it becomes very difficult to meaningfully judge relative performance of modern tone-mapping techniques with existing comparison methods and demonstrate that using real environments is crucial in such experiments. We report results of a new study comparing five recent tone-mapping techniques using this approach.
A Language and Algorithm for Automatic Merging of Ontologies
Authors: Alma Delia Cuevas Rasgado, Adolfo Arenas Guzman
Venue: Proceedings of the 15th International Conference on Computing (2006)

Nowadays, most of the important information resources that the people require are available through the Internet. The use of several sources in the Internet requires merging the information into a knowledge base in a reasonable way. We will use an ontology, an information technology that manages this knowledge in computers. Merging is an important task and many languages and tools have been developed to describe and process Internet content but the current languages (DAML+OIL, RDF, OWL, etc.) lack a complete expressiveness. For this reason, we present two important improvements to facilitate knowledge interchange: 1) The OM (Ontology Merging) Notation that provides substantial improvements to these languages and 2) The OM Algorithm, this is totally automatic in comparison with others (Prompt, Chimaera, OntoMerge, FCA-Merge, IF-Map and ISI) where the user manually solves the most important problems found in the merging.
Simulate Grid Resource Trading via Cognitive Agent: A Case Study
Authors: Yuhui Qiu, Zhixing Huang
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

In this paper, we explore the market-based grid resource trading system from the social perspective and the collaborative computing perspective. We firstly introduce a novel framework to simulate the trading system of the grid computing resources, then we give a case study based on this framework. In the case study, an evolutionary dynamics of the resource reservation game is played by agents on the network. We study the evolution of the system with cognitive agents: Study the evolution dynamics of system with agents can automatic adapt to their environment, they can exchange private information and learn experiences from each other. Finally, after analyzing the experiment results, some critical issues about designing the market-based trading system are discussed.
An analysis of P3P-enabled web sites among top-20 search results
Authors: Serge Egelman, Lorrie Faith Cranor, Abdur Chowdhury
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Search engines play an important role in helping users find desired content. With the increasing deployment of computer-readable privacy policies encoded using the standard W3C Platform for Privacy Preferences (P3P) format, search engines also have the potential to help users identify web sites that will respect their privacy needs. We conducted a study of the quantity and quality of P3P-encoded privacy policies associated with top-20 search results from three popular search engines. We built a P3P-enabled search engine and used it to gather statistics on P3P adoption as well as the privacy landscape of the Internet as a whole. This search engine makes use of a privacy policy cache that we designed to facilitate fast searches. Using a list of "typical" search terms taken from AOL users' queries, we examined the trends in privacy policies that are returned from queries to the AOL, Google, and Yahoo! search engines. We then compared these results to results compiled after using "e-commerce search terms" from Google's Froogle service. We examined the top 20 search results returned by each search engine for each of the search terms and found at least one result with a P3P policy for 83% of the typical search terms. Overall we found that these typical search terms yielded P3P adoption rates of 10%. This contrasts with adoption rates of 21% percent when searching for e-commerce terms. Examining the content of the policies, we discovered that a minority of sites engage in direct marketing with or without a way of opting out, and that even fewer sites share personal information with other companies. Finally, we outline ways to increase P3P adoption rates as well as decrease policy errors.
Implementation and Evaluation of Teaching an Introductory Software Engineering Course Framed in Cognitive Apprenticeship
Authors: Shen-Tzay Huang, Yi-Pei Cho, Yu-Jen Lin
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Within the ADDIE instruction design model, this paper reports the implementation phase and the evaluation phase of teaching introductory software engineering course framed in the Cognitive Apprenticeship approach. Twelve learning objectives are classified in a 2D Bloom framework and evaluated against the result of instructional implementation, demonstrating coherent linkage between objectives, instruction and assessment. Descriptive statistics show the coverage of Cognitive Apprenticeship and high degree of acceptance from students. Analysis of learning process profile also shows consistently expanding effects on various aspects of learners, especially on teamwork. Pedagogical improvement in terms of the time allocated to individual instruction activities is also polled.
COTS Evaluation using modified TOPSIS and ANP
Authors: Huan-Jyh Shyur
Venue: Applied Mathematics and Computation (2006)

This paper models the COTS evaluation problem as an MCDM problem and proposes a five-phase COTS selection model, combining the technique of ANP (analytic network process) and modified TOPSIS (technique for order performance by similarity to idea solution). This article discusses using the ANP to determine the relative weights of multiple evaluation criteria. The modified TOPSIS approach is used to rank competing products in terms of their overall performance. To illustrate how the approach is used for the COTS evaluation problem, an empirical study of a real case is conducted. The case study demonstrates the effectiveness and feasibility of the proposed evaluation procedure.
Robust On-Chip Communication
Authors: Pradip Bose
Venue: IEEE Micro (2006)

The balance between computation and communication is a fundamental issue in application performance. As the chip industry gets entrenched in multicore architectures, this issue will become particularly and progressively important--not only in terms of chip-level performance, but also in terms of power, temperature, and reliability. Reliable communication is essential to overall computational robustness.
Take Your Mobile Device Out from behind the Requirements Desk
Authors: Norbert Seyff, Paul Grunbacher, Neil Maiden
Venue: IEEE Software (2006)

Mobile computing devices are ubiquitous, and most wireless devices can connect to the Internet. This means that requirements analysts can capture requirements anywhere and anytime using mobile devices. Although most practitioners don't usually think to do so, such devices have many interesting applications and uses.
Promoting learning in informal learning environments
Authors: Tamara Clegg, Christina Gardner, Oriana Williams, Janet Kolodner
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Learners need to see the relevance of their learning in their everyday lives and activities in order to understand and value the importance of learning. To do this, they need rich experiences that promote such learning and mental model building. So how can we promote substantial learning in everyday, informal environments from real world practices and experiments? Museum learning and some after-school environments have addressed this issue, but in many cases, the learning can only go but so far. This paper seeks to explore how we can promote learning in these environments that can be transferred to other places and experiences. Kitchen Science Investigators (KSI) is a research endeavor, aimed at creating an after-school environment where elementary and middle school children learn from everyday experiences. This paper tells the story of the learning that occurred in this environment, pointing out activities and artifacts that worked well at both motivating and promoting learning.
Tightening the Bounds on Feasible Preemption Points
Authors: Harini Ramaprasad, Frank Mueller
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timing predictability of single real-time tasks has been the focus of much research, bounding the overhead of cache warm-ups after preemptions remains a challenging problem, particularly for data caches. This paper makes multiple contributions. 1) We bound the penalty of cache interference for real-time tasks by providing accurate predictions of data cache behavior across preemptions, including instruction cache and pipeline effects. We show that, when considering cache preemption, the critical instant does not occur upon simultaneous release of all tasks. 2) We develop analysis methods to calculate upper bounds on the number of possible preemption points for each job of a task. To make these bounds tight, we consider the entire range between the best-case and worst-case execution times (BCET and WCET) of higher priority jobs. The effects of cache interference are integrated into the WCET calculations by using a feedback mechanism to interact with a static timing analyzer. Significant improvements in tightening bounds of up to an order of magnitude over two prior methods and up to half a magnitude over a third prior method are obtained by experiments for (a) the number of preemptions, (b) the WCET and (c) the response time of a task. Overall, this work contributes by calculating the worst-case preemption delay under consideration of data caches.
Wavelets for density matrix computation in electronic structure calculation
Authors: Reinhold Schneider, Toralf Weber
Venue: Applied Numerical Mathematics (2006)

This paper is concerned with demanding calculations of electronic structures. We give a brief introduction to the basics of electronic structure calculation based on the electronic multi-particle Schrödinger equation. We describe the structures of Hartree-Fock, Kohn-Sham and hybrid models for closed shell systems, the aufbau principle and the self consistent field iteration. While traditional methods for computing the orbitals are scaling cubically w.r.t, the number of electrons, the computation of the density matrix offers the opportunity to achieve linear complexity. We describe several iteration schemes for the computation of the density matrix. We briefly present the concept of best n-term approximation and summarize recent regularity results obtained by the authors. They show that the density matrix is in mixed Besov spaces Bτ, τs. Adaptive sparse grid approximation will reduce the complexity by several magnitudes. We propose fast methods for matrix computations as e.g. wavelet matrix compression. Finally, first numerical experiments demonstrate the behavior of the described iteration schemes for computing the density matrix.
A Dependable Outbound Bandwidth Based Approach for Peer to Peer Media Streaming
Authors: Zheng-Yi Huang, Sheng-De Wang
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

A fundamental problem in peer-to-peer streaming is how to select peers with desired media data so that the best possible streaming quality can be maintained. In this paper, we propose an outbound bandwidth based streaming model in which peers are layered according to their offered outbound bandwidth and are permitted to request data of peers from upper layers peers only. Based on the layered approach, a media data assignment algorithm for the subset of media data is presented to select qualified sending peers to ensure that they will be received before their scheduled playback time. We also present two resolutions for request conflicts, which arise when there are more than one peer simultaneously requesting data from the same sending peer that can't afford outbound bandwidth for all requests. We evaluated the proposed streaming model through simulations. Experimental results show that streaming quality of the proposed streaming model is excellent and the properties of scalability as well as robustness are obtained even in a highly dynamic environment where peers join and leave frequently.
From local to global temporal logics over Mazurkiewicz traces
Authors: Volker Diekert, Paul Gastin
Venue: Theoretical Computer Science (2006)

We review some results on global and local temporal logic on Mazurkiewicz traces. Our main contribution is to show how to derive the expressive completeness of global temporal logic with respect to first-order logic [V. Diekert, P. Gastin, LTL is expressively complete for Mazurkiewicz traces, J. Comput. System Sci. 64 (2002) 396-418] from the similar result on local temporal logic [V. Diekert, P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, in: M. Farach-Colton (Ed.), Proc. LATIN'04, Lecture Notes in Computer Science, Vol. 2976, Springer, Berlin, 2004, pp. 232-241, Full version available as Research Report LSV-05-22, Laboratoire Spécification et Vérification, ENS Cachan, France].
Process modelling: the deontic way
Authors: Vineet Padmanabhan, Guido Governatori, Shazia Sadiq, Robert Colomb, Antonino Rotolo
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

Current enterprise systems rely heavily on the modelling and enactment of business processes. One of the key criteria for a business process is to represent not just the behaviours of the participants but also how the contractual relationships among them evolve over the course of an interaction. In this paper we provide a framework in which one can define policies/ business rules using deontic assignments to represent the contractual relationships. To achieve this end we use a combination of deontic/ normative concepts like proclamation, directed obligation and direct action to account for a deontic theory of commitment which in turn can be used to model business processes in their organisational settings. In this way we view a business process as a social interaction process for the purpose of doing business. Further, we show how to extend the i* framework, a well known organisational modelling technique, so as to accommodate our notion of deontic dependency.