ppxscal/embedding_network huggingface dataset:
A computational approach for the analytical solving of a Dirichlet-type problem for third order partial differential equations
Authors: Tolga Güyer, Şeref Mirasyedioğlu
Venue: Applied Mathematics and Computation (2003)

This paper presents a new symbolic algorithm for computing an approximated analytic solution to a Dirichlet-type boundary-value problem for the third order partial differential equations using Galerkin method.
On the use of sensors in self-reconfigurable robots
Authors: K. Støy, W.-M. Shen, P. Will
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

In this paper we investigate the use of sensors in self-reconfigurable robots. We review several physically realized self-reconfigurable robots and conclude that little attention has been paid to the use of sensors. This is unfortunate since sensors can provide essential feedback that can be used to guide self-reconfiguration and control. In the systems that do use sensor feedback, the feedback is used locally on each module. However we identify a need in some situations to use sensor feedback globally. We therefore propose an approach where raw sensor values are abstracted and propagated to all modules. The sensor values are abstracted differently depending on the position of the producing sensor on the robot. We combine this approach with role based control, a control method for self-reconfigurable robots that we have developed earlier. We demonstrate that by combing these two approaches it is possible to make a self-reconfigurable robot consisting of six modules walk and avoid obstacles. However the reaction time of the robot is slow and therefore we discus possible ways of reducing the reaction time.
Analysis of a variable time-step discretization of the three-dimensional Fr&#x00E9;mond model for shape memory alloys
Authors: Ulisse Stefanelli
Venue: Mathematics of Computation (2002)

This paper deals with a semi-implicit time discretization with variable step of a three-dimensional Frémond model for shape memory alloys. Global existence and uniqueness of a solution is discussed. Moreover, an a priori estimate for the discretization error is recovered. The latter depends solely on data, imposes no constraints between consecutive time steps, and shows an optimal order of convergence when referred to a simplified model.
Error Analysis and Detection Procedures for a Hardware Implementation of the Advanced Encryption Standard
Authors: Guido Bertoni, Luca Breveglieri, Israel Koren, Paolo Maistri, Vincenzo Piuri
Venue: IEEE Transactions on Computers (2003)

The goal of the Advanced Encryption Standard (AES) is to achieve secure communication. The use of AES does not, however, guarantee reliable communication. Prior work has shown that even a single transient error occurring during the AES encryption (or decryption) process will very likely result in a large number of errors in the encrypted/decrypted data. Such faults must be detected before sending to avoid the transmission and use of erroneous data. Concurrent fault detection is important not only to protect the encryption/decryption process from random faults. It will also protect the encryption/decryption circuitry from an attacker who may maliciously inject faults in order to find the encryption secret key. In this paper, we first describe some studies of the effects that faults may have on a hardware implementation of AES by analyzing the propagation of such faults to the outputs. We then present two fault detection schemes: The first is a redundancy-based scheme while the second uses an error detecting code. The latter is a novel scheme which leads to very efficient and high coverage fault detection. Finally, the hardware costs and detection latencies of both schemes are estimated.
Ubiquitous display for dynamically changing environment
Authors: Yasuhisa Tokuda, Shinsuke Iwasaki, Yoichi Sato, Yasuto Nakanishi, Hideki Koike
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper proposes a novel method for ubiquitous displays using projectors in indoor environments. In particular, our method consists of two distinct features: automatic scene modeling of a dynamically changing indoor environment, and automatic selection of surfaces onto which various contents are displayed by taking into account both geometric and photometric properties. As a result, our method can be applied to dynamically changing scenes such as a meeting room where furniture and other objects are moved frequently.
A note on minimum degree conditions for supereulerian graphs
Authors: H. J. Broersma, Liming Xiong
Venue: Discrete Applied Mathematics (2002)

A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut S ⊆ E(G) with |S| ≤ 3 satisfies the property that each component of G - S has order at least (n - 2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ ≥ 4: If G is a 2-edge-connected graph of order n with δ(G) ≥ 4 such that for every edge xy ∈ E(G) , we have max{d(x),d(y)} ≥ (n - 2)/5 - 1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G) ≥ 4 cannot be relaxed.
Implementing Service Quality in IP Networks
Authors: Vilho Raeisaenen
Venue:  (2003)

