ppxscal/embedding_network huggingface dataset:
The Nexus between Information Technology and Competitive Strategy: A Conceptual Framework and Its Hypotheses
Authors: Leelien Ken Huang, Y. J. Lin, T. T. Lin
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This research is to empirically examine the strategic alignment between IT management strategy and business strategy (i.e., competitive strategy) in Taiwan organizations for achieving sustained competitive advantage. Three streams of theory: contingency theory, resource-based theory, and general strategic management theory are used to construct the research model to examine the causal relationships between variables affecting such alignment, using a structural equation modeling approach. The objective is to establish the organizational impact of strategic alignment, given the environmental uncertainty and the importance of IT to the organization. This research would contribute by indicating some of the implications, for both decision makers and scholars, of an extended IT capabilities perspective on alignment mechanisms. This paper mainly presents conceptual part, the development of research constructs, research hypotheses, and data collection status since empirical work is in progress.
Rerouting Strategies for Networks with Advance Reservations
Authors: Lars-Olof Burchard, Barry Linnert, Joerg Schneider
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Network transmissions in high performance networking scenarios, e.g., used for e-science or Grid applications, require quality-of-service guarantees concerning bandwidth availability, but also timing constraints, e.g., deadlines, must be met. Current research efforts concentrate on supporting such environments with SLA-aware advance reservation management systems. Hence, the robustness of the management system against network failures is an important issue, especially since failures frequently occur in networks. Since accurate knowledge about the failure duration is unlikely available and estimations lead to considerably degraded performance, in this paper we present a novel load-based approach for dealing with link failures in advance reservation environments. The approach does not rely on prediction of the downtime, but instead reroutes flows only based on available information about the network.
Keyword Searching in Hypercubic Manifolds
Authors: Yu-En Lu, Steven Hand, Pietro Lio
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

We present a novel approach for keyword searching for file sharing applications based on a simple hash function and extension to current Distributed Hash Tables (DHT) topology. Depart from standard hash methods on DHT systems, our approach is to develop a locality preserving hash function so that objects containing the same keyword tend to have similar hash values under Hamming metric. We show that this hash function is locality preserving and proposes the embedding of keyword edges to facilitate query processing. As such, we reduce several class of problems in keyword search into a network multicast problem.
Compositional reasoning for port-based distributed systems
Authors: Alma L. Juarez Dominguez, Nancy A. Day
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Many distributed systems using IP-based communication protocols consist of chains of components that run concurrently and communicate asynchronously with their neighbours through ports. We present a compositional reasoning method using model checking and theorem proving to verify liveness properties of a communication protocol for chains of connections consisting of an unknown number of components. We outline how our method is used to verify properties of the call protocol of AT&T's Distributed Feature Composition (DFC) architecture.
Shape-based retrieval and analysis of 3D models
Authors: Thomas Funkhouser, Michael Kazhdan
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Large repositories of 3D data are rapidly becoming available in several fields, including mechanical CAD, molecular biology, and computer graphics. As the number of 3D models grows, there is an increasing need for computer algorithms to help people find the interesting ones and discover relationships between them. Unfortunately, traditional text-based search techniques are not always effective for 3D models, especially when queries are geometric in nature (e.g., find me objects that fit into this space). This course will survey recent methods and applications for representing, matching, indexing, and classifying 3D polygonal models based on their shapes.
Controlling Salinity in a Potable Water Supply System Using a Constraint Programming Approach
Authors: Chiu Wo Choi, Jimmy H. M. Lee
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the winter dry season, the intrusion of sea water raises the salinity of the river to a high level and affects approximately the daily life of 450,000 residents of the city. In this paper, we report the application of constraint programming to optimize the logistical operations of the raw water system so as to satisfy the daily water consumption requirement of the city and to keep the potable salinity below a desirable level for as many days as possible. Our system has already been delivered to the the water supply company for deployment.
Backend CAD flows for "restrictive design rules"
Authors: M. Lavin, Fook-Luen Heng, G. Northrop
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

