ppxscal/embedding_network huggingface dataset:
From patterns to frameworks to parallel programs
Authors: S. MacDonald, J. Anvik, S. Bromling, J. Schaeffer, D. Szafron, K. Tan
Venue: Parallel Computing (2002)

Object-oriented programming, design patterns, and frameworks are abstraction techniques that have been used to reduce the complexity of sequential programming. This paper describes our approach of applying these three techniques to the more difficult parallel programming domain. The Parallel Design Patterns (PDP) process, the basis of the CO2P3S parallel programming system, combines these techniques in a layered development model. The result is a new approach to parallel programming that addresses correctness and openness in a unique way. At the topmost developmem layer, a customized framework is generated from a design pattern specification of the parallel structure of the program. This framework encapsulates all of the structural details of the pattern, including communication and synchronization, to prevent programmer errors and ensure correctness. Lower layers are used only for performance tuning to make the code as efficient as necessary. This paper describes CO2P3S, based on the PDP process, and demonstrates it using an example application. We also provide results from a usability study of CO2P3S.
Quality factors for DMSS assessment: an application of research frameworks
Authors: Harold W. Webb, Surya B. Yadav
Venue: Decision making support systems: achievements, trends and challenges for (2002)

The objective of this chapter is to demonstrate the use of a decision support systems research (DSSR) framework to improve decision making support systems (DMSS) quality. The DSSR Framework, which was developed to integrate theoretical constructs from various information systems areas into a coherent theme, can serve as a tool for DMSS developers. Developed to provide a unified reference to theoretical constructs used in theory building and testing, the DSSR framework can also be used as the basis for the identification and selection of a hierarchy of factors potentially affecting the quality of DMSS development. The chapter proposes that a unified set of quality factors derived from the DSSR framework be used in tandem with the generic software quality metrics framework specified in IEEE Standard 1061-1992. The integration of these two frameworks has the potential to improve the process of developing high-quality decision making support systems and system components. The usage of these frameworks to identify system quality factors is demonstrated in the context of a military research and development project.
An ERP-client benefit-oriented maintenance taxonomy
Authors: Celeste See Pui Ng, Guy G. Gable, Taizan Chan
Venue: Journal of Systems and Software (2002)

The worldwide installed base of enterprise resource planning (ERP) systems has increased rapidly over the past 10 years now comprising tens of thousands of installations in large- and medium-sized organizations and millions of licensed users. Similar to traditional information systems (IS), ERP systems must be maintained and upgraded. It is therefore not surprising that ERP maintenance activities have become the largest budget provision in the IS departments of many ERP-using organizations. Yet, there has been limited study of ERP maintenance activities. Are they simply instances of traditional software maintenance activities to which traditional software maintenance research findings can be generalized? Or are they fundamentally different, such that new research, specific to ERP maintenance, is required to help alleviate the ERP maintenance burden? This paper reports a case study of a large organization that implemented ERP (an SAP system) more than three years ago. From the case study and data collected, we observe the following distinctions of ERP maintenance: (1) the ERP-using organization, in addition to addressing internally originated change-requests, also implements maintenance introduced by the vendor; (2) requests for user-support concerning the ERP system behavior, function and training constitute a main part of ERP maintenance activity; and (3) similar to the in-house software environment, enhancement is the major maintenance activity in the ERP environment, encompassing almost 64% of the total change-request effort. In light of these and other findings, we ultimately: (1) propose a clear and precise definition of ERP maintenance; (2) conclude that ERP maintenance cannot be sufficiently described by existing software maintenance taxonomies; and (3) propose a benefits-oriented taxonomy, that better represents ERP maintenance activities. Three salient dimensions (for characterizing requests) incorporated in the proposed ERP maintenance taxonomy are: (1) who is the maintenance source? (2) why is it important to service the request? and (3) what--whether there is any impact of implementing the request on the installed module(s)?
Interrelationship between Two Approaches to Analytical Design of the Optimal Controllers
Authors: S. P. Kruglov
Venue: Automation and Remote Control (2003)

Based on the physical control theory, comparison was carried out of two approaches to optimizing the dynamic controlled plant with the aim of achieving the desired performance of the closed loop formulated in engineering terms. The first approach is represented by the well-known method of analytical design of optimal controllers. The second approach makes use of an assembly of reference models pertaining to the given domain and of the conditional performance functional. It was shown to be more universal and efficient. Numerical examples were presented. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Representation models for aggregating linguistic information: issues and analysis
Authors: F. Herrera, E. Herrera-Viedma, L. Martínez
Venue: Aggregation operators: new trends and applications (2002)

