ppxscal/embedding_network huggingface dataset:
Managing training in a technology context
Authors: Cynthia LeRouge, Harold Webb
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

Training in some contexts has become a quasi-information systems department. A multi-case study highlights this link by investigating the organizational context, technology deployment strategy, and staffing strategy of four organizational training units. The argument is made that this environment provides a potential career path for new and experienced information systems professionals. Strategic decision-making regarding technology-supported learning is discussed and issues for future information systems research are enumerated.
Efficient Type Inference for Record Concatenation and Subtyping
Authors: Jens Palsberg, Tian Zhao
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

Record concatenation, multiple inheritance, and multiple-object cloning are closely related and part of various language designs. For example, in Cardelli's untyped Obliq language, a new object can be constructed from several existing objects by cloning followed by concatenation; an error is given in case of field name conflicts. Type systems for record concatenation have been studied by Wand, Harper and Pierce, Remy, and others; and typeinference for the combination of record concatenation and subtyping has been studied by Sulzmann and by Pottier.In this paper we present the first polynomial-time type inference algorithm for record concatenation, subtyping, and recursive types. Our example language is the Abadi-Cardelliobject calculus extended with a concatenation operator. The type inference algorithm runs in O(n5) time where n is the size of the program. Our algorithm enables efficient type checking of Obliq programs without changing the programs at all.
Fast homeostatic neural oscillators induce radical robustness in robot performance
Authors: Ezequiel A. Di Paolo
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

A network of relaxation oscillators is evolved to produce phototaxis in a simulated robot. Oscillations are faster than the timescale of performance, and are designed to maintain the same average activation value independently of sensory or synaptic input. Neural activation cannot correlate with any action-relevant sensory information, but must be continuously modulated by sensorimotor coupling. Radical sensor robustness is shown by inverting the position of the sensors and also by removing either of them in turn operations that do not alter the success of the strategy. Slowing down the timescale of oscillations results in less robustness.
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Authors: Nicolas Peltier
Venue: Information and Computation (2003)

We present an algorithm that-given a set of clauses S saturated under some semantic refinements of the resolution calculus-automatically constructs a Herbrand model M of S. M is represented by a set of atoms with equality and disequality constraints interpreted over the finite tree algebra, hence the problem of evaluating first-order formulae in M is decidable.
Reversible logic circuit synthesis
Authors: Vivek V. Shende, Aditya K. Prasad, Igor L. Markov, John P. Hayes
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting distributions of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
Authors: David G. Humphrey, James R. Wilson
Venue: INFORMS Journal on Computing (2000)

We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering similar direct-search methods--in particular, excessive sensitivity to starting values, premature termination at a local optimum, lack of robustness against noisy responses, and computational inefficiency. The Revised Simplex Search (RSS) procedure consists of a three-phase application of the NM method in which: (a) the ending values for one phase become the starting values for the next phase; (b) the step size for the initial simplex (respectively, the shrink coefficient) decreases geometrically (respectively, increases linearly) over successive phases; and (c) the final estimated optimum is the best of the ending values for the three phases. To compare RSS versus NM and procedure RS+S9 due to Barton and Ivey, we summarize a simulation study based on four selected performance measures computed for six test problems that include additive white-noise error, with three levels of problem dimensionality and noise variability used in each problem. In the selected test problems, RSS yielded significantly more accurate estimates of the optimum than NM or RS+S9, and both RSS and RS+S9 required roughly four times as many function evaluations as NM.
On the defect of complementarity of fuzzy measures
Authors: A. I. Ban, S. G. Gal
Venue: Fuzzy Sets and Systems (2002)

It is well-known that the fuzzy measures are non-additive. This means that the sum between the measure of a set and the measure of its complement is not equal with the measure of space. As a consequence, in this paper we introduce the concept of defect of complementarity. Also, for large classes of fuzzy measures this defect of complementarity is calculated or estimated. Finally, some applications and interpretations are presented.
Stevie wonder school of web design
Authors: Andrea Hamblin, Cousett Ruelas
Venue: Journal of Computing Sciences in Colleges (2003)

Stevie Wonder may not be attending classes at your university, but there are certainly students like him that appreciate accessible web design. This web accessibility tutorial will provide hands-on training to participants on how to make existing HTML web documents accessible to users with various disabilities. Limitations often include more than being blind or deaf. You may have students with cognitive learning issues, mobility limitations or other learning disabilities such as dyslexia, epilepsy or Attention Deficit Disorder (ADD). Find out how to make your web page accessible to all audiences.
The genomics of a signaling pathway: a KDD Cup challenge task
Authors: Mark Craven
Venue: ACM SIGKDD Explorations Newsletter (2002)

