ppxscal/embedding_network huggingface dataset:
Selection of hydrocarbon variables to assess reduction of residual oil on nutrient enriched beaches
Authors: Charles D. Bonham
Venue: Applied Mathematics and Computation (2002)

The United States Environmental Protection Agency (USEPA) initiated a study of bioremediation to further reduce oil on contaminated beaches after the March 1989 Exxon Valdez oil spill in Prince William Sound, Alaska. Effects of two methods for delivering mixtures of nitrogen and phosphorus fertilizers to oiled beaches were compared to a control. Several forms of hydrocarbon variables were selected as indicators of fertilizer effects in reducing residual oil amounts over that which would disappear by natural causes. The resulting data set was analyzed by multivariate statistical procedures to illustrate a protocol for selection of an optimum set of variables to assess reduction of residual oil through nutrient enrichment applications and to determine statistically significant differences among the treatment application methods. One subset of variables, nC18, phytane, and the sum of amounts of hydrocarbons nC18-nC27, was effective for prediction of amount of residual oil while another subset of variables, phytane, nC22, ratio of nC18/phytane, and residual dry oil, was successful for distinguishing differences in treatments by multivariate analysis of variance and its' associated canonical analysis. The ranked order of differences from small to large in variable responses to fertilization application methods were control, liquid-solid application, and sprinkler application of nitrogen and phosphorus fertilizers.
Integrating formal verification into computer organization and architecture courses
Authors: Lubomir Ivanov
Venue: Journal of Computing Sciences in Colleges (2002)

The high complexity of modern hardware and software systems necessitates the use of formal methods for checking the satisfaction of desired properties and the absence of design flaws. Numerous methods have been developed, and some, such as model checking and the ?-automata approach, have found wide acceptance in the computer industry and have led to the development of powerful verification tools. However, the popularity of these methods has not been firmly established in the Computer Science and Engineering curriculum. This paper presents an approach to integrating current verification research results into a typical, small-college Computer Organization and Architecture course.
Polynomial Solution to Stabilization Problem for Multivariable Sampled-Data Systems
Authors: B. P. Lampe, E. N. Rosenwasser
Venue: Automation and Remote Control (2003)

In polynomial form, necessary and sufficient conditions are given that provide for existence of a discrete controller stabilizing a multivariable sampled-data system.
Strategic Flexibility in Information Technology Alliances: the Influence of Transaction Cost Economics and Social Exchange Theory
Authors: Candace Young-Ybarra, Margarethe Wiersema
Venue: Organization Science (1999)

Utilizing a model drawn from both transaction cost economics and social exchange theory, we analyze determinants of strategic flexibility in a sample of strategic alliances involved in joint development agreements or joint research pacts. Findings indicate that, in general, determinants suggested by transaction cost economics provided flexibility in modification and inflexibility in exit. From social exchange theory, trust was found to be positively related to both types of flexibility while another component of social exchange theory, dependence, was found to be negatively related to the strategic flexibility of the alliance. Results also found that factors suggested by both transaction cost economic theory and social exchange theory were related to the concept of trust. Economic constraints as suggested by transaction cost economics were positively related to trust between the alliance partners while dependence was negatively related to trust. Additionally, the quality of communication and the existence of shared values were positively related to trust between the exchange partners. Results provide support for the role of determinants from both transaction cost economics and social exchange theory in the flexibility of strategic alliances.
Fast Computation of MD-DCT-IV/MD-DST-IV by MD-DWT or MD-DCT-II
Authors: Yonghong Zeng, Zhiping Lin, Guoan Bi, Lizhi Cheng
Venue: SIAM Journal on Scientific Computing (2002)

This paper reveals relationships between the type-IV multidimensional discrete cosine transform (MD-DCT-IV) and the type-II multidimensional discrete cosine transform (MD-DCT-II) or the multidimensional discrete W transform (MD-DWT). Based on the relationships, MD-DCT-IV can be efficiently computed by using the fast algorithms for MD-DCT-II or MD-DWT-III or MD-DWT-III. Efficient method for implementation of the post-addition or pre-addition process is also presented. Compared to the widely used row-column method, considerable savings on the number of arithmetic operations are achieved. For example, the number of multiplications for computing an r-dimensional DCT-IV is only about $\frac{1}{r}$ times that needed by the row-column method, and the number of additions is also reduced. Numerical experiments are made to test the computational time and roundoff errors. They show that the proposed fast algorithms save time.
Simultaneous switching noise in on-chip CMOS power distribution networks
Authors: Kevin T. Tang, Eby G. Friedman
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

