ppxscal/embedding_network huggingface dataset:
A necessary condition for the extension of Szegő's asymptotics inside the disk in the Sobolev case
Authors: E. Berriochoa, A. Cachafeiro
Venue: Journal of Computational and Applied Mathematics (2003)

In the present paper we consider a Sobolev inner product of the following type: 〈f(z),g(z)〉s = ∫02π f(eiθ)Odµ0(θ) + ∫02π f'(eiθ)Odµ1(θ), z = eiθ with µ0 a finite positive Borel measure on [0, 2π] and µ1 a measure in the Szegö class.We assume that the monic Sobolev orthogonal polynomial sequence {ψ˜n} satisfies that limn → ∞ψ˜n(z)/zn = π1(1/z)/(Π1(0) uniformly on subsets K of the complex plane such that infz∈K |z| > ρ, where ρ < 1 and Π1(z) is the Szegö function of µ1. Then we prove that the sequence of moments of measure µ0, {cn}, satisfies that limn→∞ cn = 0, and therefore µ0 is a continuous measure.
On the zeros of the scorer functions
Authors: Amparo Gil, Javier Segura, Nico M. Temme
Venue: Journal of Approximation Theory (2003)

Asymptotic approximations are developed for zeros of the solutions Gi(z) and Hi(z) of the inhomogeneous Airy differential equation w" - zw = ± 1/π. The solutions are also called Scorer functions. Tables are given with numerical values of the zeros.
The structure of the "The" multiprogramming system
Authors: Edsger W. Dijkstra
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation.
Analysis of current transients and morphology of metastable and stable pitting on stainless steel above pitting potential
Authors: M. H. Moayed, R. C. Newman
Venue: Iranian Journal of Science and Technology (2001)

In order to record metastable pit current transients, a 904L austenitic stainless steel was polarized potentiostatically by applying 750 mV (Ag/AgCl) in 1 M NaCl solution at 45, 49 and 54°C, knowing that the alloy CPT is 56°C. Stable pit current transients were recorded employing the same potential and test solution but at 62°C. It was found that the metastable pit current, I, follows a power law relation ship of I ∞ tn during the initiation and growth prior to repassivation. The value of n was found to vary with temperature, however, values of 0.5 to 1.5 were obtained in all cases. The results of Scanning Electron Microscopy (SEM) studies on these transients showed two types of pit morphology: small pits associated with the small transients, whose interior surface were not visible, and open pit cavities with polished surface for larger transients, recorded at temperature closed to the CPT. Current transients from the stable pits showed an initial shape similar to that of stable pit. The stable pit currents rises approximately in proportion to t3/2, but only for a few seconds and then continues to increase proportion to t1/2 without repassivation. The SEM studies also revealed that stable pits are covered with a lace-like pattern with polished interior surface.
Teaching in shifting sands: changes in CS2
Authors: Richard Close, Danny Kopec, Jim Aman
Venue: Journal of Computing Sciences in Colleges (2002)

At a time when the Curriculum 2001 committee is compiling their recommendations, it is perhaps useful to look to the past and track the evolution of the CS2 course. As the computer science curriculum has evolved through the years [4], more has been expected of students in lower-level courses. This may be seen as a natural evolution; a sign of the maturity of the field. Changes in the curriculum, particularly the breadth-first approach, have affected the content and delivery of every course. The net result is that the first course in computer science is less concerned with teaching programming skills in a single language, a burden now shifted to later courses. The CS2 course has become more important in its effect on a student's experience, knowledge, and outlook on the entire computer science major.One of the most difficult questions for faculty is what precisely should be included in CS2? Should we play to the audience and teach what a fairly large number of students seem to want (Java, web-programming, Visual BASIC, etc.)? Or should we continue with the latest ACM/IEEE recommendations and risk becoming extinct or irrelevant? This paper examines the reactions of three very different institutions with very different constituencies to these questions.
Tools for privacy preserving distributed data mining
Authors: Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, Xiaodong Lin, Michael Y. Zhu
Venue: ACM SIGKDD Explorations Newsletter (2002)

Privacy preserving mining of distributed data has numerous applications. Each application poses different constraints: What is meant by privacy, what are the desired results, how is the data distributed, what are the constraints on collaboration and cooperative computing, etc. We suggest that the solution to this is a toolkit of components that can be combined for specific privacy-preserving data mining applications. This paper presents some components of such a toolkit, and shows how they can be used to solve several privacy-preserving data mining problems.
E-reference
Authors: Amy Tracy Wells, Ardis Hanson
Venue: Building a virtual library (2003)

