ppxscal/embedding_network huggingface dataset:
Geographic information systems research and data centers
Authors: John Abresch
Venue: Building a virtual library (2003)

The use of geographic information in a variety of research and educational endeavors has created a number of challenges involving data management and dissemination in support of educational processes. Academic libraries, using computing services and virtual libraries, have provided a framework for supporting the use of geographic information within academic communities. This chapter examines the development and implementation of a Geographic Information Systems (GIS) Research and Data Center within the digital environment of a "virtual library" in a large urban university. The chapter will also highlight specific organizational, design, and technical aspects of three exemplary digital geospatial centers, which served as the basis for creating a model GIS Center. In addition, federal data standards and issues for cataloguing geospatial data will be examined. The chapter concludes with a discussion of future issues and technological challenges for GIS Research and Data Centers.
Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
Authors: Attahiru Sule Alfa, Jungong Xue, Qiang Ye
Venue: Mathematics of Computation (2002)

If each off-diagonal entry and the sum of each row of a diagonally dominant M-matrix are known to certain relative accuracy, then its smallest eigenvalue and the entries of its inverse are known to the same order relative accuracy independent of any condition numbers. In this paper, we devise algorithms that compute these quantities with relative errors in the magnitude of the machine precision. Rounding error analysis and numerical examples are presented to demonstrate the numerical behaviour of the algorithms.
Palmprint recognition using eigenpalms features
Authors: Guangming Lu, David Zhang, Kuanquan Wang
Venue: Pattern Recognition Letters (2003)

In this paper, we propose a palmprint recognition method based on eigenspace technology. By means of the Karhunen-Loeve transform, the original palmprint images are transformed into a small set of feature space, called "eigenpalms", which are the eigenvectors of the training set and can represent the principle components of the palmprints quite well. Then, the eigenpalm features are extracted by projecting a new palmprint image into the subspace spanned by the "eigenpalms", and applied to palmprint recognition with a Euclidean distance classifier. Experimental results illustrate the effectiveness of our method in terms of the recognition rate.
Conducting an internal program review in CIS: methods & results
Authors: Robert E. Beasley
Venue: Journal of Computing Sciences in Colleges (2002)

The purpose of this article is to describe the 15 activities we carried out when conducting our own internal CIS program review. This review was aimed at improving our curriculum and instructional practices. In this article, we include excerpts from our finished document as well as other artifacts that will help illustrate our approach. In addition, we note, in hindsight, some of the weaknesses of our review and how we might improve the process next time. Finally, we report what we learned about ourselves and explain why we are hopeful that this process will serve as an impetus for real change.
Cycle-balance conditions for distance-regular graphs
Authors: Aaron Meyerowitz
Venue: Discrete Mathematics (2003)

In a distance-regular graph, the partition with respect to distance from a vertex supports a unique eigenvector for each eigenvalue. There may be non-singleton vertex sets whose corresponding distance partition also supports eigenvectors. We consider the members of three families of distance regular graphs, the Johnson Graphs, Hamming Graphs and Complete Multipartite graphs. For each we determine all such sets which support an eigenvector for the next to largest eigenvalue. These sets exhibit the underlying geometric structure of the graph.
Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers
Authors: Gail Hohner, John Rich, Ed Ng, Grant Reid, Andrew J. Davenport, Jayant R. Kalagnanam, Ho Soo Lee, Chae An
Venue: Interfaces (2003)

Simple auctions neglect the complex business constraints required by strategic sourcing. The Mars-IBM team created a procurement auction Web site that enables buyers to incorporate complex bid structures (such as bundled all-or-nothing bids and quantity-discounted bids) and business constraints into strategic-sourcing auctions. Outcomes in such auctions must lead to win-win solutions to sustain long-term relationships between procurer and suppliers. These factors are as important or more important than price. The Mars procurement auction Web site supports several alternatives to simple auctions that help match its needs as procurer and the capabilities of suppliers by incorporating optimal bid selection subject to constraints based on business rules in a dynamic environment. The ability to consider geographic, volume, and quality factors helps both parties. Feedback from participant suppliers has highlighted the benefits of time efficiency, transparency, and fairness. Although they reflect just one side of the benefits ledger, the monetary benefits to Mars (a $14 billion company) and to its suppliers are significant.
Value-Focused Thinking in a Difficult Context: Planning Tourism for Guimaras, Philippines
Authors: Timothy Mcdaniels, William Trousdale
Venue: Interfaces (1999)

