ppxscal/embedding_network huggingface dataset:
Members' Identification with Multiple-Identity Organizations
Authors: Peter Foreman, David A. Whetten
Venue: Organization Science (2002)

In the field of organizational identity, theory development has far outpaced theory testing. Specifically, several researchers have proposed identity-based models of organizational identification but few have operationalized and tested them. Furthermore, virtually no research has explored how members identify with multiple-identity organizations. This study addresses these gaps and makes three specific contributions to identity theory. First, we operationalize and test a model in which a member's organizational identification is conceptualized in terms of an identity comparison process, i.e., a cognitive comparison between what a member perceives the identity to be and what they think it should be. Second, we extend current thinking by operationalizing organizational identification in terms of multiple and competing identities. Third, as a theory-building exercise, we explore the possibility that a similar identity comparison process operates at the organizational form level of analysis, affecting members' identification with the encompassing form or social institution. We test our model via a survey of members of rural cooperatives--a prototypical "hybrid" identity organizational form, embodying elements of both "business" and "family" identities. Results of the analyses show that organizational identity congruence has a significant effect on member commitment, and form-level identity congruence has significant effects on both cognitive and pragmatic legitimacy, lending support for the use of identity as a multilevel construct. These results provide empirical support for current identity-based models of organizational identification and expand their generalizability to include multiple-identity organizations.
A genetic algorithm for multiobjective optimization problems with fuzzy constraints
Authors: Luciano de Moura, Akebo Yamakami, Tatiane R. Bonfim
Venue: Second international workshop on Intelligent systems design and application (2002)

Fuzzy multiobjective optimization methods have been extensively applied to the modeling of real processes under influence of uncertainties. We propose a genetic algorithm based on a stable population technique to deal with the problem of fuzzy constraints. A set of optimization problems was used to test the algorithm and it proved to be very flexible and efficient.
Optimal Location Area Design to Minimize Registration Signaling Traffic in Wireless Systems
Authors: Erdal Cayirci, Ian F. Akyildiz
Venue: IEEE Transactions on Mobile Computing (2003)

In this paper, a new scheme is developed for optimal location area design in wireless systems. New algorithms based on intercell traffic prediction and traffic-based cell grouping are used to select the optimal set of cells for location areas (LAs). The expected intercell movement patterns of mobiles are determined by using the new intercell traffic prediction algorithm. Further, the cells are partitioned into LAs by applying the new traffic-based cell grouping algorithm where the cell pairs with higher intercell mobile traffic are grouped into the same LA. Hence, the inter-LA mobile traffic is decreased by increasing the intra-LA mobile traffic. Experimental results show that this cell grouping algorithm reduces the number of location updates by 27 percent to 36 percent on average compared to proximity-based cell grouping schemes.
Using transact-SQL and simulation techniques to create virtual M&M'S
Authors: Robin M. Snyder
Venue: Journal of Computing Sciences in Colleges (2002)

The M&M problem is an example of a nontrivial yet simple method for summarizing sampled data that are then used in making decisions. Previous work by the author used client-side JavaScript and Active Server Pages to create virtual M&M's. This paper moves the generation of the virtual M&M's to a SQL Server database server. In doing so, a number of interesting and practical problems in database design and implementation are explored. In particular, the use of the programming language Transact-SQL as used in SQL Server is used to create and test a database stored procedure to generate the requested M&M's and store them in a database table structure to be used by the requesting program. As such, the paper serves as a short introduction to database design as might be used in experimental data collection applications, programming in Transact-SQL and SQL as can be used with Query Analyzer, and in simulating discrete events.
Analyzing Website Privacy Requirements Using a Privacy Goal Taxonomy
Authors: Annie I. Antón, Julia Brande Earp, Angela Reese
Venue: Proceedings of the 10th Anniversary IEEE Joint International Conference on Requirements Engineering (2002)

Privacy has recently become a prominent issue in the context of electronic commerce websites. Increasingly, privacy policies posted on such websites are receiving considerable attention from the government and consumers. We have used goal-mining, to extract prerequirements goals from post-requirements text artifacts, as a technique for analyzing privacy policies. The identified goals are useful for analyzing implicit internal conflicts within privacy policies and conflicts with the corresponding websites and their manner of operation.These goals can be used to reconstruct the implicit requirements met by the privacy policies. This paper interrelates privacy policy and requirements for websites; it introduces a privacy goal taxonomy and reports the analysis of 23 Internet privacy policies for companies in three health care industries: pharmaceutical, health insurance and online drugstores. The evaluatedtaxonomy provides a valuable framework for requirements engineering practitioners, policy makers and regulatory bodies, and also benefits website users.
Proceedings of the 2003 ACM symposium on Software visualization
Venue: Software Visualization (2003)

