ppxscal/embedding_network huggingface dataset:
ERP systems success: an empirical analysis of how two organizational stakeholder groups prioritize and evaluate relevant measures
Authors: P. Ifinedo, N. Nahar
Venue: Enterprise Information Systems (2007)

Organizations worldwide are adopting enterprise resource planning (ERP) systems. A number of studies discuss the implementation and success of such systems, but our study of the literature indicates that discussions about ERP systems success from the perspectives of key organizational stakeholders are not easy to come across. This study is designed to fill this gap in research. Using surveys in Finland and Estonia, we obtained empirical data from 66 respondents in 44 diverse, private, industrial organizations. Our objective was to determine whether differences exist between two organizational stakeholder groups, i.e. business managers and IT professionals, concerning how each group believe ERP success measures and dimensions are prioritized and evaluated in their respective organizations. Prior literature suggests that differences exist between the two groups with regard to how each perceives organizational information technology (IT) issues. Our study indicates that no significant statistical differences exist between the two groups with the exception of one dimension of ERP success, i.e. vendor/consultant quality. The implications of our findings for both practice and research are discussed.
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Authors: Christian Scheideler, Andrea Richa, Paolo Santi
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized or hop-based interference models in which the effect of interference is neglected beyond a certain range from the transmitter. However, interference is a more complex phenomenon that cannot, in general, be captured by localized models, implying that protocols based on such models are not guaranteed to work in practice. This paper is the first to present and rigorously analyze a distributed dominating set protocol for wireless ad-hoc networks with O(1) approximation bound based on the physical interference model, which accounts for interference generated by all nodes in the network. The proposed protocol is fully distributed, randomized, and extensively uses physical carrier sensing to reduce message overhead. It does not need node identifiers or any kind of prior information about the system, and all messages are of constant size (in bits). We prove that, by appropriately choosing the threshold for physical carrier sensing, the protocol stabilizes within a logarithmic number of communication rounds, w.h.p., which is faster than the runtime of any known distributed protocol without prior knowledge about the system under any wireless model that does not abstract away collisions.
Asymptotic bounds for the rate of colored superimposed codes
Authors: V. S. Lebedev
Venue: Problems of Information Transmission (2008)

We introduce the notion of a q-ary (r 0, r 1, ..., r q¿1) superimposed code. We obtain upper and lower asymptotic bounds for the rate of these (colored) codes.
A synchronized block join point for AspectJ
Authors: Chenchen Xi, Bruno Harbulot, John R. Gurd
Venue: Proceedings of the 7th workshop on Foundations of aspect-oriented languages (2008)

Designing and implement model for a synchronized block join point to encapsulate crosscutting synchronization concerns into single unit in AspectJ.
TeachScheme, ReachJava!: tutorial presentation
Authors: John Clements
Venue: Journal of Computing Sciences in Colleges (2008)

Attract participants to our series of NSF-sponsored week-long workshops Free Week-Long Faculty Development Workshops Summer 2008 (will repeat in 2009) http://www.teach-scheme.org/
Analysis of the Impact of Wavelength Converters on Contention Resolution in Optical Burst Switching
Authors: Ali Rajabi, Aresh Dadlani, Farhad Hormozdiari, Ahmad Khonsari, Ahmad Kianrad, Hassan Seyed Razi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Optical burst switching (OBS) appears to be the best available solution to the ever-increasing demand for Internet bandwidth. As a multifaceted paradigm, it has opened up various motivating challenges in optical networking. Several analytical models regarding optical networking have been proposed in the literature. However, to the best of our knowledge, these models follow an exponential burst length distribution which is unrealistic in the case of threshold-based burst aggregation occurring at edge switches. In this work, we present an insightful model which considers constant burst lengths and study the effect of employing wavelength converters (WC) to the resource utilization and contention resolution policy. We investigate two types of optical switches in terms of availability of WCs in the switch fabric and study their performance through mathematical modeling using the results of queuing theory. We then further extend our investigation by comparing these switches through simulation experiments and thus, confirm our mathematical model. For the purpose of tractability, we also present an approximate model of M/D/c/K queuing system with finite waiting room using an M/D/1/K system.
Drill across & visualization of cubes with non-conformed dimensions
Authors: Dariush Riazati, James A. Thom, Xiuzhen Zhang
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