The linguistic information has been used successfully in many areas. The aggregation of linguistic information is a crucial aspect. In the literature we can find different linguistic computational models that present linguistic aggregation operators as: (i) The computational model based on the Extension Principle, which operates over the fuzzy numbers that supports the semantics of the linguistic labels. (ii) The symbolic one makes the computations directly over the order index of the linguistic labels. And, (iii) the model based on the linguistic 2-tuple representation, which uses the symbolic translation to make the linguistic computations.Depending upon the linguistic aggregation model, different results can be obtained. In this chapter we shall make a comparative analysis of the aggregation approaches according to the results obtained in a decision-making application.
Biologically inspired Cartesian and non-Cartesian filters for attentional sequences
Authors: H. I. Bozma, G. Çakiroğlu, Ç. Soyer
Venue: Pattern Recognition Letters (2003)

The aim of this paper is to develop a rich set of visual primitives that can be used by a camera-endowed robot as it is exploring a scene and thus generating an attentional sequence--spatio-temporally related sets of visual features. Our starting point is inspired by the work of Gallant et al. on the area V4 response of the macaque monkeys to Cartesian and non-Cartesian stimuli. The novelty of these stimuli is that in addition to the conventional sinusoidal gratings, they also include non-Cartesian stimuli such as circular, polar and hyperbolic gratings. Based on this stimulus set and introducing frequency as a parameter, we obtain a rich set of visual primitives. These visual primitives are biologically motivated, nearly orthogonal with some degree of redundancy, can be made complete as required and yet implementable on off-the-shelf hardware for real-time selective vision-robot applications. Attentional sequences are then formed as a spatio-temporal sequence of observations--each of which encodes the filter responses of each fovea as an observation vector consisting of responses of 50 filters. A series of experiments serve to demonstrate the use of these visual primitives in attention-based real-life scene recognition tasks: (1) modeling complex scenes based on average attentional sequence responses and (2) fast real-time recognition of relatively complex scenes with a few saccades-- based on the comparison of the current attentional sequence to the a priori learned average observation vectors.
Combining IS Research Methods: Towards a Pluralist Methodology
Authors: John Mingers
Venue: Information Systems Research (2001)

This paper puts forward arguments in favor of a pluralist approach to IS research. Rather than advocating a single paradigm, be it interpretive or positivist, or even a plurality of paradigms within the discipline as a whole, it suggests that research results will be richer and more reliable if different research methods, preferably from different (existing) paradigms, are routinely combined together. The paper is organized into three sections after the Introduction. In Â§2, the main arguments for the desirability of multimethod research are put forward, while Â§3 discusses its feasibility in theory and practice. Â§4 outlines two frameworks that are helpful in designing mixed-method research studies. These are illustrated with a critical evaluation of three examples of empirical research.
Nonlinear SOR and mesh redistribution
Authors: Tsu-Fen Chen, Miao-Chen Ke
Venue: Journal of Computational and Applied Mathematics (2003)

This article concerns the numerical approximations for the problems of minimizing strict convex functionals. The functionals are discretized by the finite-element methods and then solved by the nonlinear SOR with an optimal mesh. The redistribution approach is considered to generate the optimal mesh. With an optimal mesh, the number of unknowns can be dramatically reduced and this generally gives a computationally efficient model. Numerical results of the model catenoid problem and a geodesics problem illustrating the efficiency of the optimal mesh approach in the nonlinear SOR will be presented.
Gaze- vs. hand-based pointing in virtual environments
Authors: Nathan Cournia, John D. Smith, Andrew T. Duchowski
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper contributes to the nascent body of literature on pointing performance in Virtual Environments (VEs), comparing gaze- and hand-based pointing. Contrary to previous findings, preliminary results indicate that gaze-based pointing is slower than hand-based pointing for distant objects.
Fusion: interactive coordination of diverse data, visualizations, and mining algorithms
Authors: Chris North, Nathan Conklin, Kiran Indukuri, Varun Saini, Qiang Yu
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Fusion is a web-based system that enables end-users to rapidly and dynamically construct personalized visualization workspaces without programming. Users first use advanced data schemas to link diverse data sources. Then they use visualization schemas to coordinate visualization components and data-mining algorithms according to the unique needs of their data and tasks. They create a custom interactive visualization workspace that can be published on the web. This is accomplished through the Fusion model and user interface that is based on schema concepts that are easy to learn and simple to use.
The neurally controllable internet browser (BrainBrowser)
Authors: Opé Tomori, Melody Moore
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The Internet has become an important part of our daily lives, with browsers serving as the main tool of navigation. For users with severe disabilities, access to the Internet can be crucial to quality of life, providing a myriad of services and opportunities. The GSU BrainLab is researching methods of controlling computer interfaces directly with brain signals, to assist users who are completely paralyzed and have no other means of interaction. Adapting a web browser for neural control provides us a unique opportunity to study navigation issues for assistive technology. The Neural Internet BrainBrowser project is currently exploring new human computer interaction paradigms, web usability concepts, and interface serialization techniques.
A Model for Mobile Code Using Interacting Automata
Authors: Richard R. Brooks, Nathan Orr
Venue: IEEE Transactions on Mobile Computing (2002)