To meet challenges of deep-subwavelength technologies (particularly 130 nm and following), lithography has come to rely increasingly on data processes such as shape fill, optical proximity correction, and RETs like altPSM. For emerging technologies (65 nm and following) the computation cost and complexity of these techniques are themselves becoming bottlenecks in the design-silicon flow. This has motivated the recent calls for restrictive design rules such as fixed width/pitch/orientation of gate-forming polysilicon features. We have been exploring how design might take advantage of these restrictions, and present some preliminary ideas for how we might reduce the computational cost throughout the back end of the design flow through the post-tapeout data processes while improving quality of results: the reliability of OPC/RET algorithms and the accuracy of models of manufactured products. We also believe that the underlying technology, including simulation and analysis, may be applicable to a variety of approaches to design for manufacturability (DFM).
Belief Propagation over MIMO Frequency Selective Fading Channels
Authors: Mustafa N. Kaynak, Tolga M. Duman, Erozan M. Kurtas
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this paper, we propose an iterative belief propagation (BP) detector over multiple-input multiple-output (MIMO) frequency selective fading channels as an alternative to the typically used maximum a-posteriori (MAP) or Viterbi detectors. Unlike the trellis based detectors having serial structure, the proposed detector has the advantage of having a parallel structure, resulting in more efficient and fast hardware implementations. Moreover, BP detector is less complicated than the MAP detector and it has a short decoding delay which is essential for reduced memory requirements. Via simulations we show that, over frequency selective fading channels, the proposed BP detector achieves a near-optimal performance, even in the presence of the length 4 cycles in the channel factor graph.
"Business Process" Oriented Requirements Engineering Process
Authors: Tomoyuki Arao, Eiji Goto, Tomoko Nagata
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Although requirements engineering techniques and tools have become gradually recognized as ideas, it is still rare to see these ideas implemented in real projects especially for service business information systems in Japan. Through our research project, we found that there are some specific causes that prevent the requirements engineering process from being implemented in real projects and that eliminating these causes can improve the quality and productivity of the requirements engineering process. In this paper, we first present our analysis of the causes that prevent the implementation of the requirements engineering process and approaches to eliminate them. Then, we demonstrate the results from real pilot projects in which these approaches were applied. Finally, we present our ideas about the possibility of applying the approaches to other projects.
Outcome-Driven Simulation: A Competency-Based Training Approach to Achieving Decision Dominance
Authors: Azad M. Madni, H. Barbara Sorensen, Carla C. Madni
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In modern network-centric warfare, information superiority is a source of tactical advantage. Information superiority can potentially translate into decision superiority if available data and information can be rapidly transformed into actionable knowledge. Decision superiority requires a thorough understanding of the C² decisionmaking processes and the C² information systems that support them. It is with this understanding that we are developing DecisionEdge™, a competency-based training system that is intended to enable trainees to learn both C² decisionmaking processes as well as C² information systems that support them. DecisionEdge allows the learner to experience progressively more difficult training scenarios through systematic manipulation of scenario variables such as event density, time stress, and information availability. This paper presents the system concept, technical architecture, and key design decisions and tradeoffs that were made in developing DecisionEdge. Potential commercial applications include training for crisis management, emergency response, disaster preparedness, and bioterror consequence management.
Using a Tightly-Coupled Pipeline in Dynamically Reconfigurable Platform FPGAs
Authors: Miguel L. Silva, Joao Canas Ferreira
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The paper describes the organization and use of a pipeline that is tightly-coupled to the CPU inside a platform FPGA with support for dynamic partial reconfiguration. It describes the overall hardware system organization and the pipeline structure, and presents the associated development environment and run-time support system, including the support for dynamically changing pipeline implementations and altering the operations of a pipeline stage.
Dynamic Helper Threaded Prefetching on the Sun UltraSPARC CMP Processor
Authors: Jiwei Lu, Abhinav Das, Wei-Chung Hsu, Khoa Nguyen, Santosh G. Abraham
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Data prefetching via helper threading has been extensively investigated on Simultaneous Multi- Threading (SMT) or Virtual Multi-Threading (VMT) architectures. Although reportedly large cache latency can be hidden by helper threads at runtime, most techniques rely on hardware support to reduce context switch overhead between the main thread and helper thread as well as rely on static profile feedback to construct the help thread code. This paper develops a new solution by exploiting helper threaded prefetching through dynamic optimization on the latest UltraSPARC Chip-Multiprocessing (CMP) processor. Our experiments show that by utilizing the otherwise idle processor core, a single user-level helper thread is sufficient to improve the runtime performance of the main thread without triggering multiple thread slices. Moreover, since the multiple cores are physically decoupled in the CMP, contention introduced by helper threading is minimal. This paper also discusses several key technical challenges of building a lightweight dynamic optimization/software scouting system on the UltraSPARC/Solaris platform.
A new approach for neural control of nonlinear discrete dynamic systems
Authors: Jose I. Canelon, Leang S. Shieh, Nicolaos B. Karayiannis
Venue: Information Sciences: an International Journal (2005)