Welcome to San Diego and the First ACM Symposium on Software Visualization. As an area, software visualization research has never had a true "home" conference. Over the years, various meetings and workshops about software visualization have occurred, but no meeting has persisted. This symposium is the culmination of those efforts, and we hope that it helps to form a community and promote the state-of-the-art in software visualization research. We intend for it to become an ongoing symposium and the permier venue for publishing timely research in the area.Software visualization encompasses the development and evaluation of methods for graphically representing different aspects of software, including its structure, its abstract and concrete execution, and its evolution. The goal of this symposium is to provide a forum for researchers from different backgrounds (HCI, software engineering, programming languages, visualization, computer science education) to discuss and present original research on software visualization. Attesting to the interdisciplinary nature of the research area, SOFTVIS'03 is supported by five ACM SIGs.We were pleased to receive 65 submitted papers to the symposium. Our Program Committee of 22 international experts reviewed all the submissions and selected 20 papers to appear. Additionally, the Program Committee selected a best paper. The conference program showcases these accepted papers, but it also includes a special demo/poster session and a number of informal breaks for attendees to meet and discuss shared interests.
Ethical codes and their effect on conduct
Authors: James Harris, Maeve Cummings, Christine Fogliasso
Venue: Journal of Computing Sciences in Colleges (2002)

The simplest and most visible way for an organization to show its commitment to ethics is to issue a code of ethics that encourages the organization members to behave in an ethical way. This study investigates the efficacy of a code of ethics in a hypothetical situation. It shows that even a brief exposure to a code of ethics can have the desired effect.
Knowledge management support for decision making in the pharmaceutical industry
Authors: Rick Gibson
Venue: Decision making support systems: achievements, trends and challenges for (2002)

The purpose of this chapter is to explore the practical application of knowledge management as an aid to decision making by pharmaceutical firms which comprise an industry that seems very well suited for knowledge management investigation. Although researchers assert that knowledge management has moved beyond fad status to become mainstream, practitioners remain skeptical and express major concerns regarding the ambiguity surrounding the sub-discipline associated with the management of knowledge. The major players in the pharmaceutical industry have already implemented knowledge management systems and therefore may experience a competitive advantage over other pharmaceutical companies. No attempt will be made in this chapter to suggest how the lessons learned from the pharmaceutical industry can be generalized to other industries.
Lingo and Macromedia director as knowledge management tools: the potential use of avatars in knowledge architectures
Authors: Bruce J. Neubauer
Venue: Journal of Computing Sciences in Colleges (2002)

Macromedia Director is the premier animation tool for creating digital multimedia for distribution on CD's and on the Web. The strengths of Director are its Lingo object-oriented programming language, its capacity to incorporate a variety of multimedia resources, and its integration with Shockwave for distribution on the Web. This paper proposes that Macromedia Director has the potential to be used as a knowledge management system. The possibility of using an avatar as the building block of a knowledge management system architectures is explored.
Extended - input neural network applications, implementation and learning
Authors: Wafik A. Wassef
Venue: Neural, Parallel Scientific Computations (2002)

By adding extra input nodes and connecting them through nonlinear elements to the original inputs, it became possible to realize a neural network for any desired output. All digital logic functions are produced by this simple circuit with minimum use of nonlinear circuits. The extension of this network to any number of input nodes is given as well. A direct method for writing down the exact inverse input matrix for this network, without any calculations is described. The implementation of the linear weights and their polarity is demonstrated. Some of the applications given are: adding and multiplying two 2-bit binary numbers, the square function and an encoder that assigns a single output to each of the input states. A learning technique for producing the weights between input and output of this encoder network and its analogy to biological chemical synapses between neurons in the hippocampus is discussed.
Characterization of aggregate fuzzy membership functions using Saaty's eigenvalue approach
Authors: Parag C. Pendharkar
Venue: Computers and Operations Research (2003)

This paper describes and extends Saaty's eigenvalue approach to fuzzy membership determination. A genetic algorithm-based procedure is adopted to minimize the failure rates in fuzzy membership determination using Saaty's eigenvalue approach. The proposed method is then extended to develop an aggregate fuzzy membership function using multiple decision-maker environment. A theoretical framework for understanding the magnitude of failures with the increase in the cardinality of fuzzy sets is provided.
Communications policy and information technology
Authors: Lorrie Faith Cranor, Shane Greenstein
Venue: Ubiquity (2003)

