ppxscal/embedding_network huggingface dataset:
Anatomy-based 3D facial modeling for expression animation
Authors: Yu Zhang, Edmond C. Prakash, Eric Sung
Venue: Machine Graphics Vision International Journal (2002)

In this paper we propose a new hierarchical 3D facial model that conforms to the human facial anatomy for realistic facial expression animation. The facial model has a hierarchical biomechanical structure, incorporating a physically-based approximation to facial skin tissue, a set of anatomically-motivated facial muscle actuators and underlying skull structure. The deformable skin model has multi-layer structure to approximate different types of soft tissue. It takes into account the nonlinear stress-strain relationship of the skin and the fact that soft tissue is almost incompressible. Different kinds of muscle models have been developed to simulate the distribution of the muscle force on the skin due to muscle contraction. By the presence of the skull model, our facial model takes advantage of both more accurate facial deformation and the consideration of facial anatomy during the interactive definition of facial muscles. Under the muscular force, the deformation of the facial skin is evaluated by solving the governing dynamic equation numerically. To improve computational efficiency, we use a localized, semi-implicit integration method which allows a larger time step to be taken in the simulation while retaining stability. The dynamic facial animation algorithm runs at an interactive rate with flexible and realistic facial expressions to be generated.
Optimal stabilization of steady-states of the genital herpes epidemic during infinite and finite time intervals
Authors: Awad El-Gohary, Fawzy A. Bukhari
Venue: Applied Mathematics and Computation (2003)

A spatial stochastic model to study the optimal stabilization of the steady-states of the genital herpes epidemic is introduced. The steady-states of this model are found. The stability and instability of these states are investigated. The optimal stabilization of the unstable steady-states are studied. The control law is obtained from the conditions that ensure the optimal stabilization of these states. The general solution of the controlled herpes epidemic models is derived. Numerical examples are introduced.
On the primitive numbers of power p and its asymptotic property
Authors: Zhang Wenpeng, Liu Duansen
Venue: Smarandache Notions Journal (2002)

Let p be a prime, n be any positive integer, Sp(n) denotes the smallest integer such that Sp(n)! is divisible by pn. In this paper, we study the asymptotic properties of Sp(n), and give an interesting asymptotic formula for it.
Using reordering technique for mobile transaction management in broadcast environments
Authors: SungSuk Kim, SangKeun Lee, Chong-Sun Hwang
Venue: Data Knowledge Engineering (2003)

As computer hardware and wireless network technologies are developed to a high degree, there are many research efforts which intend to utilize data broadcasting to a large population of mobile clients through wireless channels. In recent years, different models of data delivery have been explored, particularly the periodic push model where the server repetitively disseminates information without any explicit request. In this paper, we devise new transaction processing algorithms, O-Post for update transactions and O-Pre for read-only transactions, in broadcast environments. Basically, each client executes its transactions in an optimistic manner and does some consistency checks based on periodic invalidation reports. When any kind of conflicts is found, the conflict order is determined according to the notion of reordering and the remaining operations are executed to hold the decision. We also develop a cache algorithm to cope with frequent restarts due to the optimistic execution. Experimental results are given to show the benefits of the proposed algorithms.
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
Authors: Andrei Voronkov
Venue: Journal of Automated Reasoning (2003)

We characterize provability in intuitionistic logic with equality in terms of a constraint calculus. This characterization uncovers close connections between provability in intuitionistic logic with equality and solutions to simultaneous rigid E-unification. We show that the problem of existence of a sequent proof with a given skeleton is polynomial-time equivalent to simultaneous rigid E-unifiability. This gives us a proof procedure for intuitionistic logic with equality modulo simultaneous rigid E-unification. We also show that simultaneous rigid E-unifiability is polynomial-time reducible to intuitionistic logic with equality. Thus, any proof procedure for intuitionistic logic with equality can be considered as a procedure for simultaneous rigid E-unifiability. In turn, any procedure for simultaneous rigid E-unifiability gives a procedure for establishing provability in intuitionistic logic with equality.
E-services: a look behind the curtain
Authors: Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

The emerging paradigm of electronic services promises to bring to distributed computation and services the flexibility that the web has brought to the sharing of documents. An understanding of fundamental properties of e-service composition is required in order to take full advantage of the paradigm. This paper examines proposals and standards for e-services from the perspectives of XML, data management, workflow, and process models. Key areas for study are identified, including behavioral service signatures, verification and synthesis techniques for composite services, analysis of service data manipulation commands, and XML analysis applied to service specifications. We give a sample of the relevant results and techniques in each of these areas.
Computation of class numbers of quadratic number fields
Authors: Stéphane Louboutin
Venue: Mathematics of Computation (2002)