Simultaneous switching noise (SSN) has become an important issue in the design of the internal on-chip power distribution networks in current very large scale integration/ultra large scale integration (VLSI/ULSI) circuits. An inductive model is used to characterize the power supply rails when a transient current is generated by simultaneously switching the on-chip registers and logic gates in a synchronous CMOS VLSI/ULSI circuit. An analytical expression characterizing the SSN voltage is presented here based on a lumped inductive-resistive-capacitive RLC model. The peak value of the SSN voltage based on this analytical expression is within 10% as compared to SPICE simulations. Design constraints at both the circuit and layout levels are also discussed based on minimizing the effects of the peak value of the SSN voltage.
Extended Password Key Exchange Protocols Immune to Dictionary Attacks
Authors: David P. Jablon
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Strong password methods verify even small passwords over a network without additional stored keys or certificates with the user, and without fear of network dictionary attack. We describe a new extension to further limit exposure to theft of a stored password-verifier, and apply it to several protocols including the Simple Password Exponential Key Exchange (SPEKE). Alice proves knowledge of a password C to Bob, who has a stored verifier S, where S=g/sup C/ mod p. They perform a SPEKE exchange based on the shared secret S to derive ephemeral shared key K/sub 1/. Bob chooses a random X and sends g/sup X/ mod p. Alice computes K=g/sup XC/ mod p, and proves knowledge of {K/sub 1/,K/sub 2/}. Bob verifies this result to confirm that Alice knows C. Implementation issues are summarized, showing the potential for improved performance over Bellovin and Merritt's comparably strong Augmented-Encrypted Key Exchange. These methods make the password a strong independent factor in authentication, and are suitable for both Internet and intranet use.
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
Authors: Kap Hwan Kim, Ki Young Kim
Venue: Transportation Science (1999)

This paper focuses on how to optimally route transfer cranes in a container yard during loading operations of export containers at port terminals. Decision variables are the number of containers that a transfer crane picks up at each yard-bay and the sequence of yard-bays that atransfer crane visits during a loading operation. This routing problem is formulated as a mixed integer program. The objective function of the formulation is to minimize the total container handling time of a transfer crane, which includes setup time at each yard-bay and travel time between yard-bays. Based on the mixed integer program, an optimizing algorithm is developed.
QoS Tuning and Resource Sharing for UMTS WCDMA Multiservice Mobile
Authors: Sébastien Baey, Marcel Dumas, Marie-Claude Dumas
Venue: IEEE Transactions on Mobile Computing (2002)

This paper studies the uplink of the universal mobile telecommunications system flexible physical layer. It recalls the semistatic approach of transport highlighting key parameters of its control and proposes an external analytic model of the mobile physical layer. This approach is adapted to radio resource management in a multiservice environment, accounting for the relationships between the link and the system levels. This paper clearly shows the impact of the rate matching mechanism on the transmission performances at link level for transport channels multiplexed in the uplink. It refines the power index notion useful at the system level as an indicator of resource consumption and transmission quality of the physical data and control channels. Integrating inter- and intramobile multiservice features with performance tables (considering environment influence, channel coding type, etc.) leads to a cost function of the transport format combinations; a valuable tool for the evaluation of the uplink multiservice cellular capacity. Several multiplexing cases are then studied under the joint aspects of quality tuning and resource consumption.
Extending ubiquitous computing to vineyards
Authors: Jenna Burrell, Tim Brooke, Richard Beckwith
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper, we describe how an ethnographic approach led to novel interface and system designs for vineyard management and discuss the lessons learned from it.
Distance-two labelings of graphs
Authors: Gerard J. Chang, Changhong Lu
Venue: European Journal of Combinatorics (2003)

For given positive integers j ≥ k, an L(j,k)-labeling of a graph G is a function f : V (G) → {0, 1, 2,...} such that |f(u) - f(v)| ≥ j when dG(u, v) = 1 and |f(u) - f(v)| ≥ k when dG(u, v) = 2. The L(j, k)-labeling number λj,k(G) of G is defined as the minimum m such that there is an L(j, k)-labeling f of G with f(V(G)) ⊆ {0, 1, 2,....,m}. For a graph G of maximum degree Δ ≥ 1 it is the case that λj,k(G) ≥ j + (Δ - 1)k. The purpose of this paper is to study the structures of graphs G with maximum degree Δ ≥ 1 and λj,k(G) = j + (Δ - 1)k.
Adaptive non-parametric efficiency frontier analysis: a neural-network-based model
Authors: Shouhong Wang
Venue: Computers and Operations Research (2003)