Policy analysis involves tempering enthusiasm with a sobering dose of reality.
Visual, interactive math on the web: bringing the abstract down to Earth
Authors: Kurt Cogswell
Venue: Journal of Computing Sciences in Colleges (2001)

It is one of the contradictions of modern mathematics that simple concepts often require lengthy, highly abstract explanations. In some cases, visual/interactive Java applets can be used to replace these explanations with pictures and experimentation, thus bringing the concepts within reach of undergraduates and high school students. As a bonus, these visual explanations often result in stunning graphic images. The advantages this approach will be explored, using a Web course taught by the workshop presenter as source material.
An efficient causal logging scheme for recoverable distributed shared memory systems
Authors: Taesoon Park, Inseon Lee, Heon Y. Yeom
Venue: Parallel Computing (2002)

This paper presents a causal logging scheme for the lazy release consistent distributed shared memory systems. Causal logging is a very attractive approach to provide the fault tolerance for the distributed systems, since it eliminates the need of stable logging. However, since the inter-process dependency must causally be transferred with the application messages, the excessive message overhead has been a drawback of this approach. In order to achieve an efficient implementation of causal logging for the distributed shared memory system, data structures and operations supported by the lazy release consistency memory model are utilized. As a result, the causal logging for the lazy release consistent distributed shared memory system can be implemented by adding the minimum information for the dependency tracking. To evaluate the performance of the proposed scheme, the proposed logging scheme has been implemented on top of the CVM distributed shared memory system. The experimental results show that the logging operation requires only 0.4-8.1% increases in the execution time.
Cutting planes in integer and mixed integer programming
Authors: Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence Wolsey
Venue: Discrete Applied Mathematics (2002)

This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for (i) general integer programs, (ii) problems with local structure such as knapsack constraints, and (iii) problems with 0-1 coefficient matrices, such as set packing, are examined in turn. Finally, the use of valid inequalities for classes of problems with structure, such as network design, is explored.
Measuring Factors that Influence the Success of Internet Commerce
Authors: Gholamreza Torkzadeh, Gurpreet Dhillon
Venue: Information Systems Research (2002)

Efforts to develop measures of Internet commerce success have been hampered by (1) the rapid development and use of Internet technologies and (2) the lack of conceptual bases necessary to develop success measures. In a recent study, Keeney (1999) proposed two sets of variables labeled asmeans objectives andfundamental objectives that influence Internet shopping. Means objectives, he argues, help businesses achieve what is important for their customers--fundamental objectives. Based on Keeney's work, this paper describes the development of two instruments that together measure the factors that influence Internet commerce success. One instrument measures the means objectives that influence online purchase (e.g., Internet vendor trust) and the other measures the fundamental objectives that customers perceive to be important for Internet commerce (e.g., Internet product value). In phase one of the instrument development process, we generated 125 items for means and fundamental objectives. Using a sample of 199 responses by individuals with Internet shopping experience, these constructs were examined for reliability and validity. The Phase 1 results suggested a 4-factor, 21-item instrument to measure means objectives and a 4-factor, 17-item instrument to measure fundamental objectives. In Phase 2 of the instrument development process, we gathered a sample of 421 responses to further explore the 2 instruments. With minor modifications, the Phase 2 data support the 2 models. The Phase 2 results suggest a 5-factor, 21-item instrument that measures means objectives in terms ofInternet product choice, online payment, Internet vendor trust, shopping travel, andInternet shipping errors. Results also suggest a 4-factor, 16-item instrument that measures fundamental objectives in terms ofInternet shopping convenience, Internet ecology, Internet customer relation, andInternet product value. Evidence of reliability and discriminant, construct, and content validity is presented for the hypothesized measurement models. The paper concludes with discussions on the usefulness of these measures and future research ideas.
Automatic reduction of elliptic integrals using Carlson's relations
Authors: Norman Gray
Venue: Mathematics of Computation (2002)

In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions. using a group of multivariate recurrence relations. These relations are, however, cumbersome to use by hand and, in the absence of a specific reductive algorithm, difficult to use with computer algebra. This paper presents such an algorithm, guaranteed to reduce a general elliptic integral to a set of fundamental ones.
Reducing register ports for higher speed and lower energy
Authors: Il Park, Michael D. Powell, T. N. Vijaykumar
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