We explain how one can dispense with the numerical computation of approximations to the transcendental integral functions involved when computing class numbers of quadratic number fields. We therefore end up with a simpler and faster method for computing class numbers of quadratic number fields. We also explain how to end up with a simpler and faster method for computing relative class numbers of imaginary abelian number fields.
Aggregation and Mixed Integer Rounding to Solve MIPs
Authors: Hugues Marchand, Laurence A. Wolsey
Venue: Operations Research (2001)

In this paper, we discuss the use of mixed integer rounding (MIR) inequalities to solve mixed integer programs. MIR inequalities are essentially Gomory mixed integer cuts. However, as we wish to use problem structure, we insist that MIR inequalities be generated from constraints or simple aggregations of constraints of the original problem. This idea is motivated by the observation that several strong valid inequalities based on specific problem structure can be derived as MIR inequalities.Here we present and test a separation routine for such MIR inequalities that includes a heuristic row aggregation procedure to generate a single knapsack plus continuous variables constraint, complementation of variables, and finally the generation of an MIR inequality. Inserted in a branch-and-cut system, the results suggest that such a routine is a useful additional tool for tackling a variety of mixed integer programming problems.
An evolutionary approach to quantify internal states needed for the woods problem
Authors: DaeEun Kim, John C. T. Hallam
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

The Woods Problem is a difficult problem for purely reactive systems to handle. The difficulties are related to the perceptual aliasing problem, and the use of internal memory has been suggested to solve the problem. In this paper a novel approach in evolutionary computation is introduced to quantify the amount of memory required for a given task. The approach has been applied to Woods Problems such as wood101, woods102, Sutton's gridworld and woods14.Finite state machine controllers are used, as these permit easy measurement of the amount of memory in the controller. A concurrent evolutionary search for-the minimal but optimal control structure in memory-based systems, using an evolutionary Pareto-optimal search mechanism, determines the best behavior fitness for each level of controller memory. This memory analysis demonstrates the effect of internal memory in evolved controllers for Woods Problems and is also used to investigate the relationship between the number of sensors available to an agent and the amount of memory necessary for effective behavior.
Optimization Models for Restructuring BASF North America's Distribution System
Authors: Slava Sery, Vince Presti, Donald E. Shobrys
Venue: Interfaces (2001)

By 1995, annual distribution costs for BASF North America's packaged goods were nearly $100 million. The firm explored trade-offs between customer service and operating costs in a redesign effort using linear-programming-based models. The project team adapted formulations to the extensive available data and used a series of formulations to cope with the scale of the project. A flexible modeling tool aided the team in implementing these formulations. The resulting revised distribution system reduced costs and improved customer service, and the modified distribution network took next-day deliveries from 77 percent to 90 percent. Although the team expected reduction in annual costs of 10 percent, subsequent customer service initiatives reduced the potential savings. In studies following the initial distribution changes the team estimated annual costs savings at six percent, but also identified a one-time nine-percent improvement in cash flow from inventory reductions. BASF also applied the models to operations in Scandinavia, Europe, and the Asia-Pacific area.
Web reporting made easy
Authors: Brent Wilson
Venue: Journal of Computing Sciences in Colleges (2002)

Much of today's focus on client-server computing is turning towards three-tier web-based applications using either an open source model or the Microsoft model. In either case, creating web-based reports that are not only easy to read from the web but are also in a clean printable 8.5x11 format is a challenge. Typically, in a standard web report data is pulled from a database and then formatted for output using middle-tier code and HTML tables. The report is formatted for screen display and not the printed page.This tutorial will demonstrate a solution to make web reporting easy. The Microsoft model will be used for the three-tier application. The architecture used will be a Windows 2000 server running IIS web-server and SQL Server 2000. The middle-tier used will be ASP (VBScript) along with a custom COM object created during the tutorial that will instantiate MS Access in order to utilize the reporting engine. Each participant will receive a fully documented HOW-TO manual to guide them through the implementation of such a solution within their environment.
On the consistency of the minimum evolution principle of phylogenetic inference
Authors: François Denis, Olivier Gascuel
Venue: Discrete Applied Mathematics (2003)