This article describes Task 2 of the KDD Cup 2002 datamining competition. The task involved predicting whether deletions of individual genes in a yeast genome would affect a particular signaling pathway in the cell. With its rich data sources and abundance of missing information, the task is representative of data mining problems in genomics and proved to be quite challenging.
An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem
Authors: Warren B. Powell, Joel A. Shapiro, Hugo P. Simão
Venue: Transportation Science (2002)

We consider an aggregated version of a large-scale driver scheduling problem, derived from an application in less-than-truckload trucking, as a dynamic resource allocation problem. Drivers are aggregated into groups characterized by an attribute vector which capture the important attributes required to incorporate the work rules. The problem is very large: over 5,000 drivers and 30,000 loads in a four-day planning horizon. We formulate a problem that we call theheterogeneous resource allocation problem, which is more general than a classical multicommodity flow problem. Since the tasks have one-sided time windows, the problem is too large to even solve an LP relaxation. We formulate the problem as a multistage dynamic program and solve it using adaptive dynamic programming techniques. Since our problem is too large to solve using commercial solvers, we propose three independent benchmarks and demonstrate that our technique appears to be providing high-quality solutions in a reasonable amount of time.
Executive information systems in Spain: a study of current practices and comparative analysis
Authors: José L. Roldán, Antonio Leal
Venue: Decision making support systems: achievements, trends and challenges for (2002)

Executive Information Systems (EIS) began to become popular in Spain in the 1990s. This chapter offers a primary descriptive study of EIS in Spain, bearing in mind two aims: to study the EIS usage in Spain and undertake a comparative analysis with reference to previous research. In this way, starting from the recognized EIS development framework of Watson, Rainer and Koh (1991), the authors focus on the structural perspective of the EIS elements and the development process. The study is based on a survey involving 70 organizations. The results show both parallelisms with preceding studies and new contributions to the current knowledge in the EIS field. Finally, the chapter identifies future trends in the executive information system concept.
The Role of Ubiquitous Computing and the Disappearing Computer for CSCW
Authors: Norbert A. Streitz
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

AMBIENTE - Workspaces of the FutureAbstract: The next generation of Computer-Supported Cooperative Work (CSCW) systems will be determined by a number of new contexts and challenges. They are rooted in emerging technologies as well as in new application areas asking for new approaches and visions of the future. This keynote presentation will have to focus on selected areas and therefore present an approach that has not yet become a mainstream orientation for guiding the design of current CSCW systems but will certainly be very influential in the near future. According to this view, the following four areas have to be integrated into an "umbrella" framework for future CSCW research: Ubiquitous and Pervasive Computing, The Disappearing Computer in combination with Augmented Reality, Architecture and Hybrid Worlds, and new forms of Human-Computer Interaction. Note that in this paper, the term "architecture" is primarily used in the sense of real, physical environments as, e.g., rooms and buildings and less in the sense of system architecture or software architecture.
Assessing the Validity of IS Success Models: An Empirical Testand Theoretical Analysis
Authors: Arun Rai, Sandra S. Lang, Robert B. Welker
Venue: Information Systems Research (2002)

The purpose of the present study is to empirically and theoretically assess DeLone and McLean's (1992) and Seddon's (1997) models of information systems (IS) success in a quasi-voluntary IS use context. Structural modeling techniques were applied to data collected by questionnaire from 274 system users of an integrated student information system at a midwestern university. The Seddon structural model and the DeLone and McLean structural model each contained five variables (system quality, information quality, perceived usefulness, user satisfaction, and IS use). Both models exhibit reasonable fit with the collected data. The empirical findings are assessed in the broader theoretical context of the IS success literature, including the Technology Acceptance Model and the Theory of Planned Behavior. Our results support DeLone and McLean's focus on integrated IS success models and their observation that IS success models need to be carefully specified in a given context. The Seddon model conceptually elaborates and clarifies aspects of the DeLone and McLean model, thereby effectively integrating core theoretical relationships espoused in the IS success literature. Our study also supports Seddon's three construct categories (system and information quality, general perceptual measures aboutnetbene fts about IS use, and IS behavior), as defining IS success and its impact on nature of IS use.
An averaging method for singularly perturbed systems of semilinear differential inclusions with analytic semigroups
Authors: Mikhail Kamenskii, Paolo Nistri
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We consider a system of two semilinear parabolic inclusions depending on a small parameter ε > 0 which is present both in front of the derivative in one of the two inclusions and in the nonlinear terms to model high-frequency inputs.The aim is to provide conditions in order to guarantee, for ε > 0 sufficiently small, the existence of periodic solutions and in order to study their behaviour as ε tends to zero. Our assumptions permit the definition of upper semicontinuous, convex valued, compact vector operators whose fixed points represent the sought-after periodic solutions. The existence of fixed points is shown by using topological degree theory arguments.
An optimum placement search algorithm based on extended corner block list
Authors: Sheqin Dong, Shuo Zhou, Xianlong Hong, Chungkuan Cheng, Jun Gu, Yici Cai
Venue: Journal of Computer Science and Technology (2002)

