ppxscal/embedding_network huggingface dataset:
Redundancy elimination revisited
Authors: Keith Cooper, Jason Eckhardt, Ken Kennedy
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replacement and hash-based value numbering. The former detects redundant array references within and across loop iterations, while the latter detects a large class of redundancies, but only within a single loop iteration. By integrating the two techniques, ESR detects and eliminates a wider range of expression redundancies across loop iterations. We also extend hash-based value numbering to perform reassociation. Classic redundancy elimination techniques operate on an intermediate representation of the program in which operand association and order is of fixed shape. This rigidity in code shape may sometimes obscure redundancies. Our optimizer attempts to shape the code by changing associativity, exposing more redundancies. Opportunities for ESR, in particular, are increased with reassociation.
Making the best of limited resources: differential sensing in cognitive PANs
Authors: Jelena Mišić, Vojislav B. Mišić
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Cognitive radio technology necessitates accurate and timely sensing of the primary users' activity on the chosen set of channels. We assume incomplete sensing, in which the number of sensing nodes is smaller than the number of channels; the results of sensing are cooperatively combined to form a coherent channel map. As the times when spectral opportunities end are more critical for network performance, idle channels should be sensed more frequently than the active ones. The paper presents a probabilistic analysis of two differential sensing policies, and investigates the range of values in which such, incomplete sensing is capable of maintaining an accurate view of the status of the working channel set.
Integrating Multiple Approaches for Interacting with Dynamic Data Structure Visualizations
Authors: James H. Cross,  II, T. Dean Hendrix, Larry A. Barowski
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

jGRASP 1.8.7 has integrated three approaches for interacting with its dynamic viewers for data structures: the debugger, the workbench, and a new text-based interactions tab that allows individual Java statements to be executed and expressions to be evaluated. While each of these approaches is distinct and can be used independently of the others, they can also be used together to provide a complementary set of interactions with the dynamic viewers. In order to integrate these approaches, the jGRASP visual debugger, workbench, and viewers had to be significantly redesigned. During this process, the structure identifier, which provides for the identification and rendering of common data structures, was also greatly improved by examining the examples from 20 data structure textbooks. The overall result of this integration effort is a highly flexible approach for user interaction with the dynamic data structure visualizations generated by a robust structure identifier.
A Reverse Order-Based QoS Constraint Correction Approach for Optimizing Execution Path for Service Composition
Authors: Kaijun Ren, Nong Xiao, Jinjun Chen, Junqiang Song
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

In service oriented computing systems, a business process can be exposed as a composite service which consists of a set of logically connected sub-services. For each service in the composition, many service providers can offer the same function but may different QoS. In the general service composition, when a user submits a request, overall QoS constraints called end-to-end QoS composition's requirements, for example, time should be less than one hour, and cost should be less than 60$, can be transmitted at the same time. As such, how to effectively coordinate individual QoS constraints for single service to achieve the best overall QoS benefits without violating such end-to-end QoS constraint requirements has been a critical issue. With an increasing number of abstract services in a service composition, the possibility of execution path by selecting different service providers for each abstract service blows up exponentially. Therefore, service selection problem for service composition is a computational-hard problem, which can be regarded as a Multiple choice Multiple dimension Knapsack Problem (MMKP) that has been proved np-hard [1, 2, 3]. Recently, a lot of approaches such as graph-based techniques[4], runtime adaptation-based techniques[5], Service Level Agreement(SLA), negotiation and auction based techniques[6], Integer Linear Programming (ILP) based techniques[7] have been proposed to resolve overall QoS constraints for optimizing execution path in a service composition. No matter what the merits and the importance current existing methods have, they rely on directly judging constraint conditions to detect multiple paths for picking out a critical execution path, which easily produces a high-time complexity and even an unsatisfactory result in comparison to the best path. As such, the issue on resolving overall QoS constraints to achieve an optimal execution path has not yet been well addressed.
Moving mountains to get IM&T in the orientation mix
Authors: Shannon Agee Curcio
Venue: Proceedings of the 36th annual ACM SIGUCCS conference on User services conference (2008)