The goal of phylogenetic inference is the reconstuction of the evolutionary history of various biological entities (taxa) such as genes, proteins, viruses or species. Phylogenetic inference is of major importance in computational biology and has numerous applications ranging from the study of biodiversity to sequence analysis. Given a matrix of pairwise distances between taxa, the minimum evolution (ME) principle consists in selecting the tree whose length is minimal, where the tree length is estimated within the least-squares framework. The ME principle has been shown to be statistically consistent when using the ordinary least-squares criterion (OLS) and inconsistent with the more general weighted least-squares criterion (WLS). Unfortunately, OLS+ME inference method can provide poor results since the variances of the input data are not taken into account. Here we study a model which lies between OLS and WLS, classical in statistics and data analysis, and we prove that the ME principle is statistically consistent within this model. Our proof is inductive and relies on a time optimal recursive algorithm for estimating edge lengths. As a corollary, we obtain a different and simpler proof of the consistency result for OLS+ME.
Efes Beverage Group Makes Location and Distribution Decisions for its Malt Plants
Authors: Murat Koksalan, Haldun Sural
Venue: Interfaces (1999)

We conducted a study for Efes Beverage Group to evaluate various sites as potential locations for new malt plants. We performed an economic analysis that showed the inferiority of some alternatives. To evaluate the remaining alternatives, we developed a mixed-integer-programming model that considers both the location of new malt plants and the distribution of barley and malt. It considers the long-run effects of the decisions and minimizes the present value of total costs. Sakarya, Izmir, and Ankara turned out to be the best locations for new malt plants. Efes is currently using the model for distribution decisions. Based on our results and new developments that occurred since then, top managers are currently debating where and when to locate the new malt plants.
On the number of vertices belonging to all maximum stable sets of a graph
Authors: Endre Boros, Martin C. Golumbic, Vadim E. Levit
Venue: Discrete Applied Mathematics (2002)

Let us denote by α(G) the size of a maximum stable set, and by µ(G) the size of a maximum matching of a graph G, and let ξ(G) be the number of vertices which belong to all maximum stable sets. We shall show that ξ(G) ≥ 1+α(G)-µ(G) holds for any connected graph, whenever α(G) > µ(G). This inequality improves on related results by Hammer et al. (SIAM J. Algebraic Discrete Methods 3 (1982) 511) and by Levit and Mandrescu [(prE-print math. CO/9912047 (1999) 13pp.)].We also prove that on one hand, ξ(G) > 0 can be recognized in polynomial time whenever µ(G) < |V(G)|/3, and on the other hand determining whether ξ(G) > k is, in general, NP-complete for any fixed k ≥ 0.
Compiler-directed instruction cache leakage optimization
Authors: W. Zhang, J. S. Hu, V. Degalahal, M. Kandemir, N. Vijaykrishnan, M. J. Irwin
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Excessive power consumption is widely considered as a major impediment to designing future microprocessors. With the continued scaling down of threshold voltages, the power consumed due to leaky memory cells in on-chip caches will constitute a significant portion of the processor's power budget. This work focuses on reducing the leakage energy consumed in the instruction cache using a compiler-directed approach.We present and analyze two compiler-based strategies termed as conservative and optimistic. The conservative approach does not put a cache line into a low leakage mode until it is certain that the current instruction in it is dead. On the other hand, the optimistic approach places a cache line in low leakage mode if it detects that the next access to the instruction will occur only after a long gap. We evaluate different optimization alternatives by combining the compiler strategies with state-preserving and state-destroying leakage control mechanisms.
Stability in a two-dimensional free boundary combustion model
Authors: Luca Lorenzi, Alessandra Lunardi
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We prove rigorously the stability of the planar travelling wave solution to a free boundary system in R2, arising as a model in combustion theory, for appropriate values of the reduced Lewis number. After changements of coordinates and unknowns, the problem is reduced to the stability of the null solution of a fixed boundary parabolic system. The difficulties consist in the fact that the final system is fully nonlinear, and the spectrum of the linearized system contains the halffine (-∞, 0]. They are overcome setting the problem in a suitably weighted Hölder space.
Vector-valued variational principles
Authors: Catherine Finet, Lucas Quarta, Christophe Troestler
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

In the context of vector-valued extensions of variational principles we are dealing with functions taking values in a Banach space partially ordered by a closed convex pointed cone. We introduce and study a new notion of semi-continuity connected with the order and we improve the vector-valued extensions of Deville-Godefroy-Zizler perturbed minimization principle.
Are defect-tolerant circuits with redundancy really cost-effective? Complete and realistic cost model
Authors: Yves Gagnon, Yvon Savaria, Michel Meunier, Claude Thibeault
Venue: 1997 Workshop on Defect and Fault-Tolerance in VLSI Systems (1997)