Lipnow (1997) talks about traditional reference a a mediated, one-on-one service that intervenes at the information seeker's point of need. Further, she suggests that this point of need is part of the universal predicament of an information seeker-someone who wants to move forward (cognitively) but is unable to progress until he or she finds that missing piece of information. Research clearly shows that information seekers want and need that gap filled with as little interruption as possible, so they can continue where they left off (Dervin, 1998, 1989). From a library perspective, the two questions emanating from that need are first, how to ensure that clients who use a reference service get up-to-date assistance that integrates paper and electronic resources, and second, how to reach the user who has a question but no obvious place to ask it. Technology may have simultaneously ameliorated and exacerbated these questions.There are numerous local, national, and international initiatives for the provision of e-reference. These include efforts within centralized library environments, between libraries under different management structures within the same institution, libraries within the same region, as well as larger initiatives such as the IPL (Internet Public Library) Reference Center, AgNIC's (Agricultural Network Information Center) distributed service, VRD (Virtual Reference Desk), or the Library of Congress" CDRS (Collaborative Digital Reference Service), which attempt to serve any user, any where.E-Reference means many things to many people such as asynchronous or, conversely, synchronous communication, software tools such as email or an off-the-shelf CRM (Customer Relations Management package or even an in-house tool built in Perl, to policy and management goals, to cooperative and non-cooperative ventures. However, there are some trends as defined by market-share development. This chapter begins with a brief definition of e-reference and places it within the continuum of services provided by an academic virtual library. The authors then examine the functional requirements of systems, real world issues including policy and standards, market growth and issues in information literacy. Finally, they discuss future issues for e-reference services.
Real time fuzzy personalized web stock information agent
Authors: Yanfei Wang, Yan-Qing Zhang, Saeid Belkasim, Raj Sunderraman
Venue: Computational intelligence and applications (2002)

The real time fuzzy personalized stock information agent is designed based on fuzzy logic, intelligent agent, personalization, Jakarta-Tomcat-3.2.1 (Web sever) and Microsoft SQL Server 7.0 (database). In addition, a variety of languages, including Java, JSP (Java Sever Page), HTML, Java Servlet, XML, XSL (Extensible Stylesheet Language) are also used. The smart agent enables the users to create their own portfolios that contain the real time watch list of personalized stocks. The application refreshes each stock data in real time by accessing the appropriate database available on the Internet. This application enables the user to get accurate, real time information of a preselected list of favorite stocks. Using fuzzy reasoning, the Web stock agent is capable of ranking the "top 10 stocks" based on their real time stock information.
Comments on "optimization flow control, I: Basic algorithm and convergence"
Authors: Andrzej Karbowski
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

In this Comments, an error in Low and Lapsley's article [1] is pointed out. Because of this error, the proof of the Theorem 2 presented in the article is incomplete and some assessments are wrong. In the second part of this Comments, the author proposes a correction to this proof.
Location-based services: criteria for adoption and solution deployment
Authors: Joe Astroth
Venue: Mobile commerce: technology, theory, and applications (2003)

This chapter provides an overview of location-based services and insight into the pivotal importance of location-sensitivity to the success of wireless data services. This chapter argues that mass-market adoption of wireless data services will only occur if these services enhance productivity and/or convenience for end-users; transforming novelty into a "must-have." It is the author's view that m-commerce is inextricably linked to location and that the incorporation of location-sensitivity will transform these transactions into a relevant, personalized and actionable experience for the user, thereby encouraging the kind of uptake required to fulfill market potential and bring revenue to carriers. The author will provide examples of location-sensitive wireless data servces in consumer and enterprise environments. A specific case study showcasing a next generation solution jointly developed by TargaSys, a division of Fiat Auto and Autodesk Location Services will describe key elements of a successful model for location-based services. Future directions, revenue models, and key technology enablers for successful deployment will also be discussed.
Stopping Rules for a Class of Sampling-Based Stochastic Programming Algorithms
Authors: Gordon B. Hazen, James M. Pellissier, Jayavel Sounderpandian, David P. Morton
Venue: Operations Research (1998)

Monte Carlo sampling-based algorithms hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. In this paper, we develop a stopping rule theory for a class of algorithms that estimate bounds on the optimal objective function value by sampling. We provide rules for selecting sample sizes and terminating the algorithm under which asymptotic validity of confidence intervals for the quality of the proposed solution can be verified. Empirical coverage results are given for a simple example.
Minimal sensor integrity: measuring the vulnerability of sensor grids
Authors: Rajgopal Kannan, S. Sarangi, Sibabrata Ray, S. S. Iyengar
Venue: Information Processing Letters (2003)