This paper proposes a new approach to control nonlinear discrete dynamic systems, which relies on the identification of a discrete model of the system by a neural network. A locally equivalent optimal linear model is obtained from the neural network model at every operating point the system goes through during the control task. Based on the linear model, a linear state-space control design technique can be used to design a local control action to be applied at that particular operating point. The design procedure is repeated at every operating point of the system during the control task. The proposed approach was applied in three examples, which involved a linear and two nonlinear discrete single-input single-output (SISO) systems. In the first two examples, pole placement was chosen as the linear design technique. This method led to satisfactory tracking of the reference input but a steady-state error was present due to modeling inaccuracies. In the third example, the linear design technique involved an optimal control scheme with an integrator. This method led to satisfactory tracking of the reference input with zero steady-state error.
Computational Software: Writing Your Legacy
Authors: Dianne P. O'Leary
Venue: Computing in Science and Engineering (2006)

In scientific computing, we sometimes begin with a clean slate; we're given a new problem to solve, and we write software to accomplish the task. In this situation, we're the inventors. Other times, we work on a problem for which considerable software development has been done, often over a period of many years. The existing software might have had many authors, some of whom have moved on to other positions. In this situation, our job is more akin to detective work. We study the existing code, run examples to see how it behaves, and come to understand both what it does and how it does it.
Cyclone: A Novel Design Schema for Hierarchical DHTs
Authors: Marc Sanchez Artigas, Pedro Garcia Lopez, Jordi Pujol Ahullo, Antonio F. Gomez Skarmeta
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Recent research efforts have improved the existing flat Distributed Hash Tables to accommodate hierarchical structure. Nevertheless, many problems still remain to be solved regarding scalability issues, autonomous systems, connection degree, and network proximity. In this paper, we present a new Hierarchical DHT called Cyclone that aims to solve the aforementioned issues with a near-optimal architecture. Cyclone provides optimal logarithmic routing hops without establishing unnecessary connection links to other nodes. Our approach follows a horizontal and uniform leaf-based approach that considerably reduces the overall number of links per node. Furthermore, Cyclone also offers a disjoint multipath routing scheme that benefits from network proximity and thus creates a more robust overlay infrastructure.
Student research and the internet
Authors: Amy S. Bruckman
Venue: Communications of the ACM (2005)