Data analysts would benefit greatly from the ability to navigate and view combined multidimensional data from multiple sources, a key requirement of which is the conformity between their dimensions. The strict requirements of conformity restrict navigating to related multidimensional data from unseen or unfamiliar sources. In this paper we make a distinction between conformed dimension tables and conformed dimension attributes and discuss the merits of relaxing the conformity requirement. We propose extending the navigation operation drill across to include the non-conformed dimensions and introduce Nested Pivot Tables as an extension to Pivot Tables to show how sources that have conformed as well as non-conformed dimensions can be viewed and analyzed together.
Usability evaluation for enterprise SOA APIs
Authors: Jack K. Beaton, Brad A. Myers, Jeffrey Stylos, Sae Young (Sophie) Jeong, Yingyu (Clare) Xie
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

SAP recently began offering access to web services through its Enterprise Service-Oriented Architecture (E-SOA) plat-form. It is in the best interest of SAP that its E-SOA service operations are easier for developers to use and understand, which will contribute to higher E-SOA adoption, and a more effective means of innovation on the part of business customers. To facilitate such a change, Carnegie Mellon University's Human-Computer Interaction Institute is working with SAP's E-SOA and Business Process Reno-vation Teams to analyze the E-SOA interfaces using HCI techniques and determine means by which developers assigned to create SOA APIs in general, and Enterprise SOA APIs in particular, can design superior interfaces. The identification of usable design patterns, and methodologies to determine these patterns, can streamline SOA projects for API developers and programmers who use SOA APIs.
On the integration of sensor networks and general purpose IT infrastructure
Authors: Wouter Horré, Sam Michiels, Nelson Matthys, Wouter Joosen, Pierre Verbaeten
Venue: Proceedings of the 2nd international workshop on Middleware for sensor networks (2007)

Integrating sensor networks with general purpose IT infrastructure has been confirmed as a complex problem in the development and management of industrial sensor applications. This integration is complex because a single general purpose application queries multiple sensor networks and a single sensor network has to serve multiple applications. This paper identifies three challenges that need to be addressed by middleware in order to enable this integration: federated management, interoperability and adaptability across the whole infrastructure. The paper presents a taxonomy of middleware solutions and positions the identified challenges in a survey of state-of-the-art middleware research we conducted earlier. By looking at sensor network middleware from an application (business) perspective, we come to the conclusion that time may have come to consolidate middleware efforts presented during the past years.
Primal-dual interior-point methods for PDE-constrained optimization
Authors: Michael Ulbrich, Stefan Ulbrich
Venue: Mathematical Programming: Series A and B (2008)

