ppxscal/embedding_network huggingface dataset:
The Landau problem for nonvanishing functions with real coefficients
Authors: Philippos Koulorizos, Nikolas Samaris
Venue: Journal of Computational and Applied Mathematics (2002)

For the class of holomorphic functions f(z) = f0 + f1z + f2z2 + ... in the unit disk |z|< 1 with 0 < |f(z)| < 1 and fn ∈ R, n =0, 1, 2 .... we prove that max(f0 +f1 +...+f4)=max|f0+f1+...+f4| = 1.46109... and min(f0 + f1+ ... +f4) = -0.713082 ....
Visteon's Sterling Plant Uses Simulation-Based Decision Support in Training, Operations, and Planning
Authors: George Pfeil, Ron Holcomb, Charles T. Muir, Shahram Taj
Venue: Interfaces (2000)

Visteon's Sterling plant uses a strategic decision support system (DSS) that integrates plant-floor information systems and simulation for three related, mutually reinforcing purposes: productivity training, productivity improvement in operations, and design of new operations. A self-directed team of the front-axle production line at the plant used the DSS to increase production of front axles for Ford Expeditions, Lincoln Navigators, and F-series trucks. Improving the productivity of this production line was important to the plant, the customers, and company profitability as the US market for high-profit margin 4 X 4 trucks and sport utility vehicles exploded. As a result of the new system, productivity improved by more than 30 percent. The plant produced an "extra" 144,496 front axles between January 1997 and July 1998. The DSS was also instrumental in Visteon avoiding a $10 million modification on the line that would have been inefficient. Visteon used the DSS in designing a new line with higher productivity and $5.5 million cost savings.
Contiguous relations of hypergeometric series
Authors: Raimundas Vidūnas
Venue: Journal of Computational and Applied Mathematics (2003)

The 15 Gauss contiguous relations for 2F1 hypergeometric series imply that any three 2F1 series whose corresponding parameters differ by integers are linearly related (over the field of rational functions in the parameters). We prove several properties of coefficients of these general contiguous relations, and use the results to propose effective ways to compute contiguous relations. We also discuss contiguous relations of generalized and basic hypergeometric functions, and several applications of them.
Heavyweight extensions to the UML metamodel to describe the C3 architectural style
Authors: Jorge Enrique Pérez-Martínez
Venue: ACM SIGSOFT Software Engineering Notes (2003)

UML is widely accepted as the standard for representing the various software artifacts generated by a development process. For this reason, there have been attempts to use this language to represent the software architecture of systems as well. Unfortunately, these attempts have ended in the same representations (boxes and lines) already criticized by the software architecture community.In this work we propose an extension to the UML metamodel that is able to represent the syntactics and semantics of the C3 architectural style. This style is derived from C2. The modifications to define C3 are described in section 4. This proposal is innovative regarding UML extensions for software architectures, since previous proposals where based on light extensions to the UML meta-model, while we propose a heavyweight extension of the metamodel. On the other hand, this proposal is less ambitious than previous proposals, since we do not want to represent in UML any architectural style, but only one: C3.
Blow-up and critical exponents for nonlinear hyperbolic equations
Authors: V. A. Galaktionov, S. I. Pohozaev
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We prove nonexistence results for the Cauchy problem for the abstract hyperbolic equation in a Banach space X, utt = f'(u), t > 0; u(0) = u0, ut(0) = u1, where f : X → R is a C1-function. Several applications to the second- and higher-order hyperbolic equations with local and nonlocal nonlinearities are presented. We also describe an approach to Kato's and John's critical exponents for the semilinear equations ut = Δu + b(x,t)|u|p, p > 1, which are responsible for phenomena of stability, unstability, blow-up and asymptotic behaviour.
The Us Army Relies on Decision Support Systems in Allocating Housing Resources
Authors: Guisseppi A. Forgionne, Yehuda S. Frager
Venue: Interfaces (1998)

Since 1991, the US Department of the Army has been using a heuristic programming model to better plan its housing construction and leasing. It obtained substantial economic and management benefits from using the original model. We enhanced the original model and developed a new delivery system to yield additional benefits.
Linux for science museums
Authors: Len Kaplan
Venue: Linux Journal (2003)

Love interactvie museums? Volunteer to help make your favorite museum even cooler.
Granularity of constraint-based analysis for Java
Authors: Byeong-Mo Chang, Jangwu Jo
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