We used value-focused thinking as a framework for planning tourism in Guimaras, Philippines. Our objective was to help government officials and stakeholders devise new strategies for developing rural tourism. The developing-world setting and a pre-existing commitment to a planning alternative that faced severe obstacles made our work difficult. We clarified the planning context, assessed the tourism market potential, and structured objectives with a series of interviews. In a multi-stakeholder workshop, the objectives were ranked and weighted, and new alternatives were developed. Tourism planning in Guimaras has been substantially changed as a result of these activities, with two new approaches being pursued. This case study, and our past experience, suggest value-focused thinking is useful "decision therapy."
Convergence of the Stochastic Weighted Particle Method for the Boltzmann Equation
Authors: Ingo Matheis, Wolfgang Wagner
Venue: SIAM Journal on Scientific Computing (2002)

This paper studies convergence of the stochastic weighted particle method for the Boltzmann equation. First the method is extended by introducing new stochastic reduction procedures in order to control the number of simulation particles. Then, under rather general conditions, convergence to the solution of the Boltzmann equation is proved. Finally, numerical experiments are performed illustrating both convergence and considerable variance reduction for the specific problem of calculating tails of the velocity distribution.
Compact and noncompact structures in a class of nonlinearly dispersive equations
Authors: Abdul-Majid Wazwaz, Thiab Taha
Venue: Mathematics and Computers in Simulation (2003)

In this work, we study compact and noncompact dispersive structures formed by a class of nonlinear dispersive equations. We show that the focusing branches provide compactons solutions: solitons with compact support. We also show that the defocusing branches generate solitary patterns solutions. We test our work for a variety of nonlinear equations with positive and negative exponents.
Dynamic Airline Revenue Management with Multiple Semi-Markov Demand
Authors: Shelby Brumelle, Darius Walczak
Venue: Operations Research (2003)

When a customer requests a discount fare, the airline must decide whether to sell the seat at the requested discount or to hold the seat in hope that a customer will arrive later who will pay more. We model this situation for a single-leg flight with multiple fare classes and customers who arrive according to a semi-Markov process (possibly nonhomogeneous). These customers can request multiple seats (batch requests) and can be overbooked. Under certain conditions, we show that the value function decreases as departure approaches. If each customer only requests a single seat or if the requests can be partially satisfied, then we show that there are optimal booking curves which decrease as departure approaches. We also provide counterexamples to show that this structural property of the optimal policy need not hold for more general arrival processes if the requests can be for more than one seat and must be accepted or rejected as a whole.
An Illustrative Application of Idea (Imprecise Data Envelopment Analysis) to a Korean Mobile Telecommunication Company
Authors: William W. Cooper, Kyung Sam Park, Gang Yu
Venue: Operations Research (2001)

Data Envelopment Analysis (DEA) models, as ordinarily employed, assume that the data for all inputs and outputs are known exactly. In some applications, however, a number of factors may involve imprecise data, which take forms such as ordinal rankings and knowledge only of bounds. Here we provide an example involving a Korean mobile telecommunication company. The Imprecise Data Envelopment Analysis (IDEA) method we use permits us to deal not only with imprecise data and exact data but also with weight restrictions as in the (now) widely used "Assurance Region" (AR) and "cone-ratio envelopment" approaches to DEA. We also show how to transform AR bounds on thevariables, obtained from managerial assessments, for instance, intodata adjustments. This involves an extended IDEA model, which we refer to as AR-IDEA. All these uses are illustrated by an example application directed to evaluate efficiencies of branch offices of a telecommunication company in Korea.
Towards a neurally-inspired computer architecture
Authors: Michael A. Arbib
Venue: Natural Computing: an international journal (2003)

The first two main rounds of neural computing focused on adaptation and self-organization in neural networks, and on use of analog VLSI for compartmental modeling of the neuron, respectively. This paper is a prospectus for a third round of neural computing: analyzing the architecture of the primate brain to extract neural information processing principles and translate them into biologically-inspired operating systems and computer architectures. The way in which the cerebellum interacts with other brain regions in learning how to better control and coordinate movements provides a case study to introduce key ideas for these three rounds of neural computation. It is argued that the third round will develop and exploit general insights into brain architectures, their function and dynamics, that will provide a principled combination of cooperative computation, learning and perceptual robotics (i.e., the integration of action, perception and computation). This new effort is motivated by recent advances in computational neuroscience research, studying examples of system evolution ranging from low-level vision to how the interactions between frontal and parietal cortices serve action recognition (the mirror system), and language. The paper also notes the vast difference between the slow biological evolution of diverse brains and the needs of computer technology for explicit tools for the design and testing of novel programs and architectures, and suggests the challenges of developing a reflection methodology for wrapping modules with descriptions that can be automatically updated as the module itself adapts through learning. The Appendix provides a road map for approaching the voluminous literature on brain theory and neural networks.
Convergence of the shifted QR algorithm for unitary Hessenberg matrices
Authors: Tai-Lin Wang, William B. Gragg
Venue: Mathematics of Computation (2002)

