ppxscal/embedding_network huggingface dataset:
SEED: scalable, efficient enforcement of dependences
Authors: Francisco J. Mesa-Martínez, Michael C. Huang, Jose Renau
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

Instruction issue logic is a critical component in modern high-performance out-of-order processors. The ever increasing latencies found in modern processors, mostly associated with memory accesses and longer pipelines, can be attenuated using large issue queues. Conventional designs rely on atomic wakeup-select cycles to ensure compact scheduling. These designs must aggressively utilize broadcasting, compaction, and heavily-ported structures that scale poorly in terms of both power consumption and access tim.To provide high scheduling flexibility and large instruction capacity without incurring prohibitive latency and energy overhead, we propose a novel scheme that uses an out-of-order, broadcast-free instruction wakeup block feeding an in-order scheduler. Multi-banked, index-based structures are used throughout this scheme to provide a high degree of scalability while achieving efficient dependence tracking, resulting in good overall performance and energy efficiency. We call this design "Scalable, Efficient Enforcement of Dependences (SEED)". We present a detailed design and analysis of SEED through an extensive evaluation. Compared to a conventional issue queue design, which is assumed favorably to scale in size without any impact on cycle time, the performance degradation of our design is 3% for both INT and FP suites of SPEC CPU2000. For such a small performance cost, SEED enjoys a 19% reduction in total chip power consumption for a 32-entry configuration. We also synthesize SEED and a conventional issue logic with 90nm standard cell logic. Synthesis results show that SEED can cycle twice the speed of a conventional issue logic of equivalent size. Cycling at the same frequency, SEED consumes ten times less dynamic power and five times less static power while achieving substantial area savings.
Putting Objects in Perspective
Authors: Derek Hoiem, Alexei A. Efros, Martial Hebert
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Image understanding requires not only individually estimating elements of the visual world but also capturing the interplay among them. In this paper, we provide a framework for placing local object detection in the context of the overall 3D scene by modeling the interdependence of objects, surface orientations, and camera viewpoint. Most object detection methods consider all scales and locations in the image as equally likely. We show that with probabilistic estimates of 3D geometry, both in terms of surfaces and world coordinates, we can put objects into perspective and model the scale and location variance in the image. Our approach reflects the cyclical nature of the problem by allowing probabilistic object hypotheses to refine geometry and vice-versa. Our framework allows painless substitution of almost any object detector and is easily extended to include other aspects of image understanding. Our results confirm the benefits of our integrated approach.
Agent-community based peer-to-peer information retrieval: an evaluation
Authors: Tsunenori Mine, Akihiro Kogo, Makoto Amamiya
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The Agent-Community-based Peer-to-Peer Information Retrieval (ACP2P) method uses agent communities to manage and look up information of interest to users. An agent works as a delegate of its user and searches for information that the user wants by communicating with other agents. The communication between agents is carried out in a peer-to-peer computing architecture. The ACP2P is implemented using the Multi-Agent Kodama framework. This paper presents how the ACP2P method works in an agent community network and show the experimental results to illustrate the validity of this approach.
FMESP: framework for the modeling and evaluation of software processes
Authors: Félix García, Mario Piattini, Francisco Ruiz, Gerardo Canfora, Corrado A. Visaggio
Venue: Proceedings of the 2004 workshop on Quantitative techniques for software agile process (2004)

Nowadays, organizations face with a very high competitiveness and for this reason they have to continuously improve their processes. Two key aspects to be considered in the software processes management in order to promote their improvement are their effective modeling and evaluation. The integrated management of these key aspects is not a trivial task: the huge number and diversity of elements to take into account makes it complex the management of software processes. To ease and effectively support this management, in this paper we propose FMESP: a framework for the integrated management of the modeling and measurement of software processes. FMESP incorporates the conceptual and technological elements necessary to ease the integrated management of the definition and evaluation of software processes. From the measurement perspective of the framework and in order to provide the support for the software process measurement at model level a set of representative metrics have been defined and validated.
IT839 Policy leading to u-Korea
Authors: Jung-Hee Song
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