With Savannah College of Art and Design's growing dependency on technology, we have identified the need to train our incoming faculty, staff, and students to use the technology that is necessary to thrive in our academic environment. Once this need was identified, we then had to find ways to integrate technology training into orientation. So far, our efforts with faculty and staff have been very successful, and we are still working on the best approach to reach all incoming students. To reach faculty and staff, we met with Human Resources and Faculty Development and agreed that all full-time faculty and staff would be required to attend a technology orientation in order to receive their network/email account access. Staff technology orientation is a 2½-hour session held on the second day of orientation. Faculty members attend a 3-hour technology session on the first day of their orientation with the school. The most challenging step of this process to date has been the inclusion of technology training into student orientation. We have tried several different methods to communicate the technology message that we have for students and are continuously revising this process. We are limited on time, space, and personnel to reach all the incoming students especially during the large influx of fall quarter. This paper will examine the steps that were taken to integrate technology into faculty and staff orientations and examine the on-going processes for addressing our students' training needs.
Empirical evidence of the benefits of workspace awareness in software configuration management
Authors: Anita Sarma, David Redmiles, André van der Hoek
Venue: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering (2008)

In this paper, we present results from our empirical evaluations of a workspace awareness tool that we designed and implemented to augment the functionality of software configuration management systems. Particularly, we performed two user experiments directed at understanding the effectiveness of a workspace awareness tool in improving coordination and reducing conflicts. In the first experiment, we evaluated the tool through text-based assignments to avoid interference from the well-documented impact of individual differences among participants, as these differences are known to lessen the observable effect of proposed tools or to lead to them having no observable effect at all. This strategy of evaluating an application in a domain that is known to have less individual differences is novel and in our case particularly helpful in providing baseline quantifiable results. Upon this baseline, we performed a second experiment, with code-based assignments, to validate that the tool's beneficial effects also occur in the case of programming. Together, our results provide quantitative evidence of the benefits of workspace awareness in software configuration management, as we demonstrate that it improves coordination and conflict resolution without inducing significant overhead in monitoring awareness cues.
On the Efficacy of Computation Offloading Decision-Making Strategies
Authors: Selim Gurun, Rich Wolski, Chandra Krintz, Dan Nurmi
Venue: International Journal of High Performance Computing Applications (2008)

We present a framework for making computation offloading decisions in computational grid settings in which schedulers determine when to move parts of a computation to more capable resources to improve performance. Such schedulers must predict when an offloaded computation will outperform one that is local by forecasting the local cost (execution time for computing locally) and remote cost (execution time for computing remotely and transmission time for the input/output of the computation to/from the remote system). Typically, this decision amounts to predicting the bandwidth between the local and remote systems to estimate these costs. Our framework unifies such decision models by formulating the problem as a statistical decision problem that can either be treated "classically" or using a Bayesian approach. Using an implementation of this framework, we evaluate the efficacy of a number of different decision strategies (several of which have been employed by previous systems). Our results indicate that a Bayesian approach employing automatic change-point detection when estimating the prior distribution is the best performing approach.
Enhancing GridFTP performance using intelligent gateways
Authors: Onur Demir, Michael R. Head, Kanad Ghose, Madhusudhan Govindaraju
Venue: International Journal of High Performance Computing and Networking (2008)

To improve throughput of grid data servers under heavy loads or under denial of service attacks, it is important to service requests differentially, giving preference to ongoing or imminent client requests. We show how such features can be efficiently implemented on a gateway that controls access to a pool of servers. We present performance results for a prototype system based on a dual-ported active NIC, and demonstrate that an efficient differentiated service policy can be implemented on such a gateway to minimise the grid service response time and to improve server throughputs under heavy loads and denial of service attacks.
Performing perception&mdash;staging aesthetics of interaction
Authors: Peter Dalsgaard, Lone Koefoed Hansen
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

In interaction design for experience-oriented uses of technology, a central facet of aesthetics of interaction is rooted in the user's experience of herself &ldquo;performing her perception.&rdquo; By drawing on performance (theater) theory, phenomenology and sociology and with references to recent HCI-work on the relation between the system and the performer/user and the spectator's relation to this dynamic, we show how the user is simultaneously operator, performer and spectator when interacting. By engaging with the system, she continuously acts out these three roles and her awareness of them is crucial in her experience. We argue that this 3-in-1 is always already shaping the user's understanding and perception of her interaction as it is staged through her experience of the object's form and expression. Through examples ranging from everyday technologies utilizing performances of interaction to spatial contemporary artworks, digital as well as analogue, we address the notion of the performative spectator and the spectating performer. We demonstrate how perception is also performative and how focus on this aspect seems to be crucial when designing experience-oriented products, systems and services.
Learning Cooperation in Collaborative Grid Environments to Improve Cover Load Balancing Delivery
Authors: Mauricio Paletta, Pilar Herrero
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