This paper shows that for unitary Hessenberg matrices the QR algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.
Power efficiency of voltage scaling in multiple clock, multiple voltage cores
Authors: Anoop Iyer, Diana Marculescu
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Due to increasing clock speeds, increasing design sizes and shrinking technologies, it is becoming more and more challenging to distribute a single global clock throughout a chip. In this paper we study the effect of using a Globally Asynchronous Locally Synchronous (GALS) organization for a superscalar, out-of-order processor, both in terms of power and performance. To this end, we propose a novel modeling and simulation environment for multiple clock cores with static or dynamically variable voltages for each synchronous block. Using this design exploration environment we were able to assess the power/performance tradeoffs available for Multiple Clock, Single Voltage (MCSV), as well as Multiple Clock, Dynamic Voltage (MCDV) cores. Our results show that MCSV processors are 10% more power efficient when compared to single-clock single voltage designs with a performance penalty of about 10%. By exploiting the flexibility of independent dynamic voltage scaling the various clock domains, the power efficiency of GALS designs can be improved by 12% on average, and up to 20% more in select cases. The power efficiency of MCDV cores becomes comparable with the one of Single Clock, Dynamic Voltage (SCDV) cores, while being up to 8% better in some cases. Our results show that MCDV cores consume 22% less power at an average 12% performance loss.
Convergence of finite difference methods for convection-diffusion problems with singular solutions
Authors: Qing Fang
Venue: Journal of Computational and Applied Mathematics (2003)

We are concerned with initial-boundary value problems of convection-diffusion equations in a square, whose solutions have unbounded derivatives near the boundary. By using finite difference approximations with respect to spatial variables and an implicit method with respect to the time variable, it is shown that the numerical solution is convergent if the derivatives go to infinity under proper conditions. Furthermore, the convergence of numerical solution can be accelerated if the mesh points are some functions of equidistant mesh points.
Analytical observations for a multiservice node
Authors: Wen-Jung Hsin, Appie van de Liefvoort
Venue: Performance Evaluation (2003)

Motivated by a desire to understand a GI/∞ node in a closed queueing network environment, we study in this paper a finite population multiserver model, where the number of processes is equal to the population in the network. We study its steady-state behavior under various scenarios, e.g., the first three moments of the arrival and service distributions. We show that when the arrivals are bursty, an increase in service time variation can actually decrease congestion. Furthermore, such a decrease is also observed for an increase in the skewness in the arrivals. Additionally, several insensitivity properties in limiting behaviors are observed. In particular, the finite population GI/GI///s-loop is insensitive to the service time distribution when the arrival distribution either has an infinite variance (a form of heavy tail), or is highly skewed. In the latter case, the congestion approaches that of the all Markovian system M/M///s-loop. We conclude that the influence of the third moment can be very significant, indicating that the first two moments do not suffice to characterize the performance measures under consideration.
Evolving hypermedia systems: a layered software architecture
Authors: Lina García-Cabrera, María José Rodríguez-Fórtiz, José Parets-Llorca
Venue: Journal of Software Maintenance: Research and Practice (2002)

Hypermedia systems are evolutionary in nature. This paper presents SEM-HP, a model based on a semantic, systemic and evolutionary perspective, which facilitates the management of hypermedia evolution during the whole lifecycle process. Following the model the architecture of hypermedia systems can be conceived as composed of three sub-systems (conceptual, presentation and navigation) and two abstraction levels, the system level and the meta level (the first used by the reader and the second by the designer). The objective of this division is to achieve a good separation of concerns both in the development and in the evolution processes and to obtain a better understanding, thus facilitating the further development of tools.
A nonstandard finite difference scheme for the diffusionless Burgers equation with logistic reaction
Authors: Ronald E. Mickens
Venue: Mathematics and Computers in Simulation (2003)

A nonstandard finite difference scheme is constructed for the Burgers partial differential equation having no diffusion and a nonlinear logistic reaction term. This scheme preserves the positivity and boundedness properties of the original differential equation and includes the a priori requirement of being semi-explicit. Several other nonstandard discretizations are constructed and their mathematical structures discussed. All of these schemes can be used to calculate numerical solutions for traveling waves problems involving phenomena modeled by the original differential equation.
A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure
Authors: Gregory D. Glockner, George L. Nemhauser
Venue: Operations Research (2000)