The Internet supports migration of code from node to node. A number of paradigms exist for distributed computing and mobile code, including client/server, remote evaluation, code-on-demand, and mobile agents. We find them overly-restrictive views of reality. We propose a model that can express previous paradigms as special cases. We derive a model using Cellular Automata (CA) abstractions to study relations between local node behavior and global system behavior. Example mobile code systems are provided and existing paradigms are expressed in terms of the model. These examples include network attacks such as viruses, worms, and Distributed Denial of Service (DDoS). A distributed system simulation tool based on the model is described. Simulation results provide insights gained from this work.
On Space-Time Block Codes from Complex Orthogonal Designs
Authors: Weifeng Su, Xiang-Gen Xia
Venue: Wireless Personal Communications: An International Journal (2003)

Space-time block codes from orthogonal designs recently proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted considerable attention due to the fast maximum-likelihood (ML) decoding and the full diversity. There are two classes of space-time block codes from orthogonal designs. One class consists of those from real orthogonal designs for real signal constellations which have been well developed in the mathematics literature. The other class consists of those from complex orthogonal designs for complex constellations for high data rates, which are not well developed as the real orthogonal designs. Since orthogonal designs can be traced back to decades, if not centuries, ago and have recently invoked considerable interests in multi-antenna wireless communications, one of the goals of this paper is to provide a tutorial on both historical and most recent results on complex orthogonal designs. For space-time block codes from both real and (generalized) complex orthogonal designs (GCODs) with or without linear processing, Tarokh, Jafarkhani and Calderbank showed that their rates cannot be greater than 1. While the maximum rate 1 can be reached for real orthogonal designs for any number of transmit antennas from the Hurwitz&ndash;Radon constructive theory, Liang and Xia recently showed that rate 1 for the GCODs (square or non-square size) with linear processing is not reachable for more than two transmit antennas. For GCODs of square size, the designs with the maximum rates have been known, which are related to the Hurwitz theorem. In this paper, We briefly review these results and give a simple and intuitive interpretation of the realization. For GCODs without linear processing (square or non-square size), we prove that the rates cannot be greater than 3/4 for more than two transmit antennas.
Human factors and the systems development process
Authors: Julie Fisher
Venue: Socio-technical and human cognition elements of information systems (2003)

Internet systems have the potential to reach a huge and unknown audience. How easy a system is to use will usually determine its success or failure and consequently the business and yet the human factors elements of systems are rarely considered. Usability describes the ease with which people can use a system to complete a task. It is often the case however that development teams focus more on the technology and less on the users when designing systems resulting in software that is not useable and therefore does not satisfy users' need. This chapter presents recent research, which examines one approach to developing a web-based information system and demonstrates how the composition of the development team through the inclusion of people with an understanding of user needs is important to the quality of the final product and ultimately the success of the system.
Analysis of high-field RF coils using the method of lines
Authors: Gene Bodganov, Reinhold Ludwig
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

The method of lines is described as a novel and powerful way to analyze radio frequency (RF) coils for high-field magnetic resonance imaging. Originally developed for optical and microwave circuits, this method enables a full-wave solution to Maxwell's field equations without the computational burden of pure finite element or finite difference methods. Because only two of the three geometric dimensions are discretized, while seeking an analytic solution in the remaining space dimension, an efficient solution can be obtained at reasonable geometric restrictions. After outlining the theoretical formulation and the computer implementation of this technique, we will apply it to the modeling of microstrip RF transverse electromagnetic resonator coils at 200 and 400 MHz as well as a high-pass shielded birdcage resonator and a single-loop surface coil. With single-frequency solutions obtainable within 5-10 s on a personal computer, the approach proves highly suitable as a design tool and for rapid prototyping.
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
Authors: Joanne Yates, Wanda J. Orlikowski, Kazuo Okamura, S. Thomas McCormick
Venue: Operations Research (1999)