This paper complements the research carried out on the CAM (Collaborative/Cooperative Awareness Management) model with the inclusion of a new learning strategy based on the historical information of previous collaboration/cooperation with the aim to predict future behavior as well as for optimizing purposes. This strategy is based on neural network technology, specifically on Radial Based Function Network (RBFN). Results show that a RBFN properly configured to represent this problem can successfully learn from the data associated to the cooperation in the Grid because it reaches an acceptable average error.
Automated annotation of Drosophila gene expression patterns using a controlled vocabulary
Authors: Shuiwang Ji, Liang Sun, Rong Jin, Sudhir Kumar, Jieping Ye
Venue: Bioinformatics (2008)

Motivation: Regulation of gene expression in space and time directs its localization to a specific subset of cells during development. Systematic determination of the spatiotemporal dynamics of gene expression plays an important role in understanding the regulatory networks driving development. An atlas for the gene expression patterns of fruit fly Drosophila melanogaster has been created by whole-mount in situ hybridization, and it documents the dynamic changes of gene expression pattern during Drosophila embryogenesis. The spatial and temporal patterns of gene expression are integrated by anatomical terms from a controlled vocabulary linking together intermediate tissues developed from one another. Currently, the terms are assigned to patterns manually. However, the number of patterns generated by high-throughput in situ hybridization is rapidly increasing. It is, therefore, tempting to approach this problem by employing computational methods. Results: In this article, we present a novel computational framework for annotating gene expression patterns using a controlled vocabulary. In the currently available high-throughput data, annotation terms are assigned to groups of patterns rather than to individual images. We propose to extract invariant features from images, and construct pyramid match kernels to measure the similarity between sets of patterns. To exploit the complementary information conveyed by different features and incorporate the correlation among patterns sharing common structures, we propose efficient convex formulations to integrate the kernels derived from various features. The proposed framework is evaluated by comparing its annotation with that of human curators, and promising performance in terms of F1 score has been reported. Contact: jieping.ye@asu.edu Supplementary information: Supplementary data are available at Bioinformatics online.
An unsupervised neural network approach for automatic semiconductor wafer defect inspection
Authors: Chuan-Yu Chang, ChunHsi Li, Jia-Wei Chang, MuDer Jeng
Venue: Expert Systems with Applications: An International Journal (2009)

Semiconductor wafer defect inspection is an important process before die packaging. The defective regions are usually identified through visual judgment with the aid of a scanning electron microscope. Dozens of people visually check wafers and hand-mark their defective regions. Consequently, potential misjudgment may be introduced due to human fatigue. In addition, the process can incur significant personnel costs. Prior work has proposed automated visual wafer defect inspection that is based on supervised neural networks. Since it requires learned patterns specific to each application, its disadvantage is the lack of product flexibility. Self-organizing neural networks (SONNs) have been proven to have the capabilities of unsupervised auto-clustering. In this paper, an automatic wafer inspection system based on a self-organizing neural network is proposed. Based on real-world data, experimental results show, with good performance, that the proposed method successfully identifies the defective regions on wafers.
An overview of OpenAirInterface wireless network emulation methodology
Authors: Hicham Anouar, Christian Bonnet, Daniel Câmara, Fethi Filali, Raymond Knopp
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

The OpenAirInterface wireless network emulator, a tool with the dual objective of performing protocol and application performance evaluation, in addition to real-time layer 2/3 protocol implementation validation, is described. The current example protocol implementations closely resemble those of evolving UMTS-LTE and 802.16e/m networks with the additional possibility for creating mesh network topologies. They do not provide any form of compliance, however, with these standards. The emulation environment comes in both real-time and non-real-time flavors based on RTAI/Linux open-source developments. Novel ideas for physical layer (PHY) abstraction are also reviewed.
An optimal T-S model for the estimation and identification of nonlinear functions
Authors: Agustín Jiménez, Basil M. Al-Hadithi, Fernando Matía
Venue: WSEAS Transactions on Systems and Control (2008)

A novel optimal method is developed to improve the identification and estimation of Takagi-Sugeno (TS) fuzzy model. The idea comes from the fact that the main drawback of T-S model is that it can not be applied when the membership functions are overlapped by pairs. This limits the application of the T-S model because this type of membership function has been widely used in the stability and controller design of fuzzy systems. It is also very popular in industrial control applications. The method presented here can be considered as a generalized version of T-S fuzzy model with optimized performance in approximating nonlinear functions. Various examples are chosen to show the high function approximation accuracy and fast convergence obtained by applying the proposed method in approximating nonlinear systems locally and globally in comparison with the original T-S model.
Dynamic tag estimation for optimizing tree slotted aloha in RFID networks
Authors: Gaia Maselli, Chiara Petrioli, Claudio Vicari
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