To help students understand the art of research and the reliability of sources in the age of online information, we should teach them about the nature of `truth'.
Performance Comparison of Mirrored Disk Scheduling Methods with a Shared Non-Volatile Cache
Authors: A. Thomasian, C. Liu
Venue: Distributed and Parallel Databases (2005)

Mirrored disks or RAID1 is a popular disk array paradigm, which in addition to fault-tolerance, doubles the data access bandwidth. This is important in view of rapidly increasing disk capacities and the slow improvement in disk access time. Caching of dirty data blocks in a non-volatile storage (NVS) cache allows the destaging of dirty blocks to be deferrable, so as to improve the response time of read requests by giving them a higher priority than write requests. Destaging of dirty blocks in batches to take advantage of disk geometry entails in lowered disk utilization due to writes and improved performance for reads. Polyzois et al. [12] propose a scheduling policy for mirrored disks equipped with an NVS cache, so that one disk processes read requests, while the other disk is processing a write batch according to the CSCAN policy. We propose an improved scheduling policy as follows: (i) eliminating the forced idleness caused by the batch processing paradigm for write requests, i.e., allowing write requests to be processed individually; (ii) using SATF or even an exhaustive search, to reduce destaging time compared to CSCAN; (iii) introducing a threshold for the number of read requests, which when exceeded defers the destaging of dirty blocks. We compare these two scheduling policies with each other and also against prioritizing the processing of reads versus writes: (i) the head-of-the-line (HOL) priority queueing discipline, (ii) SATF with conditional priorities. It follows from simulation results that the new method outperforms Polyzois' method, which is even outperformed by the HOL priority policy. SATF with conditional priorities slightly outperforms the proposed method from the viewpoint of its throughput and response time, but is susceptible to more variability in response time.
A Model-driven Environment for Component Deployment
Authors: Petr Hnetynka
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper presents Deployment Factory, a modeldriven unified environment for deploying componentbased applications. While there are projects aiming to develop a unified deployment environment for component-based applications, none of them is generic enough - they do not support heterogeneous applications, they are targeted for a single component technology and/or impose modifications of the underlying technologies. The Deployment Factory targets all these issues. It is based on (i) the OMG Deployment and Configuration Specification [18], (ii) an analysis of contemporary used component technologies, and (iii) our experience from component-based development. Moreover, the paper also shows that a plain MDA approach (the one used in the OMG Deployment and Configuration specification) for building real systems is not always appropriate.
Dynamic microcell assignment for massively multiplayer online gaming
Authors: Bart De Vleeschauwer, Bruno Van Den Bossche, Tom Verdickt, Filip De Turck, Bart Dhoedt, Piet Demeester
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

With the number of players of massively multiplayer online games (MMOG) going beyond the millions, there is a need for an efficient way to manage these huge digital worlds. These virtual environments are dynamic and sudden increases in player density in a part of the world have an impact on the load of the server responsible for that section of the virtual world. In this paper we propose the division of the world into several interacting microcells that can be dynamically assigned to a set of servers. We outline the architecture of such a system and describe a set of algorithms that assign the microcells to the available servers. The maximum load experienced by a server is used as a minimization criterion. The different algorithms are compared with each other and with the standard approach used in these games.
A Tier 3 Software Defined AM Radio
Authors: Jung Ko, Vincent C. Gaudet, Robert Hang
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Software Defined Radio (SDR) is one of the key technologies in the wireless communication industry. A Tier-3 SDR,or Ideal Software Radio receiver is a device that performs all the demodulation (RF, IF and base-band) entirely in the digital domain. In this work we present the implementation and performance measurement of an AM receiver that belongs to this class of ideal software radios. The receiver is implemented in a Field Programmable Gate Array device.
Echology: an interactive spatial sound and video artwork
Authors: Meghan Deutscher, Reynald Hoskinson, Sachiyo Takashashi, Sidney Fels
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We present a novel way of manipulating a spatial soundscape, one that encourages collaboration and exploration. Through a table-top display surrounded by speakers and lights, participants are invited to engage in peaceful play with Beluga whales shown through a live web camera feed from the Vancouver Aquarium in Canada. Eight softly glowing buttons and a simple interface encourage collaboration with others who are also enjoying the swirling Beluga sounds overhead.
Using Gain Ratio Distance (GRD) to induce clustering
Authors: Claudio Ratke, Dalton Francisco de Andrade
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Clustering is a classification process in Data Mining, very used mainly for grouping of continuous values. The traditional techniques of clustering such as Fuzzy C-means clustering (FCM), create groups that don't have, many times, practical sense to the user. Relative Information Gain has been used with success in classification applications, for instance the induction of decision tree. Our goal is to modify the way how the distance is calculated among elements in the FCM algorithm, adding to the calculation the Relative Information Gain. The elements will be grouped according to a categorical field selected from the own training dataset. Therefore groups will be created and induced according to the Gain Criterion calculated among the elements and the categorical field.