Given the increasing importance of optimal sensor deployment for battlefield strategists, the converse problem of reacting to a particular deployment by an enemy is equally significant and not yet addressed in a quantifiable manner in the literature. We address this issue by modeling a two stage game in which the opponent deploys sensors to cover a sensor field and we attempt to maximally reduce his coverage at minimal cost. In this context, we introduce the concept of minimal sensor integrity which measures the vulnerability of any sensor deployment. We find the best response by quantifying the merits of each response. While the problem of optimally deploying sensors subject to coverage constraints is NP-complete [Chakrabarty et al., IEEE Trans. Comput., to appear], in this paper we show that the best response (i.e., the maximum vulnerability) can be computed in polynomial time for sensors with arbitrary coverage capabilities deployed over points in any dimensional space. In the special case when sensor coverages form an interval graph (as in a linear grid), we describe a better O(min(M2, NM)) dynamic programming algorithm.
Scholarly journals as web services: automated scholarship, memes and cyberactive articles
Authors: Bruce J. Neubauer
Venue: Journal of Computing Sciences in Colleges (2003)

Today's scholarly articles are passive entities. Using tags, object-oriented programming techniques, and Web services programming it may be possible to make future articles active participants in scholarship. A possible transition to "cyberactive articles" will involve a substantial change in how we perceive the work of scholarship and the role of academic journals. This articles suggests that future scholarship may become "literary engineering" supported by appropriate software tools.
Boolean Function Representation Based on Disjoint-Support Decompositions
Authors: Valeria Bertacco, Maurizio Damiani
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduction of memory occupation with respect to traditional ROBDDs by decomposing logic functions recursively into simpler - and more sharable - blocks. The representation is less sensitive to variable ordering, and because of this property, analysis of the MLDD graphs allows at times the identification of better variable orderings. The identification of more terminal cases by Boolean algebra techniques makes it possible to compensate the additiona l - small- CPU time required to identify the disjoint-support decomposition. We expect the properties of MLDDs to be useful in several contexts, most notably logic synthesis, technology mapping, and sequential hardware verification.
The invisible person: advanced interaction using an embedded interface
Authors: Thomas Psik, Krešimir Matković, Reinhard Sainitzer, Paolo Petta, Zsolt Szalavari
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

In this paper we describe an advanced user interface enabling even playing games in an immersive virtual environment. There are no common input devices, users presence in the environment, movements, and body postures are the available tools for interaction. Furthermore, a publicly accessible installation in the Vienna Museum of Technology implementing such an advanced environment is described. In this installation computers are completely hidden, and it is one of the most popular exhibits in the museum, which has been accessed by more than 200,000 visitors since September 1999.
Crystal bases, path models and a twining character formula for Demazure modules
Authors: Daisuke Sagaki
Venue: Publications of the Research Institute for Mathematical Sciences (2002)

We give a combinatorial proof of a twining character formula for Demazure modules, by combining the isomorphism theorem between path models and crystal bases with our previous result about Lakshmibai-Seshadri paths fixed by a diagram automorphism.
PAI: automatic indexing for extracting asserted keywords from a document
Authors: Naohiro Matsumura, Yukio Ohsawa, Mitsuru Ishizuka
Venue: New Generation Computing (2003)

This paper proposes an automatic indexing method named PAI (Priming Activation Indexing) that extracts keywords expressing the author's main point from a document based on the priming effect. The basic idea is that since the author writes a document emphasizing his/her main point, impressive terms born in the mind of the reader could represent the asserted keywords. Our approach employs a spreading activation model without using corpus, thesaurus, syntactic analysis, dependency relations between terms or any other knowledge except for stop-word list. Experimental evaluations are reported by applying PAI to journal/conference papers.
The Stable Allocation (or Ordinal Transportation) Problem
Authors: Mourad Baïou, Michel Balinski
Venue: Mathematics of Operations Research (2002)

Thestable allocation problem generalizes the 0,1 stable matching problems (one-to-one, one-to-many, and many-to-many) to the allocation of real valued hours or quantities. A strongly polynomial algorithm proves the existence of "stable allocations."The set of stable allocations is shown to be a distributive lattice in general, but in the "nondegenerate" case it is a complete linear order. Indeed, in the generic case, when a problem is "strongly nondegenerate," there exists a single stable allocation.A simple algorithm finds "row-optimal" and "column-optimal" stable allocations, given any stable allocation. When a problem is nondegenerate it finds all stable allocations.
Designing a Call Center with Impatient Customers
Authors: O. Garnet, A. Mandelbaum, M. Reiman
Venue: Manufacturing Service Operations Management (2002)