This paper proposes a transformation-based approach to design constraint-based analyses for Java at a coarser granularity. In this approach, we design a less or equally precise but more efficient version of an original analysis by transforming the original construction rules into new ones. As applications of this rule transformation, we provide two instances of analysis design by rule-transformation. The first one designs a sparse version of class analysis for Java and the second one deals with a sparse exception analysis for Java. Both are designed based on method-level, and the sparse exception analysis is shown to give the same information for every method as the original analysis.
Supporting fair exchange in mobile environments
Authors: Holger Vogt, Felix C. Gärtner, Henning Pagnia
Venue: Mobile Networks and Applications (2003)

Mobile commerce over the Internet always includes the exchange of electronic goods. Fair exchange protocols establish fairness and ensure that both participants can engage in the exchange without the risk of suffering a disadvantage (e.g., losing their money without receiving anything for it). In general, fair exchange protocols require the continuous availability of an external trusted third party (TTP), a dedicated site which is trusted by both participants. Implementations of TTPs for fair exchange have been proposed to be based on carefully secured Internet hosts in order to establish trust. In this paper we present solutions to the fair exchange problem in mobile environments, where customers frequently disconnect from the network and thus continuous availability of the external TTP is not given. Our approach utilizes tamper-poof hardware on the customer's side partly taking over the duties of the TTP. Besides supporting disconnected operations our approach also allows the proper handling of time-sensitive items (i.e., items which lose value over time), a feature which previous protocols lack.
Personalizing Web Sites with Mixed-Initiative Interaction
Authors: Saverio Perugini, Naren Ramakrishnan
Venue: IT Professional (2003)

When the user and browser take turns changing the flow of interaction, it means improved personalization for the user and simple implementation choices for the site designer.
Ateleological development of "design-decisions-independent" information systems
Authors: Dimitrios Stamoulis, Dimitrios Theotokis, Drakoulis Martakos, Georgios Gyftodimos
Venue: Adaptive evolutionary information systems (2003)

This chapter introduces ateleology as a new paradigm for developing information systems (IS). It argues that the user should be able to modify the information systems' behaviour at run-time, unlike contemporary IS. Such information systems, called tailorable, are able to evolve together with their context to adapt to the constantly changing requirements of their users. Ateleology provides a sound theoretical basis for explaining tailorable IS (TIS) development. Using an innovative software architecture made up of dynamic object-oriented software components, it is shown how an IS can be design-decisions-independent and, thus, tailorable, by empowering the user to control the system's behaviour at run-time. By abolishing design decisions that unnecessarily and irreversibly restrict the IS's behaviour and by deferring them at run-time, TIS is the first and only breed of IS that evolve and adapt to their context, to achieve constant systems development.
Social Identities in an International Joint Venture: An Exploratory Case Study
Authors: Jane E. Salk, Oded Shenkar
Venue: Organization Science (2001)

International joint venture (IJV) research largely omits social and cognitive processes and, hence, overlooks their potentially important implications. This paper presents a four-year longitudinal investigation into the social identification and social enactment processes in a British-Italian, shared management joint venture. Using social identification and social enactment theories as conceptual anchors, the study reveals that national social identities were the dominant sense-making vehicle used by team members, although multiple sources of social identification were possible and present in this IJV. Contextual changes occurred that could be expected to favor organizational (IJV-based) social identities, but the dominant use of nationality-based identities did not change. Our findings suggest that social identity enactments (using particular boundaries to define primary social identities) by team members mediate the relationship of contextual variables, both environmental and structural, with group and organizational outcomes (such as role investment and job satisfaction). Our empirical results shed light on unresolved debates in the IJV literature, e.g., the implications of cultural distance and shared management for IJV performance. This study also contributes to social identity theory by highlighting promising directions for development of contextual and longitudinal dimensions in that research stream.
Instruction merging and specialization in the SICStus Prolog virtual machine
Authors: Henrik Nässén, Mats Carlsson, Konstantinos Sagonas
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

Wanting to improve execution speed and reduce code size of SICStus Prolog programs, we embarked on a project whose aim was to systematically investigate combination and specialization of WAM instructions. Various variants of the SICStus Prolog virtual machine instruction set were designed, implemented, and their performance was evaluated against standard benchmarks and on big Prolog programs. In this paper, we describe our methodology in finding appropriate candicates for instruction merging and specialization, discuss related trade-offs, present detailed statistics and performance measurements that we gathered, and report on our experiences from our involvement in this feat. In short, our experience is positiv e: the speedup of performing instruction merging and specialization in the context of the SICStus emulator is approximately 10%, while the bytecode size reduction is about 15%.
E-mail programming with perl
Authors: Nicholas Karlson, Charles Reynolds,  II
Venue: Journal of Computing Sciences in Colleges (2003)