With the strategic early adoption of IT infrastructure technologies such as the broadband and the CDMA wireless communication in Korea, IT industry has been the major contributor to the recent Korean economic growth, accounting for 15.8% of the real GDP in 2005.In 2004, Korean Ministry of Information and Communication has established the so-called IT839 strategy as its new IT initiative. IT839 means 8 new IT services which will be deployed within the next three to four years so that service operators invest on 3 new wireless broadband and secure communication infrastructures to offer high-quality ubiquitous service. For rich user experience, 9 hardware and software component industries are defined as the growth engine. The total twenty industry sectors of the IT839 strategy form the IT industry value chain.In 2005, Korean Ministry of Information and Communication updated its IT839 structure by replacing some of its components to explicitly address the u-Korea framework.This IT839 strategy will contribute not only to IT industry but bring qualitative changes to the economic and social paradigm. It ultimately aims to realize a ubiquitous world by forming a virtuous circle of developing new services, infrastructure, and growth engines.To sustain the current momentum, Korea must become proactive in the global collaboration. Korean Ministry of Information and Communication invests in drawing leading global IT companies into Korea for cooperation with Korea R&D partners. During the past two years, twelve global companies established local R&D laboratories in Korea with partial funding from Korean government.
Capacity of MIMO channels in the presence of co-channel interference: Research Articles
Authors: Ming Kang, Lin Yang, Mohamed-Slim Alouini
Venue: Wireless Communications Mobile Computing (2007)