:While more and more data is shifted from circuit-switched to packet-switched networks, the users of these networks expect a smooth, continuously unproblematic service (unrelated to the amount of data transported). Therefore, the reliability of a network as well as the satisfaction of its users relies largely on Quality of Service (QoS). Service quality through resource management in IP networks will ensure that sufficient resources are available to fulfil the delay of applications and packet loss requirements. This year several books on QoS from the angle of operators/engineers have been published HOWEVER, none of these titles tackle the management side of the problem. This book shows how to determine quality requirements of services, it discusses and considers the various means of allocating network resources and of supervising the service quality. Furthermore, it explores strategies for allocating network resources and their relation to revenue or operator utility as well as service allocation optimization. The book concludes with a Nokia case study that illustrates the previously mentioned concepts. Essential reading for networking professionals wishing to understand service quality management in IP networks, as well as students needing to understand principles and basic techniques of service quality management.
Information technology in construction: how to realise the benefits?
Authors: Lauri Koskela, Abdul Samad Kazi
Venue: Socio-technical and human cognition elements of information systems (2003)

Advancement in the utilisation of computers has, in recent years, become a major, even dominating research and development target in the architecture, engineering and construction industry. However, in empirical investigations, no major benefits accruing from construction IT have been found. Why do the many IT applications, which when separately analysed seem so well justified, fail to produce positive impacts when the totality of the construction project is analysed? The objective of this chapter is to find the explanation for this paradox and to provide initial guidelines as to what should be done to correct the situation.
A Hierarchical Approach to Managing Dairy Routing
Authors: Belarmino Adenso-Diaz, Monica Gonzalez, Emerita Garcia
Venue: Interfaces (1998)

We designed and implemented a decision support system to organize the delivery network for the products of a large dairy. To deal with this complex problem, we employed a five-level hierarchic structure distributing the clients among the sales promoters in the levels of greater aggregation and assigning shops to individual drivers in the level with the greatest detail, which corresponds to a version of the traveling salesman problem with time windows. We implemented the model on a microcomputer, importing the necessary data from the company mainframe.
Improved Dynamic Programming Methods for Optimal Control of Lumped-Parameter Stochastic Systems
Authors: C. Russell Philbrick,  Jr., Peter K. Kitanidis
Venue: Operations Research (2001)

New dynamic programming methods are developed to solve stochastic control problems with a larger number of state variables than previously possible. These methods apply accurate interpolation to numerical approximation of continuous cost-to-go functions, greatly reducing the number of discrete states that must be evaluated. By efficiently incorporating information on first and second derivatives, the approximation reduces computational effort by several orders of magnitude over traditional methods. Consequently, it is practical to apply dynamic programming to complex stochastic problems with a larger number of state variables than traditionally possible. Results are presented for hypothetical reservoir control problems with up to seven state variables and two random inputs.
On a boundary value problem for first-order scalar functional differential equations
Authors: R. Hakl, A. Lomtatidze, B. Půža
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

Nonimprovable effective sufficient conditions for solvability and unique solvability of the boundary value problem u'(t) = F(u)(t), u(a) = h(u), where F : C([a,b];R) → L([a,b];R) is a continuous operator satisfying the Carathèodory condition and h : C([a,b];R) → R is a continuous functional, are established.
Analysis of Stochastic Assembly with Gi-Distributed Assembly Time
Authors: W. E. Wilhelm, Pradip Som
Venue: INFORMS Journal on Computing (1999)

In this article, we study an assembly system that supplies an end-product inventory. We allow assembly operation times to be general, independent (GI) distributed and analyze the system as a Markov renewal process, deriving a closed-form expression for long-run Palm probabilities of both kit and end-product inventory positions. We then present a numerical procedure to obtain various performance measures using the matrix-geometric approach. Finally, we describe insights about the operation of the assembly system that are made possible by our analysis, in particular, showing the effects of kit buffer capacity on kit and end-product inventory positions.
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
Authors: Tjark Vredeveld, Cor Hurkens
Venue: INFORMS Journal on Computing (2002)