The emergent commercial use of techniques for Radio Frequency-based IDentification of different items (RFID) requires the investigation and testing of collision resolution mechanisms for the efficient and correct communication between the system reader and the tags labeling the items that need to be identified. Several MAC protocols have been proposed to resolve collisions in RFID networks. A recent solution, named Tree Slotted Aloha (TSA), has been shown to outperform previous ones with respect to the time it takes for identifying all tags, and the total number of bits transmitted to complete the identification process. However, almost half of the time needed by TSA for identifying tags is spent in collisions. This depends on TSA operation and in particular on the way TSA estimates the number of colliding tags. We have observed that in the case of realistically large networks, TSA highly underestimates this number, with non-negligible impact on the protocol performance. In this paper, we propose a Dynamic Tree Slotted Aloha (Dy TSA) protocol that exploits the knowledge acquired during ongoing readings to refine the estimation of the number of colliding tags. In so doing, Dy TSA adapts the length of the following reading cycles to the actual number of tags still requiring identification. Through ns2-based simulations we show that the proposed method is effective for tag identification and results in significantly improved performance over TSA. Specifically, the length of the identification process is up to 20% lower than that of TSA. Furthermore, the amount of transmitted bits needed for identifying all tags decreases up to 30%.
On the complexity of binary samples
Authors: Joel Ratsaby
Venue: Annals of Mathematics and Artificial Intelligence (2008)

Consider a class $\mathcal{H}$ of binary functions h: X¿{¿¿¿1,¿+¿1} on an interval $X=[0, B]\subset \mbox{\rm IR}$ . Define the sample width of h on a finite subset (a sample) S¿¿¿X as ¿ S (h)¿=¿ min x¿¿¿S |¿ h (x)| where ¿ h (x)¿=¿h(x) max {a¿¿¿0: h(z)¿=¿h(x), x¿¿¿a¿¿¿z¿¿¿x¿+¿a}. Let $\mathbb{S}_\ell$ be the space of all samples in X of cardinality ¿ and consider sets of wide samples, i.e., hypersets which are defined as $A_{\beta, h} = \{S\in \mathbb{S}_\ell: \omega_{S}(h) \geq \beta\}. $ Through an application of the Sauer-Shelah result on the density of sets an upper estimate is obtained on the growth function (or trace) of the class $\{A_{\beta, h}: h\in\mathcal{H}\}$ , β¿>¿0, i.e., on the number of possible dichotomies obtained by intersecting all hypersets with a fixed collection of samples $S\in\mathbb{S}_\ell$ of cardinality m. The estimate is $2\sum_{i=0}^{2\lfloor B/(2\beta)\rfloor}{m-\ell\choose i}$ .
Leveraging on-chip networks for data cache migration in chip multiprocessors
Authors: Noel Eisley, Li-Shiuan Peh, Li Shang
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

Recently, chip multiprocessors (CMPs) have arisen as the de facto design for modern high-performance processors, with increasing core counts. An important property of CMPs is that remote, but on-chip, L2 cache accesses are less costly than off-chip accesses; this is in contrast to earlier chip-to-chip or board-to-board multiprocessors, where an access to a remote node is just as costly if not more so than a main memory access. This motivates on-chip cache migration as a means to retain more data on-chip. However, previously proposed techniques do not scale to high core counts: they do not leverage the on-chip caches of all cores nor have a scalable migration mechanism. In this paper we propose ascalable in-network migration technique which uses hints embedded within the router microarchitecture to steer L2 cache evictions towards free/invalid cache slots in any on-chip core cache, rather than evicting it off-chip. We show that our technique can provide an average of a 19% reduction in the number of off-chip memory accesses over the state-of-the-art, beating the performance of a pseudo-optimal migration technique. This can be done with negligible area overhead and a manageable traffic overhead of 13.4%.
Why different carriers adopt different spectrum acquisition strategies
Authors: Hemant K. Sabat
Venue: Information Technology and Management (2008)

This paper provides a theory to account for why different mobile wireless carriers adopt different spectrum acquisition strategies and empirically validates it. In the mobile wireless industry, the key industry and business drivers are the investments made by network operators. Of these cost drivers, the most influential on the industry's dynamics are the capital investments, which include spectrum acquisition investments. This article presents concepts and viewpoints to understand the strategies adopted by carriers when acquiring mobile wireless spectrum. The concepts and viewpoints have been developed based on extensive studies of acquisition behaviors amongst carriers during the wireless spectrum distributions held in various parts of the world, and the spectrum acquisition strategies pursued by carriers over the past 10 years. The resulting framework is presented as a theoretical contribution to the literature building on contemporary notions of theory-building and presentation.