Yield enhancement for fault tolerant circuits with redundancy has been widely studied during the last years. Recent manufacturing technologies have brought out steady and significant improvement regarding contamination and defect density and have forced us to re-evaluate the economical advantages of circuits with redundancy. The main goal of this paper is to propose a realistic cost model for fault tolerant chips that includes manufacturing, test and reconfiguration processing steps. We demonstrate, with our model, how optimum and cost-effective redundancy levels can be determined, for a class of fault tolerant architectures, and we compare our results to the usual figure of merit calculation. We demonstrate that wafer test costs can have significant impact on the cost effectiveness of redundant implementation. This model also leads us to show that for a optimized fault tolerant chip, the silicon cost tends to increase as a quasi-linear function of chip area. We finally demonstrate that, considering future fault densities expected for the next decade, economical advantages of redundancy will probably vanish for most integrated circuits when they are implemented with mature processes.
Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models
Authors: P. G. Taylor, N. M. Van Dijk
Venue: Operations Research (1998)

We consider a class of models for multicomponent systems in which components can break down and be repaired in a dependent manner and where breakdown and repair times can be arbitrarily distributed. The problem of calculating the equilibrium distribution and, from this, the expected performability for these models is intractable unless certain assumptions are made about breakdowns and repairs. In this paper we show that the performability of multicomponent systems that do not satisfy these rules can be bounded by tractable modifications. Our results are proved by stochastic comparability arguments and a Markov reward technique, which is of interest in itself as it enables one to prove that the equilibrium distribution of one process can be bounded by that of another even when the sample paths of the process are not. This is illustrated by an example.
Perceived Victimization in the Workplace: The Role of Situational Factors and Victim Characteristics
Authors: Karl Aquino, Murray Bradfield
Venue: Organization Science (2000)

Harmful interpersonal behavior at work has generally been studied from the perspective of perpetrators. In contrast, theories of victimization suggest that other factors may also determine why certain individuals are more frequently harmed than others. For example, there may be situational factors that contribute to an environment that allows or fails to inhibit harmful actions. Other incidents of workplace harm may be consciously or unconsciously influenced by the victims themselves. This empirical study extends previous research on harmful workplace behavior by examining whether the situational variable of job status and the dispositional characteristics of aggressiveness and negative affectivity predict self-perceived victimization. Based on research in criminal victimology, we hypothesized that an employee's job status would be significantly related to perceived victimization. Research on victims of bullying was the basis for the predicted effects of negative affectivity and aggressiveness. Data were provided by a randomly selected sample of employees from a city government who completed a survey as part of an organizational assessment. We performed exploratory and confirmatory factor analyses on employee responses to develop suitable measures of victimization. The analyses revealed that perceived victimization took either direct (e.g., name-calling) or indirect (e.g., sabotaging work) forms. Hierarchical regression was used to test the study hypotheses. Results showed that job status did not significantly influence perceived victimization. However, employees who were high in aggressiveness and negative affectivity perceived higher levels of victimization than those who were low in these traits. Implications for organizations are discussed and future research directions are offered.
Response Time Behavior of Voting Schemes for Managing Replicated Data
Authors: Ing-Ray Chen, Ding-Chau Wang, Chih-Ping Chu
Venue: 23rd International Computer Software and Applications Conference (1999)

Voting is a simple and yet effective way of managing replicated data in distributed systems. In this paper we analyze its response time behavior. We investigate a technique for obtaining the access time distribution for requests that access replicated data maintained by the distributed system. The technique is based on Petri net modeling and can be used to estimate the reliability of real-time applications which must access replicate data with a deadline requirement.
A World of Abundance
Authors: William McDonough, Michael Braungart
Venue: Interfaces (2000)

Industry and the environment appear to be at odds because current methods of production, extraction, and disposal are destructive to the natural world. Conventional responses, such as eco-efficiency, focus on doing more with less, restricting industry, and curtailing growth. We view the conflict between industry and the environment as a design problem. Instead of simply reducing industry's negative effects, we suggest companies redesign products and processes for healthy, long-term prosperity. We present a new paradigm for industry, eco-effectiveness; three new design principles: waste equals food, use current solar income, and respect diversity; new decision criteria that integrate ecology, economy, and equity; and beginning steps businesses can take towards a world of abundance, rather than one of limits and constraints.
A Multilevel Approach to the Travelling Salesman Problem
Authors: Chris Walshaw
Venue: Operations Research (2002)

We motivate, derive, and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour, and then employs either the Lin-Kernighan (LK) or the Chained Lin-Kernighan (CLK) algorithm to refine the solution on each of the coarsened problems in reverse order. In experiments on a well-established test suite of 80 problem instances we found multilevel configurations that either improved the tour quality by over 25% as compared to the standard CLK algorithm using the same amount of execution time, or that achieved approximately the same tour quality over seven times more rapidly. Moreover, the multilevel variants seem to optimise far better the more clustered instances with which the LK and CLK algorithms have the most difficulties.