This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-relaxation or to a convex quadratic-programming relaxation. We also investigate dominance relations among the lower bounds resulting from these relaxations.
Asserting performance expectations
Authors: Jeffrey S. Vetter, Patrick H. Worley
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Traditional techniques for performance analysis provide a means for extracting and analyzing raw performance information from applications. Users then compare this raw data to their performance expectations for application constructs. This comparison can be tedious for the scale of today's architectures and software systems. To address this situation, we present a methodology and prototype that allows users to assert performance expectations explicitly in their source code using performance assertions. As the application executes, each performance assertion in the application collects data implicitly to verify the assertion. By allowing the user to specify a performance expectation with individual code segments, the runtime system can jettison raw data for measurements that pass their expectation, while reacting to failures with a variety of responses. We present several compelling uses of performance assertions with our operational prototype, including raising a performance exception, validating a performance model, and adapting an algorithm empirically at runtime.
Shared freeform input for note taking across devices
Authors: Laurent Denoue, Patrick Chiu, Tohru Fuse
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Shared freeform input is a technique for facilitating note taking across devices during a meeting. Laptop users enter text with a keyboard, whereas PDA and Tablet PC users input freeform ink with their stylus. Users can quickly reuse text and freeform ink already entered by others. We show how a new technique, freeform pasting, allowed us to deal with a variety of design issues such as quick and informal ink sharing, screen real estate, privacy and mixing ink-based and textual material.
Conjugate gradient method for dual-dual mixed formulations
Authors: Gabriel N. Gatica, Norbert Heuer
Venue: Mathematics of Computation (2002)

We deal with the iterative solution of linear systems arising from so-called dual-dual mixed finite element formulations. The linear systems are of a two-fold saddle point structure; they are indefinite and ill-conditioned. We define a special inner product that makes matrices of the two-fold saddle point structure, after a specific transformation, symmetric and positive definite. Therefore, the conjugate gradient method with this special inner product can be used as iterative solver. For a model problem, we propose a preconditioner which leads to a bounded number of CG-iterations. Numerical experiments for our model problem confirming the theoretical results are also reported.
Game programming with the sdl
Authors: Bob Pendleton
Venue: Linux Journal (2003)

With this well-tested library, you can easily develop games for Linux and non-Linux platforms.
Iterative compilation
Authors: P. M. W. Knijnenburg, T. Kisuki, M. F. P. O'Boyle
Venue: Embedded processor design challenges: systems, architectures, modeling, and simulation-SAMOS (2002)

In this paper, we give an overview of a novel approach to the problem of how to select compiler optimizations, their parameters, and the order in which to employ them. In particular, we concentrate on the problem of how to select tile sizes and unroll factors simultaneously. We approach this problem in an architecturally adaptive manner by means of iterative compilation, where we generate many versions of a program and decide upon the best by actually executing them and measuring their execution time. We evaluate several iterative strategies. We compare the levels of optimization obtained by iterative compilation to several well-known static techniques and show that we outperform each of them on a range of benchmarks across a variety of architectures. Next we discuss how to incorporate static models as a means to filter out certain combinations of transformations that are unlikely to produce good results. Finally, we show that the approach is applicable to real programs by employing the technique to three SPECfp benchmarks.
On the Complementary Value of Accurate Demand Information and Production and Supplier Flexibility
Authors: Joseph M. Milner, Panos Kouvelis
Venue: Manufacturing Service Operations Management (2002)