Chen (1994) develops an attractive variant of the classical problem of preemptively scheduling independent jobs with release dates and due dates. Chen suggests that in practice one can often pay to reduce the processing requirement of a job. This leads to two parametric max flow problems. Serafini (1996) considers scheduling independent jobs with due dates on multiple machines, where jobs can be split among machines so that pieces of a single job can execute in parallel. Minimizing the maximum tardiness again gives a parametric max flow problem. A third problem of this type is deciding how many more games a baseball team can lose part way through a season without being eliminated from finishing first (assuming a best possible distribution of wins and losses by other teams). A fourth such problem is an extended selection problem of Brumelle et al. (1995a), where we want to discount the costs of "tree-structured" tools as little as possible to be able to process all jobs at a profit. It is tempting to try to solve these problems with the parametric push-relabel max flow methods of Gallo et al. (GGT) (1989). However, all these applications appear to violate the conditions necessary to apply GGT. We extend GGT in three ways that allow it to be applied to all four of the above applications. We also consider some other applications where these ideas apply. Our extensions to GGT yield faster algorithms for all these applications.
The Co-Evolution of Strategic Alliances
Authors: Mitchell P. Koza, Arie Y. Lewin
Venue: Organization Science (1998)

This paper proposes a co-evolutionary theory of strategic alliances. The paper proposes a framework which views strategic alliances in the context of the adaptation choices of a firm. Strategic alliances, in this view, are embedded in a firm's strategic portfolio, and co-evolve with the firm's strategy, the institutional, organizational and competitive environment, and with management intent for the alliance. Specifically, we argue that alliance intent may be described, at any time, as having either exploitation or exploration objectives. We further discuss how the morphology of an alliance-absorptive capacity, control, and identification-may be isomorphic with its intent, and, in the aggregate, drive the evolution of the population of alliances.
Adaptive and efficient mutual exclusion
Authors: Hagit Attiya, Vita Bortnikov
Venue: Distributed Computing (2002)

This paper presents adaptive algorithms for mutual exclusion using only read and write operations; the performance of the algorithms depends only on the point contention, i.e., the number of processes that are concurrently active durhag the algorithm execution (and not on n, the total number of processes). Our algorithm has O(k) remote step complexity and O(log k) system response time. where k is the point contention. The remote step complexity is the maximal number of steps performed by a process where a wait is counted as one step. The system response time is the time interval between subsequent entries to the critical section, where one time unit is the minimal interval in which every active process performs at least one step. The space complexity of this algorithm is O(Nlog n), where N is the range of processes' names. We show how to make the space complexity of our algorithm depend solely on n, while preserving the other performance measures of the algorithm.
Red Light, Green Light: Making Sense of the Organizational Context for Issue Selling
Authors: Jane E. Dutton, Susan J. Ashford, Katherine A. Lawrence, Kathi Miner-Rubino
Venue: Organization Science (2002)

This paper analyzes the contextual cues female managers attend to when considering raising gender-equity issues at work. Study 1 provides a qualitative look at the range of cues indicating context favorability, including demographic patterns, top management qualities, and cultural exclusivity. Study 2 experimentally manipulates these cues and reveals that the exclusiveness of organizational culture is the most potent cue affecting willingness to sell a gender-equity issue. A discussion of mediators sheds lights on why cultural exclusivity affects issue selling.
More Flexible Data Types
Authors: Mike Spreitzer, Andrew Begel
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

XML can play several roles in a distributed object system. In particular, data can be serialized in XML-based formats. XML-encoded data can be more self-describing than data encoded in many more traditional ways, which facilitates the kind of decentralized protocol evolution seen in Internet-scale development: XML's explicit "tagging and bagging" helps keep extensions straight. However, today's common distributed object systems have type systems that are not flexible enough to describe such data. We suggest a way to make more flexible data types; this improves distributed object systems in general, and is critical to realizing XML's full potential. This approach has: (1) typing judgements based on type structure instead of type identity, (2) extensible record types with optional fields, (3) coarse record types, for which extension is compatible with subtyping, and (4) non-ignorable fields in record values.
Machine "Learning" at all course levels
Authors: David L. Parker
Venue: Journal of Computing Sciences in Colleges (2003)

A relatively simple program, for example one which plays a trivial game, can be used to lead meaningful discussions about computer learning and thinking at a variety of undergraduate levels. In particular showing how simple machines "learn" introduces students to artificial intelligence. In addition to being fun, this approach provokes thought and discussion among the students. More importantly, the students continue to discuss and think about this topic months (even years!) after it is presented in class. Many Artificial Intelligence concepts are not beyond these students' abilities and they make early computer science courses more interesting. Finally the absence of clear answers to many of the questions challenges the students to think.