We consider a dynamic network flow problem where the arc capacities are random variables. This gives a multistage stochastic linear program. We describe the randomness using a multi-scenario approach. Because of the multilayered structure, there are several ways to decompose the linear program. We classify different decomposition schemes, and we develop a scheme calledcompath decomposition, which is derived from path decomposition for network flows. We give a polynomial-time algorithm to find a cheapest compath that can solve the subproblems resulting from compath decomposition. Finally, compath decomposition is extended to multicommodity flow problems.
Collaborative and cooperative learning for the computer science classroom
Authors: Rebecca H. Rutherfoord
Venue: Journal of Computing Sciences in Colleges (2002)

This workshop will cover several aspects of Collaborative/Cooperative Learning in the Computer Science classroom. It will include 1) learning assumptions, 2) goals for education, 3) collaborative learning approaches, 4) from traditional to cooperative learning groups, 5) how to implement collaborative/cooperative learning in the classroom, and 6) commonly used cooperative learning techniques.
Learning Curve: A Simulation-Based Approach to Dynamic Pricing
Authors: Joan Morris Dimicco, Pattie Maes, Amy Greenwald
Venue: Electronic Commerce Research (2003)

By employing dynamic pricing, sellers have the potential to increase their revenue by selling their goods at prices customized to the buyers' demand, the market environment, and the seller's supply at the moment of the transaction. As dynamic pricing becomes a necessary competitive maneuver, and as market mechanisms become more complex, there is a growing need for software agents to be used to automate the task of implementing instantaneous price changes. But prior to using dynamic pricing agents, sellers need to understand the implications of agent pricing strategies on their marketplaces. The following article presents the Learning Curve Simulator, a market simulator designed for analyzing agent pricing strategies in markets under finite time horizons and fluctuation buyer demand. Through an in-depth description of the simulator's capabilities and an example of strategy analysis, we demonstrate the strength of a simulation-based approach to understanding agent pricing strategies.
The Concept and Dynamics of Face: Implications for Organizational Behavior in Asia
Authors: Joo Yup Kim, Sang Hoon Nam
Venue: Organization Science (1998)

Research on cross-cultural psychology, sociology, and anthropology suggests that the influence of face on social interactions is both pervasive and powerful in Asia. Face, however, has not gai ned general acceptance as an important theoretical concept in the literature on Asian organizational behavior and management. In this paper, we propose face as a key variable that can explain much of the complexity of social interactions in Asian organizations. We attempted to elaborate on the concept and dynamics of face in Asia in such a way as to capture its pervasive, significant but often subtle influences on organizational behavior. We also examined conditions, functions, and consequences of face dynamics to generate testable propositions for future research. We argue that scholars have to go beyond the individualistic assumptions about human behavior implicit in theories of organizational behavior in the West to better understand the richness of organizational behavior in Asia. In Asia, organizational behavior is better predicted by an individual's external attributes such as face than internal attributes such as desires, emotions, and cognition.
Assessing User Competence: Conceptualization and Measurement
Authors: Barbara L. Marcolin, Deborah R. Compeau, Malcolm C. Munro, Sid L. Huff
Venue: Information Systems Research (2000)

Organizations today face great pressure to maximize the bene its from their investments in information technology (IT). They are challenged not just to use IT, but to use it as effectively as possible. Understanding how to assess the competence of users is critical in maximizing the effectiveness of IT use. Yet theuser competence construct is largely absent from prominent technology acceptance and it models, poorly conceptualized, and inconsistently measured. We begin by presenting a conceptual model of the assessment of user competence to organize and clarify the diverse literature regarding what user competence means and the problems of assessment. As an illustrative study, we then report the findings from an experiment involving 66 participants. The experiment was conducted to compare empirically two methods (paper and pencil tests versus self-report questionnaire), across two different types of software, or domains of knowledge (word processing versus spreadsheet packages), and two different conceptualizations of competence (software knowledge versus self-efficacy). The analysis shows statistical significance in all three main effects. How user competence is measured, what is measured, what measurement context is employed:all influence the measurement outcome. Furthermore, significant interaction effects indicate that different combinations of measurement methods, conceptualization, and knowledge domains produce different results. The concept of frame of reference, and its anchoring effect on subjects' responses, explains a number of these findings. The study demonstrates the need for clarity in both defining what type of competence is being assessed and in drawing conclusions regarding competence, based upon the types of measures used. Since the results suggest that definition and measurement of the user competence construct can change the ability score being captured, the existing information system (IS) models of usage must contain the concept of an ability rating. We conclude by discussing how user competence can be incorporated into the Task-Technology Fit model, as well as additional theoretical and practical implications of our research.