E-mail is a vital application. However, most users rarely consider the programming issues involved due to the seeming complexity. Fortunately, Perl makes e-mail programming relatively easy. This paper demonstrates Perl's e-mail functionality using examples which include automating e-mail for use in an online survey and a command line script for sending e-mail with attachments.
Decoding binary R(2, 5) by hand
Authors: Philippe Gaborit, Jon-Lark Kim, Vera Pless
Venue: Discrete Mathematics (2003)

The main purpose of this paper is to decode the binary Reed-Muller [32,16,8] code R(2,5) by hand by two methods. One, the representation decoding method, is the analogue of the method used to decode the Golay code [8]. The other is the syndrome decoding method. We also describe how to decode other doubly-even self-dual [32,16,8] codes C83 (or 2g16) and C84 (or 8f4).
Resolution of Process Collisions in the Scalable Computer Systems
Authors: V. V. Toporkov
Venue: Automation and Remote Control (2003)

Collision of parallel processes which is understood as competition for the same resource can be resolved in the scalable computer systems by introducing additional resources. Extreme awkwardness makes direct selection of the variants of process assignment unacceptable to the optimal resolution of complex collisions. Procedures of approximate and conditionally optimal resolution of collisions featuring quadratic and cubic temporal complexity as function of the number of operations of processing and data exchange were proposed and substantiated. The approximate resolution provides nondegradable values of the utilization ratio of processors and data exchange channels, and the conditionally optimal resolution provides extremal ones.
Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space
Authors: Chang-Sung Jeong, Alex Pang
Venue: Proceedings of the 1998 IEEE Symposium on Information Visualization (1998)