A non-slicing approach, Corner Block List (CBL), has been presented recently. Since CBL only can represent floorplans without empty rooms, the algorithm based on CBL cannot get the optimum placement. In this paper, an extended corner block list. ECBLλ, is proposed. It can represent non-slicing floorplan including empty rooms. Based on the optimum solution theorem of BSG (bounded-sliceline grid), it is proved that the solution space of ECBLn, where n is the number of blocks, contains the optimum block placement with the minimum area. A placement algorithm based on ECBLλ, whose solution space can be controlled by setting λ the extending ratio, is completed. When λ is set as n, the algorithm based on ECBLn is the optimum placement search algorithm. Experiments show that λ has a reasonable constant range for building block layout problem, so the algorithm can translate an ECBLλ representation to its corresponding placement in O(n) time. Experimental results on MCNC benchmarks show promising performance with 7% improvement in wire length and 2% decrease in dead space over algorithms based on CBL. Meanwhile, compared with other algorithms, the proposed algorithm can get better results with less runtime.
On characterizing hypergraph regularity
Authors: Y. Dementieva, P. E. Haxell, B. Nagle, V. Rödl
Venue: Random Structures Algorithms (2002)

Szemerédi's Regularity Lemma is a well-known and powerful tool in modern graph theory. This result led to a number of interesting applications, particularly in extremal graph theory. A regularity lemma for 3-uniform hypergraphs developed by Frankl and Rödl [8] allows some of the Szemerédi Regularity Lemma graph applications to be extended to hypergraphs. An important development regarding Szemerédi's Lemma showed the equivalence between the property of ε-regularity of a bipartite graph G and an easily verifiable property concerning the neighborhoods of its vertices (Alon et al. [1]; cf. [6]). This characterization of ε-regularity led to an algorithmic version of Szemerédi's lemma [1]. Similar problems were also considered for hypergraphs. In [2], [9], [13], and [18], various descriptions of quasi-randomness of k-uniform hypergraphs were given. As in [1], the goal of this paper is to find easily verifiable conditions for the hypergraph regularity provided by [8]. The hypergraph regularity of [8] renders quasi-random "blocks of hyperedges" which are very sparse. This situation leads to technical difficulties in its application. Moreover, as we show in this paper, some easily verifiable conditions analogous to those considered in [2] and [18] fail to be true in the setting of [8]. However, we are able to find some necessary and sufficient conditions for this hypergraph regularity. These conditions enable us to design an algorithmic version of a hypergraph regularity lemma in [8]. This algorithmic version is presented by the authors in [5].
On the discrepancy of combinatorial rectangles
Authors: Noga Alon, Benjamin Doerr, Tomasz Łuczak, Tomasz Schoen
Venue: Random Structures Algorithms (2002)

Let Bdn denote the family which consists of all subsets S1 ×... × Sd, where Si ⊆ [n], and Si ≠ Φ for i = 1,..... d. We compute the L2-discrepancy of Bdn and give estimates for the Lp-discrepancy of Bdn for 1 ≤ p ≤ ∞.
Attaching Context-Aware Services to Moving Locations
Authors: Theo G. Kanter
Venue: IEEE Internet Computing (2003)

The GeoBots service uses context information from a variety of sources to provide smart connectivity and mixed-reality services for mobile users.
Multi-symplectic methods for generalized Schr&#x00F6;dinger equations
Authors: A. L. Islas, C. M. Schober
Venue: Future Generation Computer Systems (2003)