The most common model to support workforce management of telephone call centers is theM/ M/ N/ B model, in particular its special casesM/ M/ N (Erlang C, which models out busy signals) andM/ M/ N/ N (Erlang B, disallowing waiting). All of these models lack a central prevalent feature, namely, that impatient customers might decide to leave (abandon) before their service begins.In this paper, we analyze the simplest abandonment model, in which customers' patience is exponentially distributed and the system's waiting capacity is unlimited ( M/ M/ N +M). Such a model is both rich and analyzable enough to provide information that is practically important for call-center managers. We first outline a method for exact analysis of theM/ M/ N +M model, that while numerically tractable is not very insightful. We then proceed with an asymptotic analysis of theM/ M/ N +M model, in a regime that is appropriate for large call centers (many agents, high efficiency, high service level). Guided by the asymptotic behavior, we derive approximations for performance measures and propose "rules of thumb" for the design of large call centers. We thus add support to the growing acknowledgment that insights from diffusion approximations are directly applicable to management practice.
Pair programming and pair trading: effects on learning and motivation in a CS2 course
Authors: Timothy H. DeClue
Venue: Journal of Computing Sciences in Colleges (2003)

Pair programming is a seemingly powerful addition to the tool kit of educators wishing to enhance learning in software engineering students. This technique, found among professional software development practices associated with extreme programming (Beck), has probably existed informally for some time in various forms of collaborative software development. More recently pair programming has been formalized and used as an intentional pedagogical tool in the classroom. During the Spring semester of 2002, the author implemented a multi-phase project in CS2 similar to the one described by Newhall and Meeden (2002). The author used pair-programming and pair-trading to facilitate the production of high quality code. Qualitative data were collected from the students throughout the project. This paper documents the qualitative study and sheds some light on why pair programming can be successful in educational applications, and also how pair programmers can be assessed.
An enhanced multilevel routing system
Authors: Jason Cong, Min Xie, Yan Zhang
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper, we present several novel techniques that make the recently published multilevel routing scheme [19] more effective and complete. Our contributions include: (1) resource reservation for local nets during the coarsening process, (2) congestion-driven, graph-based Steiner tree construction during the initial routing and the refinement process and (3) multi-iteration refinement considering the congestion history. The experiments show that each of these techniques helps to improve the completion rate considerately. Compared to [19], the new routing system reduces the number of failed nets by 2&times; to 18&times;, with less than 50% increase in runtime in most cases.
Newsvendor Networks: Inventory Management and Capacity Investment with Discretionary Activities
Authors: Jan A. Van Mieghem, Nils Rudi
Venue: Manufacturing Service Operations Management (2002)

We introduce a class of models, callednewsvendor networks, that allow for multiple products and multiple processing and storage points and investigate how their single-period properties extend to dynamic settings. Such models provide a parsimonious framework to study various problems of stochastic capacity investment and inventory management, including assembly, commonality, distribution, flexibility, substitution and transshipment. Newsvendor networks are stochastic models with recourse that are characterized by linear revenue and cost structures and a linear input-output transformation. While capacity and inventory decisions are locked in before uncertainty is resolved, some managerial discretion remains via ex-post input-output activity decisions. Ex-post decisions involve both the choice of activities and their levels and can result in subtle benefits. This discretion in choice is captured through alternate or "nonbasic" activities that can redeploy inputs and resources to best respond to resolved uncertain events. Nonbasic activities are never used in a deterministic environment; their value stems from discretionary flexibility to meet stochastic demand deviations from the operating point.The optimal capacity and inventory decisions balance overages with underages. Continuing the classic newsvendor analogy, the optimal balancing conditions can be interpreted as specifying multiple "critical fractiles" of the multivariate demand distribution; they also suggest appropriate measures for and trade-offs between product service levels. This paper shows that the properties of optimal newsvendor network solutions extend to a dynamic setting under plausible conditions. Indeed, we establish dynamic optimality of inventory and capacity policies for the lost sales case. Depending on the nonbasic activities, this also extends to the backordering case. Analytic- and simulation-based solution techniques and graphical interpretations are presented and illustrated by a comprehensive example that features discretionary input commonality and a flexible processing resource.