We present a new visualization technique, called RDT (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In RDT, each node is associated with a disc around which its children are placed. Using discs instead of cones as the basic shape in RDT has several advantages: significant reduction of occluded region, sharp increase in number of displayed nodes, and easy projection onto plane without visual overlapping. We show that RDT can greatly enhance user perception by transforming its shapes dynamically in several ways:(1) disc tree which can significantly reduce the occluded region by the foreground objects, (2) compact disc tree which can increase the number of nodes displayed on the screen, and (3) plane disc tree which can be mapped onto the plane without visual overlapping. We describe an implementation of our visualization system called VISIT (Visual Information System for reconfigurable dIsc Tree). It provides 2D and 3D layouts for RDT and various user interface features such as tree reconfiguration, tree transformation, tree shading, viewing transformation, animation, selection and browsing which can enhance the user perception and navigation capabilities. We also evaluate our system using the following three metrics: percentage of occlusion, density of displayed nodes on a screen. number of identifiable nodes.
Explorations within topic tracking and detection
Authors: James Allan, Victor Lavrenko, Russell Swan
Venue: Topic detection and tracking: event-based information organization (2002)

This chapter presents the system used by the Center for Intelligent Information Retrieval (CIIR) at the University of Massachusetts for its participation in four of the five TDT tasks: tracking, detection, first story detection, and story link detection. For each task, we discuss the parameter setting approach that we used and the results of our system on the test data.For the task of link detection, we look more carefully at score normalization across different languages and media types. We find that we can improve results noticeably though not substantially by normalizing scores differently depending upon the source language. We also consider smoothing the vocabulary in stories using a "query expansion" technique from Information Retrieval to add additional words from the corpus to each story. This results in substantial improvements.In addition, we use TDT evaluation approaches to show that the tracking performance that sites are achieving is what is expected from Information Retrieval technology. We further show that any first story detection system based on a tracking approach is unlikely to be sufficiently accurate for most purposes. Finally, we present an overview of an automatic timeline generation system that we developed using TDT data.
Calculating stack distances efficiently
Authors: George Almási, Cǎlin Caşcaval, David A. Padua
Venue: ACM SIGPLAN Notices (2003)

This paper1 describes our experience using the stack processing algorithm [6] for estimating the number of cache misses in scientific programs. By using a new data structure and various optimization techniques we obtain instrumented run-times within 50 to 100 times the original optimized run-times of our benchmarks.
Double exponential smoothing: an alternative to Kalman filter-based predictive tracking
Authors: Joseph J. LaViola
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

We present novel algorithms for predictive tracking of user position and orientation based on double exponential smoothing. These algorithms, when compared against Kalman and extended Kalman filter-based predictors with derivative free measurement models, run approximately 135 times faster with equivalent prediction performance and simpler implementations. This paper describes these algorithms in detail along with the Kalman and extended Kalman Filter predictors tested against. In addition, we describe the details of a predictor experiment and present empirical results supporting the validity of our claims that these predictors are faster, easier to implement, and perform equivalently to the Kalman and extended Kalman filtering predictors.
Turnpike Solutions in the Procedures Seeking Optimal Controls
Authors: V. I. Gurman
Venue: Automation and Remote Control (2003)

Many applied problems of optimal control feature degeneracy, that is, have among their conditions some latent passive differential relations or discrete chains that can be eliminated to simplify the problem by reducing its order without affecting the desired solution. Its corresponding trajectory is a turnpike, that is, an invariant under all or part of the boundary conditions. The turnpike solutions can be used as efficient initial approximations in iterative methods of search for optimal controls. Consideration was given to the existence conditions for precise or approximate turnpike solutions, a scheme to seek and refine them was suggested, and efficiency of this approach on the whole was illustrated by representative examples. The class of control on models related with solution of topical problems of stable development where the turnpikes are pivotal was discussed in detail.
Importance Sampling and the Cyclic Approach
Authors: Sandeep Juneja
Venue: Operations Research (2001)

The method of importance sampling is widely used for efficient rare-event simulation of stochastic systems. This method involves simulating the system under a new distribution that accentuates the probability along the most likely paths to the rare event. Traditionally, insights from large deviations theory are used to identify the distribution emphasizing these most likely paths. In this paper we develop an intuitivecyclic approach for selecting such a distribution. The key idea is to select a distribution under which the event of interest is no longer rare and the probability of occurrence of a cycle in any sample path remains equal to the original probability of that cycle. We show that only an exponentially twisted distribution can satisfy thisequiprobable cycle condition. Using this approach we provide an elementary derivation of the asymptotically optimal change of measure for level crossing probability for Markov-additive processes. To demonstrate its ease of use for more complex stochastic systems, we apply it to determine the asymptotically optimal change of measure for estimating buffer overflow probability of a single-server queue subject to server interruptions.
Efficient hardware controller synthesis for synchronous dataflow graph in system level design
Authors: Hyunuk Jung, Kangnyoung Lee, Soonhoi Ha
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

This paper concerns automatic hardware synthesis from data flow graph (DFG) specification in system level design. In the presented design methodology, each node of a data flow graph represents a hardware library module that contains a synthesizable VHDL code. Our proposed technique automatically synthesizes a clever control structure, cascaded counter controller, that supports asynchronous interaction with outside modules while efficiently implementing the synchronous dataflow semantics of the graph at the same time. Through comparison with previous works with some examples, the novelty of the proposed technique is demonstrated.
Nonlinear credit assignment for musical sequences
Authors: Judy A. Franklin, Victoria U. Manfredi
Venue: Computational intelligence and applications (2002)

Reinforcement learning is an exciting possibility for generating music because of its ability to learn without explicit examples and to produce more than one response in a given state. We use reinforcement learning in the second phase of a jazz improvisor that learns to interactively play jazz with a human. The reinforcement signal is based on rules for improvisation. Because of time delays between note played and subsequent reinforcement, a critic adjusts the reinforcement signal. We describe this system and then examine the ability of a temporal difference critic to predict reinforcement for three different sequential musical phenomena. A nonlinear network with a linear TD output unit and context traces on input is able to successfully predict reinforcement values for these sequences and shows promise for use in musical reinforcement learning tasks.
Binary patterns in infinite binary words
Authors: Antonio Restivo, Sergio Salemi
Venue: Formal and natural computing (2002)

In this paper we study the set P(ω) of binary patterns that can occur in one infinite binary word ω, comparing it with the set F(ω) of factors of the word. Since the set P(ω) can be considered as an extension of the set F(ω), we first investigate how large is such extension, by introducing the parameter Δ(ω) that corresponds to the cardinality of the difference set P(ω) \ F(ω). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter Δ(ω) is infinite, we introduce the pattern complexity of ω, which corresponds to the complexity of the language P(ω). As a main result, we prove that there exist infinite words that have pattern complexity that grows more quickly than their complexity. We finally propose some problems and new research directions.
Improving Operations and Quoting Accurate Lead Times in a Laminate Plant
Authors: Sridhar Tayur
Venue: Interfaces (2000)

The important requirement of quoting short and accurate lead times to customers in industrial supply chains is a difficult challenge as it requires coordination between purchasing, order-entry, scheduling and inventory-control groups. We meet this challenge at a laminate plant where the customer demands (in timing and quantity) are variable, the production processes have uncertain yield, the variety of products is high, and manufacturing involves significant switch-over costs and times between products--through the use of inventory management with cyclic scheduling, along with many concurrent improvements in supplier management, customer relations, product design, and quality.