Recent results on spectral and finite difference multi-symplectic schemes for one- and two-dimensional PDEs are discussed. Multi-symplectic schemes for the one-dimensional nonlinear Schrödinger equation and the two-dimensional Gross-Pitaevskii equation are developed. The new schemes exactly preserve a discrete multi-symplectic conservation law. The conservation of local energy and momentum is examined as well as preservation of several global invariants.
Immersive VR decision training: telling interactive stories featuring advanced virtual human simulation technologies
Authors: Michal Ponder, Bruno Herbelin, Tom Molet, Sebastien Schertenlieb, Branislav Ulicny, George Papagiannakis, Nadia Magnenat-Thalmann, Daniel Thalmann
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

Based on the premise of a synergy between the interactive storytelling and VR training simulation this paper treats the main issues involved in practical realization of an immersive VR decision training system supporting possibly broad spectrum of scenarios featuring interactive virtual humans. The paper describes a concrete concept of such a system and its practical realization example.
On-line instructional testing in a mobile environment
Authors: Cerise Wuthrich, Gail Kalbfleisch, Terry Griffin, Nelson Passos
Venue: Journal of Computing Sciences in Colleges (2003)

Wireless access to the Internet has opened the door to a new range of computer applications, designed to satisfy the requirement of the mobile user, equipped with a personal digital assistant or cell phone device. In the educational field, the mobile communication environment allows students to access registrar records, enter enrollment information, obtain grades, etc. This paper describes the use of mobile devices in helping students prepare for knowledge tests and required concepts, followed by an in-depth description of the interactive wireless experimental application.
A survey of approaches to automatic schema matching
Authors: Erhard Rahm, Philip A. Bernstein
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2001)

Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level and instance-level, element-level and structure-level, and language-based and constraint-based matchers. Based on our classification we review some previous match implementations thereby indicating which part of the solution space they cover. We intend our taxonomy and review of past work to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.
Blood Vessel Segmentation via Neural Network in Histological Images
Authors: Roberto Rodríguez, Teresa E. Alarcón, Juan J. Abad
Venue: Journal of Intelligent and Robotic Systems (2003)

In this paper we utilize the Kohonen's self-organizing feature map to segment blood vessels from biopsies in tumor tissue. The ability of this kind of neural network to recognize very complex patterns makes it an effective computational tool for the segmentation. We propose a strategy of blood vessels segmentation using a neural network, taking into account the quality of our images and its features: complexity in shape and variability in size. Segmentation results are contingently manually corrected. The proposed segmentation strategy is tested on manual segmentation, where segmentation errors of less than 3.5% are observed. This work is a part of a global image analysis process and these images will be subject to a further morphometrical analysis in order to diagnose and prognosticate automatically malignant tumours.
Computing Loss Probabilities in Discrete-Time Queues
Authors: Frank N. Gouweleeuw, Henk C. Tijms
Venue: Operations Research (1998)

Discrete-time queueing systems are frequently encountered in telecommunication networks. These systems usually involve finite buffers. The purpose of this paper is to present a generally applicable method to compute the loss probability in discrete-time finite-buffer queues by using only the state probabilities in the corresponding infinite-buffer queue.
The Impact of an Integrated Marketing and Manufacturing Innovation
Authors: Glen M. Schmidt, Evan L. Porteus
Venue: Manufacturing Service Operations Management (2000)

Suppose you are a Marketing Manager envisioning a new product, or an Operations Manager contemplating a process improvement, or a CEO who commissioned an integrated new product development team. If our assumptions hold, our model offers you a single numerical measure, called thedegree of product/process innovation, to determine your initiative's impact on potential sales, prices, market segments, and profits. Our simple, single-period model is a variation of the existing vertically differentiated products model: There are two competing substitute products, and customers will buy at most one of them. Our contribution is to allow new relationships between the valuations of the two products by potential customers, and to allow differing unit production costs. We identify equilibrium results when two competing firms each offer one product, and find the profit maximizing result when one (monopolistic) firm offers both products. The new product infringes on the market in one of two ways:High-end encroachment results when the new product attracts the best customers (those with the highest reservation prices), whilelow-end encroachment identifies a situation where the new product attracts fringe (lower-end) customers. Low-end encroachment may help explain why an incumbent sometimes fails to recognize the threat of an entrant's product, as we illustrate with an example from the disk drive industry. In short, we offer insight into the value of both a marketing objective (enhancing the product design attributes) and a manufacturing goal (lowering the production cost) in a product and/or process improvement project.