The key issues for register file design in high-performance processors are access time and energy. While previous work has focused on reducing the number of registers, we propose to reduce the number of register ports through two proposals, one for reads and the other for writes. For reads, we propose bypass hint to reduce register port requirements by avoiding unnecessary register file reads for cases where values are bypassed. Current processors are unable to avoid these unnecessary reads due to timing constraints. For writes, we use register file banking. Current banking schemes assign different banks to instructions that are renamed together, which does not necessarily avoid conflicts among instructions that writeback together. We use decoupled rename, a technique which separates dependence and physical tagging of register operands. Decoupled rename allows us to perform physical register allocation just before writeback, avoiding bank conflicts. Our results show that combining bypass hint and write banking, our 1-cycle register file with 6 read ports, and two 4-write-ported banks achieves a 9% processor energy-delay savings over a system using a perfectly-pipelined, 2-cycle register file with 16 read ports and 8 write ports.
A note on graphs of class I
Authors: Zhou Guofei
Venue: Discrete Mathematics (2003)

A graph is said to be of class I if its chromatic index is equal to the maximum of degree of this graph. In this paper we show that every k-degenerate graph with Δ ≥ 2k is of class I; and that every plane graph with Δ = 6 and without 3, 4, or 5-cycles is of class I.
Optimizing Auto-Carrier Loading
Authors: Gerald Y. Agbegha, Ronald H. Ballou, Kamlesh Mathur
Venue: Transportation Science (1998)

Delivering automobiles, vans, and trucks to auto dealerships is a unique problem among the routing and scheduling problem class. A subproblem is that of loading the vehicles onto an auto-carrier (equipment specially designed for this purpose). Allocation of the vehicles to this equipment has typically been done by means of trial and error and heuristic methods. This paper shows how the loading aspect of the delivery problem can be solved using optimizing methods. The approach has the potential of replacing the empirical methods currently used in practice.
From Linear to Non-Linear Reading: A Case Study to Provide Internet Access to Paper Documents
Authors: Marcel Worring, Arnold W. M. Smeulders
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper we consider the construction of hypertext from scanned paper material. We consider textual links as well as text-figure and text-figure_label links. This process of hypertext creation encompasses a number of document structures and methods for going from one document representation to the other. These will be described and exemplified by a case study of turning a manual into an electronic hypertext book. We further discuss the Netscape based interface to the system. The hypermanual considered in this paper is accessible through our webpage.
JavaScript programming basics: a laboratory series for beginning programmers
Authors: Alyce Brady, R. C. McDowell, Kelly Schultz
Venue: Journal on Educational Resources in Computing (JERIC) (2002)

The JavaScript Programming Basics lab series presents elementary programming concepts using the JavaScript language. In particular, it introduces variables, functions, and event handlers, conditions, loops, arrays, decision trees, sequential search, and selection sort. Students build three different web pages or programs: a guestbook, an "expert advice system" or decision tree, and a CD order form. These labs would be appropriate in courses on web page development, broad overview ("CS 0") courses, or elementary programming courses.Altogether, the module consists of 3 programming labs and 5 shorter "minilabs" contained in 14 files, totaling less than 600KB.There are two categories of labs in the series.&bull; Minilabs are short, directed exercises that concentrate on a single concept, such as variables or conditions. A minilab should immediately follow the instructor's introduction of the associated topic (noted as the "prerequisites" to the lab).&bull; Programming labs are longer, and ask students to pull together several concepts in a more complex exercise.Since the purpose of the minilabs is immediate practice of new concepts immediately after they have been introduced, the instructions in the minilabs are more detailed and explicit than those in the full-length labs. The module also includes two supplemental programming projects that extend the decision tree lab and the CD order form labs.The JavaScript Programming Basics labs are meant to supplement instructor presentations, allowing students to apply new concepts through guided exercises. This page describes the pedagogical goals and prerequisites for each programming lab and minilab.
Algorithms for approximate conditional inference
Authors: John E. Kolassa
Venue: Statistics and Computing (2003)

This paper presents a method for listing the sample space for a conditional distribution in a discrete generalized linear model. This tabulation is used in conjunction with saddlepoint methods to approximate the associated conditional probabilities. These probabilities are used to calculate conditional p-values.
Applying data mining to intrusion detection: the quest for automation, efficiency, and credibility
Authors: Wenke Lee
Venue: ACM SIGKDD Explorations Newsletter (2002)

Intrusion detection is an essential component of the layered computer security mechanisms. It requires accurate and efficient models for analyzing a large amount of system and network audit data. This paper is an overview of our research in applying data mining techniques to build intrusion detection models. We describe a framework for mining patterns from system and network audit data, and constructing features according to analysis of intrusion patterns. We discuss approaches for improving the run-time efficiency as well as the credibility of detection models. We report the ideas, algorithms, and prototype systems we have developed, and discuss open research problems.