There have been two schools of efficiency analysis for private and public organizations. One is the data envelopment analysis (DEA) method which is based on a mathematical programming approach, and the other is the estimation of stochastic frontier functions (SFF) which is based on the econometric regression theory. Each of these two methodologies has its strength as well as major limitations. This paper proposes a non-parametric efficiency analysis method based on the adaptive neural network technique. The proposed computational method is able to find a stochastic frontier based on a set of input-output observational data. Like SFF, the proposed method considers two types of deviations involved in input-output data: managerial (external) and observational (internal) deviations. Like DEA, the proposed method does not require explicit assumptions about the function structure of the stochastic frontier. However, unlike any SFF and stochastic DEA methods, the proposed method does not require any parametric assumption of distribution functions. Using the neural networks, this method provides an adaptive way of obtaining empirical estimates of stochastic frontiers. An example using real data is presented for illustrative purposes. Simulation experiments demonstrate that the neural-network-based method would be effective as adaptive non-parametric efficiency analysis.
Fair electronic cash based on double signatures
Authors: Xiaofeng Chen, Changjie Wang, Yumin Wang
Venue: Journal of Computer Science and Technology (2002)

In order to decrease crimes such as money laundering, blackmailing etc. in electronic cash systems, fair electronic cash has been a major focus of academic research in electronic commence. When a bank finds some dubious cash or owner, the trusted entity or trustee can help him to revoke the anonymity of the cash. In the previous protocols, the trustee knows all the information of the cash whether he is trusted or not, that is, he can trace the user or cash unconditionally. Furthermore, the dishonest trustee may deceive a user, which means that he may withdraw cash while tracing other users. Such cases are unfair to the honest users.A new fair electronic cash protocol based on untrustworthy trustees is proposed in this paper. The key idea is that the coin structure should include the signatures of both the trustee and the bank so that the trustee shares the information of the cash with the bank, while we do not use the secret sharing scheme. In contrast with the previous protocols, neither the trustee nor the bank can trace the money without the help of the other entity. In this way, the privacy of the user is protected furthest. Also, the trustee is off-line in the protocol, which means that he will not be involved in withdrawing the cash. Therefore, the protocol is efficient for implementation.
Qualitative possibilistic independence based on plausibility relations
Authors: Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Venue: Technologies for constructing intelligent systems: tools (2002)

Independence is very important in many fields of Artificial Intelligence. It is particularly well studied in Bayesian networks. This paper analysis the notion of independence in the possibility theory framework. More precisely, we propose new definitions of possibilistic independence that we call qualitative independence, which only exploits the plausibility relation induced by a possibility distribution. A comparative study between existing (quantitative) possibilistic independence with qualitative independence is given. Lastly, results on graphoid properties of qualitative independence relations are provided.
Evaluating a sketch environment for novice programmers
Authors: Beryl Plimmer, Mark Apperley
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper describes the evaluation of an electronic sketch interface design tool for novice programmers. A comparative study was undertaken with small groups using two different shared space environments; a conventional informal design environment and the pen based digital whiteboard. The students reacted positively to the electronic environment, where they worked informally with their design ideas and checked them more carefully.
Book Reviews
Authors: Benjamin Lev, Mohan Gopalakrishnan, János D. Pintér, A. A. Zilinskas, John K. Visich, Zuo-Jun "Max" Shen, Zhihui Xue, B. Adenso-Díaz
Venue: Interfaces (2002)

The range of books reviewed is wide, covering theory and applications in operations research, statistics, management science, econometrics, mathematics, computers, and information systems (no software is reviewed). In addition, we include books in other fields that emphasize technical applications. Publishers who wish to have their books reviewed should send them to Professor Benjamin Lev. We list the books received; not all books received can be reviewed because space is limited. Those who would like to review books are urged to send me their names, addresses, and specific areas of expertise. We commission all reviews and do not accept unsolicited book reviews. Readers are encouraged to suggest books that might be reviewed or to ask publishers to send me copies of such books.
An alternate algorithm for computing Adomian polynomials in special cases
Authors: J. Biazar, E. Babolian, G. Kember, A. Nouri, R. Islam
Venue: Applied Mathematics and Computation (2003)

In this article we introduce an alternate algorithm for computing Adomian polynomials, and present some examples to show the simplicity and efficiency of the new method.
A Novel Distributed Dynamic Location Management Scheme for Minimizing Signaling Costs in Mobile IP
Authors: Jiang Xie, Ian F. Akyildiz
Venue: IEEE Transactions on Mobile Computing (2002)