This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in L p . It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier L &#x221e;-setting is analyzed, but also a more involved L q -analysis, q&#x00a0;<&#x00a0;&#x221e;, is presented. In L &#x221e;, the set of feasible controls contains interior points and the Fr&#x00e9;chet differentiability of the perturbed optimality system can be shown. In the L q -setting, which is highly relevant for PDE-constrained optimization, these nice properties are no longer available. Nevertheless, a convergence analysis is developed using refined techniques. In parti- cular, two-norm techniques and a smoothing step are required. The L q -analysis with smoothing step yields global linear and local superlinear convergence, whereas the L &#x221e;-analysis without smoothing step yields only global linear convergence.
Pastel: Bridging the Gap between Structured and Large-State Overlays
Authors: Nuno Cruces, Rodrigo Rodrigues, Paulo Ferreira
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Peer-to-peer overlays envision a single overlay substrate that can be used (possibly simultaneously) by many applications, but current overlays either target fast, few-hop lookups for contacting directly the responsible nodes, or slower multi-hop lookups that can be used by applications that exploit the overlay topology (like multicast or anycast).In this paper we present Pastel, an extension to Pastry that bridges the gap between the two types of overlays. Pastel maintains both Pastry routing tables and a full information table, and we show how we can exploit synergies between the maintenance of the two. We also propose a novel API that is richer than the one offered by existing overlays, to give applications control over the type of lookups (structured, multi-hop routing, or attempt direct contact).We implemented Pastel in a discrete-event packet level simulator and our results show that Pastel has lookups that are usually more efficient than Pastry’s. Furthermore, the bandwidth required by Pastel is modest, even for a system with thousands of nodes.
Design of an FDB based Intra-domain Packet Traceback System
Authors: Hiroaki Hazeyama, Yoshihide Matsumoto, Youki Kadobayashi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper, we propose an FDB based intra-Domain Traceback System (FDB-DTS), which is a hybrid traceback system composed of packet digesting boxes and an iterative query engine to the Forwarding Data Base (FDB) on local subnet switches. A Hash based IP Traceback system (HB-IPTBS) [12, 16] can track the detailed attack paths inside the intra-domain by packet digests, which are encoded packets by an one-way hash function. However, it forces to the operator to settle packet digesting boxes in each router, each switch, or each interface of each router/switch. Thus, HB-IPTBS requires a large investment budget and operation tasks. Our FDB-DTS is a light weight intra-domain hash based packet traceback system. Our FDB-DTS employs a MAC address trace tool for the tracking engine on an layer 2 network by using MAC addresses as keys. In the deployment of the traceback system, our FDB-DTS needs only one packet digesting agent in each layer 2 network, therefore, our FDB-DTS can reduce the investment costs and operation tasks. Here, we present the basic idea of the FDB-DTS and show the design of a sample implementation with a MAC address trace tool by SNMP iterative query.
Parallel programming: can we PLEASE get it right this time?
Authors: Tim Mattson, Michael Wrinn
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The computer industry has a problem. As Moore's law marches on, it will be exploited to double cores, not frequencies. But all those cores, growing to 8, 16 and beyond over the next several years, are of little value without parallel software. Where will this come from? With few exceptions, only graduate students and other strange people write parallel software. Even for numerically intensive applications, where parallel algorithms are well understood, professional software engineers almost never write parallel software. Somehow we need to (1) design many core systems programmers can actually use and (2) provide programmers with parallel programming environments that work. The good news is we have 25+ years of history in the HPC space to guide us. The bad news is that few people are paying attention to this experience. This talk looks at the history of parallel computing to develop a set of anecdotal rules to follow as we create manycore systems and their programming environments. A common theme is that just about every mistake we could make has already been made by someone. So rather than reinvent these mistakes, let's learn from the past and "do it right this time".
Scheduling multithreaded computations by work stealing
Authors: R. D. Blumofe, C. E. Leiserson
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is "work stealing," in which processors needing work steal computational threads from other processors. In this paper, we give the first provably good work-stealing scheduler for multithreaded computations with dependencies. Specifically, our analysis shows that the expected time T/sub P/ to execute a fully strict computation on P processors using our work-stealing scheduler is T/sub P/=O(T/sub 1//P+T/sub /spl infin//), where T/sub 1/ is the minimum serial execution time of the multithreaded computation and T/sub /spl infin// is the minimum execution time with an infinite number of processors. Moreover, the space S/sub P/ required by the execution satisfies S/sub P//spl les/S/sub 1/P. We also show that the expected total communication of the algorithm is at most O(T/sub /spl infin//S/sub max/P), where S/sub max/ is the size of the largest activation record of any thread, thereby justifying the folk wisdom that work-stealing schedulers are more communication efficient than their work-sharing counterparts. All three of these bounds are existentially optimal to within a constant factor.
A weight-based approach to information retrieval and relevance feedback
Authors: Yi-Chun Liao
Venue: Expert Systems with Applications: An International Journal (2008)

Facing the huge amount of information available on the world wide web, people suffer from spending much time and effort to examine the results provided by a search engine. This is mainly because of searching without considering the users' preference and history of uses. Although some search engines have been developed and are currently used, without information regarding users' desire and profile, the search domain remains too large to be effective. This paper proposes a search method that operates on a database of e-documents with references of a common body of knowledge and the retrieval information of the users. By employing data mining and optimization techniques, a framework for an information retrieval system that can effectively search content-related documents is proposed. The concept with the proposed algorithm is described with an illustrative algorithm.
Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models
Venue: International Symposium on Mobile Ad Hoc Networking Computing (2008)

It is our great pleasure to welcome you to the First ACM SIGMOBILE Workshop on Mobility Models (MobilityModels'08). The workshop was born with the specific aim of building a community around the research area of realistic models for mobility and connectivity. Different types of models have been proposed in the last decade, from those founded on purely synthetic movements, such as the ones based on purely random movements of the nodes to those aiming at reproducing the mobility patterns inside specific places like campuses or cities. In addition, efforts to collect real traces of people movement have been made and traces have been made available and used in simulators. Despite these efforts, the problem of understanding and modeling mobility, and, more specifically, human mobility remains of great interest for the mobile ad hoc networks community, as many questions are still unanswered and evaluation methodologies still unsatisfactory. New insights and more refined and realistic models are still needed, bringing together real world measurements and mathematical characterization of node mobility. These problems are of interest to anyone working on mobile networking, as these models are often at the basis of the performance evaluation, comparison, and validation of new approaches and solutions. The call for papers attracted 18 submissions from Asia, Europe, Australia and the United States. The program committee accepted 7 papers. In addition, the program includes an invited talk by Prof. Mehul Motani from the National University of Singapore, an expert in the area of opportunistic communications and realistic experimentation. We hope that these proceedings will serve as a valuable reference for mobility models researchers and developers.
Exploring question subjectivity prediction in community QA
Authors: Baoli Li, Yandong Liu, Ashwin Ram, Ernest V. Garcia, Eugene Agichtein
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper we begin to investigate how to automatically determine the subjectivity orientation of questions posted by real users in community question answering (CQA) portals. Subjective questions seek answers containing private states, such as personal opinion and experience. In contrast, objective questions request objective, verifiable information, often with support from reliable sources. Knowing the question orientation would be helpful not only for evaluating answers provided by users, but also for guiding the CQA engine to process questions more intelligently. Our experiments on Yahoo! Answers data show that our method exhibits promising performance.
Evaluating exact VARMA likelihood and its gradient when data are incomplete
Authors: Kristjan Jonasson, Sebastian E. Ferrando
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

A detailed description of an algorithm for the evaluation and differentiation of the likelihood function for VARMA processes in the general case of missing values is presented. The method is based on combining the Cholesky decomposition method for complete data VARMA evaluation and the Sherman-Morrison-Woodbury formula. Potential saving for pure VAR processes is discussed and formulae for the estimation of missing values and shocks are provided. A theorem on the determinant of a low rank update is proved. Matlab implementation of the algorithm is in a companion article.
Czech Web archive analysis
Authors: P. Zabicka, L. Mate˘jka
Venue: The New Review of Hypermedia and Multimedia (2007)

This paper introduces current activities of WebArchiv, a Web archiving project of the National Library in Prague. It also presents an analysis of the archive of Czech Web resources built by the project team. Through this analysis, we suggest several Web-harvesting strategies that would help to reduce costs associated with maintaining large amounts of data.
Television on the Internet: Regulating new ways of viewing
Authors: Christine Cooper
Venue: Information and Communications Technology Law (2007)

Television has become ingrained in our modern way of life. Governments across the world have recognised this and sought to control what may be broadcast and what different audiences may watch. These regulatory regimes have been focused on the traditional television set. However, the Internet has begun to threaten this established order as new ways of viewing audio-visual content have become available and legal systems have not easily accommodated these new developments. Government policy in the United Kingdom is not to regulate Internet content in order to encourage the development of compelling new content services. However, the drafting of the legislative measures intended to give effect to that policy are potentially flawed. They appear to bring some television content on the Internet within the scope of broadcast regulation, but without any means for the content service provider to acquire the appropriate licence. TV Licensing has recently brought the issue to the fore by declaring that a licence is required to watch television on the Internet. If a television licence is required to watch a particular programme on the Internet, then surely a licence was required to broadcast that programme? In this article, it is argued that the Communications Act must be interpreted such that no Internet content is subject to its provisions. The Communications (Television Licensing) Regulations must also be interpreted so that a viewer only requires a licence where the broadcast signal has been captured and converted. Finally, while it is difficult to support a position that subjects two organisations showing the same programme content to different requirements solely as a result of the transmission technology used, the European Commission's proposals to unify the regulatory field are unlikely to achieve what they set out to do. I believe that what is going on here is not a revolution as some had predicted, but it is a gentle, gradual, evolving, historic act of liberation. The liberty of consumers, viewers, listeners, to determine their own viewing, their own listening, their own schedule, their own compilations, their own content, and even their own services. (Richards, 2005)