We study the value of information, production flexibility, and supplier flexibility for a good for which an initial and a subsequent order may be placed. We consider a Bayesian model of demand in which the unknown mean demand rate is assumed to have a prior, which is a mixture of two normal distributions corresponding to the demand forecast for an innovative (fashion) good. We develop three models of production flexibility: a static model requiring initial placement of both orders, a partially dynamic model requiring a fixing of the time that the second order will be made, and a fully dynamic model with no restrictions on ordering. Supplier flexibility is modeled through supply lead times. We observe that the magnitude of the savings from the static to the fully flexible model, corresponding to the sum of the values of information and production flexibility, reflects all sources of variability: differences between demand means of the prior mixture, variability within each prior, and variability about the observed mean. We observe that as the difference between high and low demand cases increases, the value of information increases, though for long lead times, production flexibility is required to take advantage of the updated information. Further, we observe that the greater the uncertainty within each prior distribution, the greater the value of information relative to the value of production flexibility, particularly for long lead times. However, the greater the uncertainty around the mean demand, which is the uncertainty that cannot be resolved through observation, the lower the value of information. Finally, we observe that the value of supply flexibility grows initially in a concave then convex manner as a function of the supply lead times.
Compromise candidates in positive goal scenarios
Authors: Frederick L. Crabbe
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Among many properties suggested for action selection mechanisms, one prominent one is the ability to select compromise actions. This paper performs an experimental analysis of compromise behavior in an attempt to determine exactly how much compromise behavior aids an animat. The paper concludes that the ability to select compromise actions in some common cases does provide some additional welfare to the animat, but less than previously postulated.
Limiting privacy breaches in privacy preserving data mining
Authors: Alexandre Evfimievski, Johannes Gehrke, Ramakrishnan Srikant
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The model is then built over the randomized data, after first compensating for the randomization (at the aggregate level). This approach is potentially vulnerable to privacy breaches: based on the distribution of the data, one may be able to learn with high confidence that some of the randomized records satisfy a specified property, even though privacy is preserved on average.In this paper, we present a new formulation of privacy breaches, together with a methodology, "amplification", for limiting them. Unlike earlier approaches, amplification makes it is possible to guarantee limits on privacy breaches without any knowledge of the distribution of the original data. We instantiate this methodology for the problem of mining association rules, and modify the algorithm from [9] to limit privacy breaches without knowledge of the data distribution. Next, we address the problem that the amount of randomization required to avoid privacy breaches (when mining association rules) results in very long transactions. By using pseudorandom generators and carefully choosing seeds such that the desired items from the original transaction are present in the randomized transaction, we can send just the seed instead of the transaction, resulting in a dramatic drop in communication and storage cost. Finally, we define new information measures that take privacy breaches into account when quantifying the amount of privacy preserved by randomization.
Social Consequences of Internet Use: Access, Involvement, and Interaction
Authors: James E. Katz, Ronald E. Rice
Venue:  (2002)

:Drawing on nationally representative telephone surveys conducted from 1995 to 2000, James Katz and Ronald Rice offer a rich and nuanced picture of Internet use in America. Using quantitative data, as well as case studies of Web sites, they explore the impact of the Internet on society from three perspectives: access to Internet technology (the digital divide), involvement with groups and communities through the Internet (social capital), and use of the Internet for social interaction and expression (identity). To provide a more comprehensive account of Internet use, the authors draw comparisons across media and include Internet nonusers and former users in their research. The authors call their research the Syntopia Project to convey the Internet's role as one among a host of communication technologies as well as the synergy between people's online activities and their real-world lives. Their major finding is that Americans use the Internet as an extension and enhancement of their daily routines. Contrary to media sensationalism, the Internet is neither a utopia, liberating people to form a global egalitarian community, nor a dystopia-producing armies of disembodied, lonely individuals. Like any form of communication, it is as helpful or harmful as those who use it.
Articulation of sensory-motor experiences by "forwarding forward model": from robot experiments to phenomenology
Authors: Jun Tani
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This paper introduces the so-called "Forwarding Forward Model" network that explains how complex behavior can be learned and generated while its sensory-motor flow is hierarchically articulated. This model is characterized by a distributed representation of behavior primitives at each level, which contrasts with our prior models utilizing localist views. The model was examined through experiments using a 4-degrees of freedom arm robot with a vision system. The experimental results showed that behaviors can be generated both robustly and flexiblely going through the bottom-up and the top-down interactions between levels. The characteristics of the distributed representation are discussed. Our discussion is further extended to the phenomenological issue of subjective time perception. A novel idea for explaining the sense of" nowness" is derived by applying our idea of articulating experiences to Husserl's notions of retention and protention.
Risk Mitigation in Virtual Organizations
Authors: Martha Grabowski, Karlene H. Roberts
Venue: Organization Science (1999)

This paper examines the problem of risk mitigation in virtual organizations (VOs). We begin by discussing risk propensity in virtual organizations, and draw on a variety of research to suggest processes important in obtaining high levels of reliable performance in VOs. From this research we identify four processes we think are important: organizational structuring and design, communication, culture, and trust. Based on existing research done in conventional and high reliability organizations (HROs), we suggest how these processes may enhance reliability in VOs. We discuss how thoughtful management of these attributes can mitigate risk, and conclude with a theoretical and research agenda for future work.