This paper presents analytical results on the capacity of multiple-input-multiple-output (MIMO) fading channels in the presence of co-channel interference (CCI). We consider the scenario in which the desired and CCI users are all subject to Rayleigh fading. We assume that channel realizations of both the desired and CCI users are known at the receiver. Moreover, we consider the case where the transmitter does not have any CSI and as such equal-power allocation among transmit antennas is used. Given this setup, we derive the moment generating function (MGF) and the mean of the mutual information (MI). We then study the complementary cumulative distribution function of the MI using a Gaussian approximation. Finally, we present and discuss numerical examples to illustrate the mathematical formalism and to show the effect of various parameters on the capacity of MIMO channels in the presence of CCI. Copyright &copy; 2006 John Wiley & Sons, Ltd.This paper was presented in part in Conference Information Science and System (CISS'2003), Baltimore, MD, March 2003.
Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
Authors: D. Juedes, F. Drews, D. Gu, L. Welch, K. Ecker, S. Schomann
Venue: Real-Time Systems (2006)

This paper addresses the problem of resource allocation for distributed real-time periodic tasks, operating in environments that undergo unpredictable changes and that defy the specification of meaningful worst-case execution times. These tasks are supplied by input data originating from various environmental workload sources. Rather than using worst-case execution times (WCETs) to describe the CPU usage of the tasks, we assume here that execution profiles are given to describe the running time of the tasks in terms of the size of the input data of each workload source. The objective of resource allocation is to produce an initial allocation that is robust against fluctuations in the environmental parameters. We try to maximize the input size (workload) that can be handled by the system, and hence to delay possible (costly) reallocations as long as possible. We present an approximation algorithm based on first-fit and binary search that we call FFBS. As we show here, the first-fit algorithm produces solutions that are often close to optimal. In particular, we show analytically that FFBS is guaranteed to produce a solution that is at least 41% of optimal, asymptotically, under certain reasonable restrictions on the running times of tasks in the system. Moreover, we show that if at most 12% of the system utilization is consumed by input independent tasks (e.g., constant time tasks), then FFBS is guaranteed to produce a solution that is at least 33% of optimal, asymptotically. Moreover, we present simulations to compare FFBS approximation algorithm with a set of standard (local search) heuristics such as hill-climbing, simulated annealing, and random search. The results suggest that FFBS, in combination with other local improvement strategies, may be a reasonable approach for resource allocation in dynamic real-time systems.
Creating Affective Visualisations for a Physiologically Interactive Artwork
Authors: Lizzie Muller, Greg Turner, George Khut, Ernest Edmonds
Venue: Proceedings of the conference on Information Visualization (2006)

This paper describes an action research project based on the process of designing the visualisation of heart and breath rate data for the interactive artwork Cardiomorphologies. The project aimed to realise the affective goals of the artist as closely as possible by studying the audience experience of the visualisations and incorporating the findings into an iterative design process. The qualities of richness and ambiguity were found to contribute to the achievement of the artists' two major aims: 1) to create a sense of integrated physical and mental engagement with the work and 2) to create a reflective state in which participants consider correlations between their thoughts and specific physiological states
A numerical scheme for ionizing shock waves
Authors: Necdet Aslan, Michael Mond
Venue: Journal of Computational Physics (2005)

A two-dimensional (2D) visual computer code to solve the steady state (SS) or transient shock problems including partially ionizing plasma is presented. Since the flows considered are hypersonic and the resulting temperatures are high, the plasma is partially ionized. Hence the plasma constituents are electrons, ions and neutral atoms. It is assumed that all the above species are in thermal equilibrium, namely, that they all have the same temperature. The ionization degree is calculated from Saha equation as a function of electron density and pressure by means of a nonlinear Newton type root finding algorithms. The code utilizes a wave model and numerical fluctuation distribution (FD) scheme that runs on structured or unstructured triangular meshes. This scheme is based on evaluating the mesh averaged fluctuations arising from a number of waves and distributing them to the nodes of these meshes in an upwind manner. The physical properties (directions, strengths, etc.) of these wave patterns are obtained by a new wave model: ION-A developed from the eigen-system of the flux Jacobian matrices. Since the equation of state (EOS) which is used to close up the conservation laws includes electronic effects, it is a nonlinear function and it must be inverted by iterations to determine the ionization degree as a function of density and temperature. For the time advancement, the scheme utilizes a multi-stage Runge-Kutta (RK) algorithm with time steps carefully evaluated from the maximum possible propagation speed in the solution domain. The code runs interactively with the user and allows to create different meshes to use different initial and boundary conditions and to see changes of desired physical quantities in the form of color and vector graphics. The details of the visual properties of the code has been published before (see [N. Aslan, A visual fluctuation splitting scheme for magneto-hydrodynamics with a new sonic fix and Euler limit, J. Comput. Phys. 197 (2004) 1-27]). The two-dimensional nature of ION-A was presented by a planar shock wave propagating over a circular obstacle. It was demonstrated that including the effects of ionization in calculating complex flows is important, even when they appear initially negligible. This code can be used to accurately simulate the nonlinear time dependent evolution of neutral or ionized plasma flows from supersonic to hypersonic regimes.
Seamless live migration of virtual machines over the MAN/WAN
Authors: Franco Travostino, Paul Daspit, Leon Gommans, Chetan Jog, Cees de Laat, Joe Mambretti, Inder Monga, Bas van Oudenaarde, Satish Raghunath, Phil Yonghui Wang
Venue: Future Generation Computer Systems (2006)

The "VM Turntable" demonstrator at iGRID 2005 pioneered the integration of Virtual Machines (VMs) with deterministic "lightpath" network services across a MAN/WAN. The results provide for a new stage of virtualization--one for which computation is no longer localized within a data center but rather can be migrated across geographical distances, with negligible downtime, transparently to running applications and external clients. A noteworthy data point indicates that a live VM was migrated between Amsterdam, NL and San Diego, USA with just 1-2 s of application downtime. When compared to intra-LAN local migrations, downtime is only about 5-10 times greater despite 1000 times higher round-trip times.
Design principles and patterns for computer systems that are simultaneously secure and usable
Authors: David D. Clark, Robert C. Miller
Venue:  (2005)

It is widely believed that security and usability are two antagonistic goals in system design. This thesis argues that there are many instances in which security and usability can be synergistically improved by revising the way that specific functionality is implemented in many of today's operating systems and applications. Specific design principles and patterns are presented that can accomplish this goal. Patterns are presented that minimize the release of confidential information through remnant and remanent data left on hard drives, in web browsers, and in documents. These patterns are based on a study involving the purchase of 236 hard drives on the secondary market, interviews conducted with organizations whose drives had been acquired, and through a detailed examination of modern web browsers and reports of information leakage in documents. Patterns are presented that enable secure messaging through the adoption of new key management techniques. These patterns are supported through an analysis of S/MIME handling in modern email clients, a survey of 469 Amazon.com merchants, and a user study of 43 individuals. Patterns are presented for promoting secure operation and for reducing the danger of covert monitoring. These patterns are supported by the literature review and an analysis of current systems. In every case considered, it is shown that the perceived antagonism of security and usability can be scaled back or eliminated by revising the underlying designs on which modern systems are conceived. In many cases these designs can be implemented without significant user interface changes. The patterns described in this thesis can be directly applied by today's software developers and used for educating the next generation of programmers so that longstanding usability problems in computer security can at last be addressed. It is very likely that additional patterns can be identified in other related areas. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Authors: Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, Shantidev Mohanty
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical variations in the utilization of assigned spectrum ranges from 15% to 85% with a high variance in time. The limited available spectrum and the inefficiency in the spectrum usage necessitate a new communication paradigm to exploit the existing wireless spectrum opportunistically. This new networking paradigm is referred to as NeXt Generation (xG) Networks as well as Dynamic Spectrum Access (DSA) and cognitive radio networks. The term xG networks is used throughout the paper. The novel functionalities and current research challenges of the xG networks are explained in detail. More specifically, a brief overview of the cognitive radio technology is provided and the xG network architecture is introduced. Moreover, the xG network functions such as spectrum management, spectrum mobility and spectrum sharing are explained in detail. The influence of these functions on the performance of the upper layer protocols such as routing and transport are investigated and open research issues in these areas are also outlined. Finally, the cross-layer design challenges in xG networks are discussed.
A petri-net-based synthesis methodology for use-case-driven system design
Authors: K. S. Cheung, T. Y. Cheung, K. O. Chow
Venue: Journal of Systems and Software (2006)

In use-case-driven system design, one need to derive from a set of use cases an integrated system design that meets at least two objectives. First, the system design must be consistent with the use cases in the sense that the functionalities of the use cases are exactly reflected. Second, the system design must be correct in the sense that the system is free from errors such as deadlock and capacity overflow. The latter is especially important for systems involving some concurrent, sequential, asynchronous, competitive and coordinated processes, such as manufacturing systems. In this paper, we propose a synthesis methodology for use-case-driven system design whereby both objectives are satisfied. In our methodology, use cases are specified as labelled Petri nets, in which the conditions, events and their causal relationships are explicitly represented. A system design is then derived by synthesising these nets into a single consistent whole. Our methodology has two distinctive features, namely, a formal specification of use cases and a rigorous and systematic process for deriving a system design whose correctness and consistency can be optimally achieved. We specifically show its application to manufacturing system design. Promising results are obtained.
A model of diatom shape and texture for analysis, synthesis and identification
Authors: Y. A. Hicks, D. Marshall, P. L. Rosin, R. R. Martin, D. G. Mann, S. J. M. Droop
Venue: Machine Vision and Applications (2006)

We describe tools for automatic identification and classification of diatoms that compare photographs with other photographs and drawings, via a model. Identification of diatoms, i.e. assigning a new specimen to one of the known species, has applications in many disciplines, including ecology, palaeoecology and forensic science. The model we build represents life cycle and natural variation of both shape and texture over multiple diatom species, derived automatically from photographs and/or drawings. The model can be used to automatically produce drawings of diatoms at any stage of their life cycle development. Similar drawings are traditionally used for diatom identification, and encapsulate visually salient diatom features. In this article, we describe the methods used for analysis of photographs and drawings, present our model of diatom shape and texture variation, and finish with results of identification experiments using photographs and drawings as well as a detailed evaluation.
Statistical Model of Similarity Transformations: Building a Multi-Object Pose
Authors: Matias N. Bossa, Salvador Olmos
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In most of computational anatomy studies, pose is disregarded because pose information mainly depends on non relevant external factors. However, the relative pose among different objects belonging to a complex multi-object system may be useful for diagnosis, prognosis and monitoring. In this work a methodology to build statistical multi-object pose models (MOPM) is described. The methodology is based on Principal Geodesic Analysis because the space of similarity transformations does not form a vector space. Methods to compute statistics, namely averages and variation modes, are described in detail. Experimental results are performed on neuroanatomical structures such as the subcortical nuclei (caudate nucleus, hippocampus, amygdala, thalamus, putamen, pallidum) and lateral ventricles. We expect that multi-object pose models will be useful as a valuable a priori information about relative location, orientation and scale of each structure. This compact model will be relevant as a coarse initialization for segmentation, or regularization of segmentation and registration algorithms.