Mobile IP is a simple and scalable global mobility solution. However, it may cause excessive signaling traffic and long signaling delay. Mobile IP regional registration is proposed to reduce the number of location updates to the home network and to reduce the signaling delay. This paper introduces a novel distributed and dynamic regional location management for Mobile IP where the signaling burden is evenly distributed and the regional network boundary is dynamically adjusted according to the up-to-date mobility and traffic load for each terminal. In our distributed system, each user has its own optimized system configuration which results in the minimal signaling traffic. In order to determine the signaling cost function, a new discrete analytical model is developed which captures the mobility and packet arrival pattern of a mobile terminal. This model does not impose any restrictions on the shape and the geographic location of subnets in the Internet. Given the average total location update and packet delivery cost, an iterative algorithm is then used to determine the optimal regional network size. Analytical results show that our distributed dynamic scheme outperforms the IETF Mobile IP regional registration scheme for various scenarios in terms of reducing the overall signaling cost.
Moments in Tandem Queues
Authors: Alan Scheller-Wolf, Karl Sigman
Venue: Operations Research (1998)

We settle a conjecture concerning necessary conditions for finite mean steady-state customer delay at the second node of a tandem queue, using as an example a stable tandem queue with mutually independent i.i.d. interarrival and service times. We assume that the service times have infinite variance at the first node, finite variance at the second node, and smaller mean at the first node than at the second node. We show that this causes infinite mean stationary delay at the second node. Thus, in general, when the mean service time is smaller at the first node than at the second, finite variance of service times at node 1 is necessary for finite mean delay at node 2. This confirms a conjecture made by Wolff. Our result complements sufficiency conditions previously published by Wolfson; together these necessary and sufficient conditions are presented as a theorem at the conclusion of the paper. Our proof uses a known duality between risk processes and queues.
Clock difference diagrams
Authors: Kim G. Larsen, Justin Pearson, Carsten Weise, Wang Yi
Venue: Nordic Journal of Computing (1999)

In this paper, we present Clock Difference Diagrams (CDD), a new BDD-like data-structure for effective representation and manipulation of certain non-convex subsets of the Euclidean space, notably those encountered in verification of timed automata. It is shown that all set-theoretic operations including inclusion checking may be carried out efficiently on Clock Difference Diagrams. Other clock operations needed for fully symbolic analysis of timed automata e.g. future- and reset-operations, can be obtained based on a so-called tight normalform for CDD. A version of the real-time verification tool UPPAAL using Clock Difference Diagrams as the main data-structure has been implemented. Experimental results demonstrate significant space-savings: for nine industrial examples the savings are in average 42% with moderate increase in runtime.
Staffing the transition to the virtual academic library: competencies, characteristics and change
Authors: Todd Chavez
Venue: Building a virtual library (2003)

Change brought about by innovations in computing technologies has fundamentally altered the nature of work in academic libraries. In his description of the term informatica electronica, Gilbert (1998) suggests that despite the way technology is changing how library staff do their work, it should not change the emphases on traditional services to patrons, such as accessing and retrieving information. This chapter also focuses on human changes that accompany the migration from print to electronic collections, from traditional to online services, and from the academic research library of a decade ago to the virtual library of today and tomorrow.
Integrating cognitive analyses in a large-scale system design process
Authors: Ann M. Bisantz, Emilie Roth, Bart Brickman, Laura Lin Gosbee, Larry Hettinger, James McKinney
Venue: International Journal of Human-Computer Studies (2003)

This paper describes the integration of cognitive analysis into the early stages of design of a new, large-scale system--a next generation US Navy Surface combatant. Influencing complex system designs in ways cognizant of human-system integration principles requires work products that are timely and tightly coupled to other elements of the design process. Because analyses were conducted simultaneously with the design processes regarding ship functionality and staffing, it was necessary to select and adapt cognitive work analysis methods to fit the demands of a time pressured and information-limited design situation. Interviews were conducted and analyzed based on aspects of an abstraction hierarchy and control task models. An abstraction hierarchy, a series of cross-linked matrices, and a set of decision ladder models were developed to provide a principled mapping between system function decompositions produced by system engineering teams and cognitive tasks, information needs, automation requirements, and concepts for displays. Cross-referencing the matrices supported design traceability and facilitated the integration of cognitive analyses with functional analyses being performed by other design teams. Results fed into design recommendations with respect to level of automation, human roles and initial display prototypes for the ship combat command center. The case study illustrates the utility of cognitive work analysis models (specifically, abstraction hierarchies and decision-ladder models) in the design of large-scale, first-of-a-kind systems, and presents new design artifacts that link concepts used in cognitive analyses to those used in systems engineering for more effective integration within the systems engineering process.
Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution
Authors: István Miklós
Venue: Discrete Applied Mathematics (2003)

The statistical approach to DNA sequence evolution involves the stochastic modelling of the substitution, insertion and deletion processes. Substitution has been modelled by finite Markov-process for more than three decades. Modelling the insertion and deletion process is in its new-age, and the recent model has a serious drawback: it assumes geometric sequence length equilibrium distribution, which contradicts biological knowledge. An algorithm is presented that computes the joint probability of two sequences evolved on a non-reversible way from a Poisson sequence length distribution.