ppxscal/embedding_network huggingface dataset:
Efficient synthesis of physically valid human motion for computer animation
Authors: Nancy S. Pollard
Venue:  (2003)

Animation is a powerful storytelling medium, within which artists can develop themes relating to the viewer's own experiences and physical existence. The plausibility of an animation depends on both objective criteria, such as obeying the laws of physics, and subjective criteria, such as exhibiting a consistent style of motion. One appealing vision for animation systems is that they somehow take care of the objective criteria, while allowing artists as much freedom and expressive power as possible. One approach toward this vision has been to compute a motion which optimizes energy expenditure while meeting both physical laws and animator constraints. Optimal energy expenditure has some nice properties, such as providing the appearance of squash-and-stretch in the jumping motion of a simple character, but extending these results to humanlike characters has proven difficult&mdash;the optimization process is often viewed as being slow, scaling poorly with character complexity, and being difficult to control. Much may be gained by focusing on physical validity rather than the optimality of physically based quantities. This thesis shows that an approach focusing on physical validity rather than physical optimality can improve the theoretical complexity of each iteration of a numerical optimization routine from O(N2) to O( N), where N is the number of degrees of freedom of the character. Because there is a larger space of physically valid solutions than physically optimal solutions, this approach in principle also leaves more room for animator control. The animation system is particularly useful for synthesizing highly dynamic motions. Results are shown of humanlike characters having from 7 to 22 degrees of freedom performing a variety of motions, including swinging, leaping, and back-flipping off a high-bar.
The PRIMA System for Privilege Management, Authorization and Enforcement in Grid Environments
Authors: M. Lorch, D. B. Adams, D. Kafura, M. S. R. Koneni, A. Rathi, S. Shah
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Many grid usage scenarios depend on small, dynamicworking groups for which the ability to establishtransient collaboration with little or no intervention fromresource administrators is a key requirement. The systemdeveloped, PRIMA, focuses on the issues of managementand enforcement of fine-grained privileges. Dynamicaccount creation and leasing as well as expressiveenforcement mechanisms facilitate highly dynamicauthorization policies and least privilege access toresources. PRIMA mechanisms enable the use of fine-grainedaccess rights, reduce administrative costs toresource providers, enable ad hoc and dynamiccollaboration scenarios, and can also be used to provideimproved security service to long-lived grid communitieswhile leveraging other work in the grid computing andsecurity domains.
DSQoS-distributed architecture providing QoS in summary warehouses
Authors: João Pedro Costa, Pedro Furtado
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

Data warehouses (DW) that store enormous quantities of data put a major challenge in what concerns performance and scalability, as users request instant answers to their queries. Traditional solutions rely on very expensive architectures and structures for speedup and scale-up. The Summary Warehouse (SW) is an inexpensive solution that has the potential to deliver very fast approximate answers to aggregate queries using only general-purpose sampling summaries.Although summaries are expected to be extremely fast, some analysis requires larger summaries to estimate individual group results, compromising the speedup advantage. This is the accuracy/speedup (A/S) tradeoff.In this paper we propose the "Distributed Set-of-Summaries for Quality of Service" (DSQoS) that solves the A/S issue by optimizing the accuracy and response time for each query pattern in order to guarantee a desired Quality of Service (QoS). This QoS is defined in terms of response time and accuracy bounds. The strategy determines the required summary size to guarantee the accuracy targets and then dynamically select a set of summaries, distributed in various nodes, which can ensure the QoS constraints (time and accuracy). The strategy presents enormous possibilities since each node can contain summaries with different sizes, depending on the node characteristics, and can dynamically be added and removed from the system.We discuss the design of the approach and the strategies used to process queries. In the experimental section we show how the approach is able to deliver almost instant and accurate answers without employing expensive architectures, which would be impossible using other strategies.
A greedy algorithm for some classes of integer programs
Authors: V. V. Shenmaier
Venue: Discrete Applied Mathematics (2003)

We establish a necessary and sufficient condition for a greedy algorithm to find an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalization of matroids and integer polymatroids preserving the optimality of greedy solutions.
STEPS: Experimenting a New Software-Based Strategy for Testing SoCs Containing P1500-Compliant IP Cores
Authors: M. Benabdenbi, A. Greiner, F. Pêcheux, E. Viaud, M. Tuna
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents STEPS, an innovative software-based approach for testing P1500-compliant SoCs. STEPS is based on the concept that the ATE is not considered as an initiator applying vectors to the SoC test pins but rather as a target, a huge repository of 32-bits test data and control commands. The ATE is connected to the functional SoC external RAM controller interface. The only additional test component in the SoC is a P1500 test processor that converts test data into serial P1500 streams. This paper applies the STEPS methodology to SoCs containing a VCI-compliant interconnect, a microprocessor, P1500 compliant IP cores and an external RAM controller interface. Using the ITC02 SoC benchmarks a comparison is done between the STEPS architecture and a classical bus-based strategy.
Computational aspects of the refinement of 3D complex meshes
Authors: J. P. Suárez, P. Abad, A. Plaza, M. A. Padrón
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The refinement of tetrahedral meshes is a significant task in many numerical and discretizations methods. The computational aspects for implementing refinement of meshes with complex geometry need to be carefully considered in order to have real-time and optimal results. In this paper we enumerate the relevant computational aspects of tetrahedral refinement algorithms. For local and adaptive refinement we give numerical results of the computational propagation cost of a general class of longest edge based refinement and show the implications of the complex geometry in the global process.
Sizing and Characterization of Leakage-Control Cells for Layout-Aware Distributed Power-Gating
Authors: Pietro Babighian, Luca Benini, Enrico Macii
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper proposes a methodology for sleep transitor sizing for usage in a novel, single-threshold leakage cut-off approach, where power gating cells are distributed row-by-row in a fully placed circuit. Sizing equations are obtained by performing SPICE simulations for a 130nm technology. Furthermore, the layout of a test case is considered and power and delay values are extracted in order to demonstrate the practical impact of our solution.
Specifying reactive systems by abstract events
Authors: E. Astesiano, G. Reggio
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

We consider the problem of specifying reactive systems at different level of abstraction and propose a method for connecting the requirement to the design phase. As in a variety of other approaches, we assume that a process is modelled by a labelled transition system. The requirement phase is supposed to define a class of models, while at the design level, usually via a stepwise refinement, essentially one model is singled out. The connection between the two phases is provided by the notion of abstract event, with its associated specification language. An abstract event is defined as a set of its concrete instances, which are labelled transition sequences and can occur as partial paths over labelled transition trees. Abstract events, which may be non-instantaneous and overlapping, are a flexible tool for expressing abstract requirements and, because of their semantics in term of labelled transition sequences, provide a rather transparent support to the refinement procedure.
The UTS time-sharing system: performance analysis and instrumentation
Authors: G. E. Bryan, J. E. Shemer
Venue: Proceedings of the second symposium on Operating systems principles (1969)

An approach is presented to analyzing and controlling hardware and software configurations of a time-sharing system given its load characteristics and desired performance. A mathematical model is developed which predicts response time to both interactive terminal requests and to compute bound programs. Estimates are obtained which relate performance to CPU load, file I/O load, and swap I/O load. Instrumentation contained within the UTS time-sharing system measures actual load and actual response during system operation, These measures suggest standards by which both load and response of time-shared systems could be compared, Extrapolation of the modeled and measured results allows prediction of performance for a variety of hardware configurations and user loads. Administrative controls allow dynamic tuning of the system during actual operation utilizing displays of current performance.
On computing, storing and querying frequent patterns
Authors: Guimei Liu, Hongjun Lu, Wenwu Lou, Jeffrey Xu Yu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Extensive efforts have been devoted to developing efficient algorithms for mining frequent patterns. However, frequent pattern mining remains a time-consuming process, especially for very large datasets. It is therefore desirable to adopt a "mining once and using many times" strategy. Unfortunately, there has been little work reported on managing and organizing a large set of patterns for future use. In this paper, we propose a disk-based data structure, CFP-tree (Condensed Frequent Pattern Tree), for organizing frequent patterns discovered from transactional databases. In addition to an efficient algorithm for CFP-tree construction, we also developed algorithms to efficiently support two important types of queries, namely queries with minimum support constraints and queries with item constraints, against the stored patterns, as these two types of queries are basic building blocks for complex frequent pattern related mining tasks. Comprehensive experimental study has been conducted to demonstrate the effectiveness of CFP-tree and efficiency of related algorithms.
SEED-Config: A case-based reasoning system for conceptual building design
Authors: Hugues Rivard, Steven J. Fenves
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

A case-based design functionality is a natural and intuitive addition to a design tool that can augment human capabilities and help designers remember and retrieve appropriate cases. SEED-Config, a design environment for conceptual building design, was developed to incorporate a case-based reasoning functionality to provide designers with initial potential solutions. The case representation in SEED-Config is the BENT information model, which records design knowledge, supports the hierarchical decomposition of design cases, offers multiple views, and encapsulates the outcome of the design in addition to the problem specification and the design solution. The case library was implemented in an object-oriented database management system to accumulate cases automatically and to provide efficient query facilities. The case retrieval aspect of SEED-Config offers three different methods to find the most useful cases stored in the case library: task-based, lineage-based, and customized. Case retrieval responds to the exploratory nature of the design process and supports versatile case retrieval by providing multiple paths to each case. The case adaptation aspect, which adjusts the selected case to the new problem to provide a complete solution, uses an adaptation method called derivational replay. The case-based design capabilities are completely integrated within the design environment from which the cases originate.
An Extension to UML Components to Consider Distribution Issues in Early Phases of Application Development
Authors: Anete Persch Espindola, Karin Becker, Avelino Francisco Zorzo
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Distributed component-based information systems are becoming one of the major trends in software engineering. Whereas distributed component technologies enable the development of reliable, scalable and secure systems, existing component-based development (CBD) techniques and methods do not explicitly address distribution. The earlier distribution requirements are considered and integrated with functional requirements, the least is the risk that the developed component architecture does not reflect these requirements. UML Components is a widely known CBD method composed of a number of phases targeted at theidentification of domain components (system and business), their respective interfaces, and their interaction model to compose the system architecture. In this work, we propose to extend the UML Components method to encompass distribution issues in early phases of application development, namely Requirements and Specification. The basic idea is to identify distributionrequirements that can be mapped into common distributed services (e.g. naming, concurrency). The extended method includes new or refined activities that help identifying distribution services, their provision through distributed components, and the resulting architecture that integrates system, business, and distribution components.
Towards integrative enterprise knowledge portals
Authors: Torsten Priebe, Günther Pernul
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Knowledge portals make an important contribution to enabling enterprise knowledge management by providing users with a consolidated, personalized user interface that allows efficient access to various types of (structured and unstructured) information. Today's portal systems allow combining access modules to different information sources side by side on a single portal webpage. However, there is no interaction between those so called portlets. When a user navigates within one portlet, the others remain unchanged, which means that each source has to be searched individually for relevant information.This paper discusses integration aspects within enterprise knowledge portals and presents an approach for communicating the user context (revealing the user's information need) among portlets, utilizing Semantic Web technologies. For example, the query context of an OLAP portlet, which provides access to structured data stored in a data warehouse, can be used by an information retrieval portlet in order to automatically provide the user with related documents found in the organization's document management system. The paper shortly presents a prototype that we are building to evaluate our approach, demonstrating such an OLAP and information retrieval integration.
Applications of Belief Functions in Business Decisions: A Review
Authors: Rajendra P. Srivastava, Liping Liu
Venue: Information Systems Frontiers (2003)

In this paper, we review recent applications of the Dempster-Shafer theory (DST) of belief functions to auditing and business decision-making. We show how DST can better map uncertainties in application domains than Bayesian theory of probabilities. We review the applications in auditing around three practical problems that challenge the effective application of DST, namely, hierarchical evidence, versatile evidence, and statistical evidence. We review the applications in other business decisions in two loose categories: judgment under ambiguity and business model combination. Finally, we show how the theory of linear belief functions, a new extension to DST, can provide an alternative solution to a wide range of business problems.
Robustness of a Distributed Knowledge Management Model
Authors: Mogens Kühn Pedersen, Michael Holm Larsen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

In globalizing competitive markets knowledge exchange between business organizations requires incentive mechanisms to ensure tactical purposes while strategic purposes are subject to joint organization and other forms of contractual obligations. Where property of knowledge (e.g. patents and copyrights) and contract-based knowledge exchange do not obtain network effectiveness because of prohibitive transaction costs in reducing uncertainty, we suggest a robust model for peer produced knowledge within a distributed setting. The peer produced knowledge exchange model relies upon a double loop knowledge conversion with symmetric incentives in a network since the production of actor specific knowledge makes any knowledge appropriation by use of property rights by the actors irrelevant. Without property rights in knowledge the actor network generates opportunity for incentive symmetry over a period of time. The model merges specific knowledge with knowledge from other actors into a decision support system specific for each actor in the network in recognition of actor role differences. The article suggests a set of 9 static and 5 dynamic propositions for the model to maintain symmetric incentives between different actor networks. The model is proposed for business networks.
Analog VLSI Architecture for Discrete Cosine Transform using Dynamic Switched Capacitors
Authors: Ashis Kumar Mal, Anindya Sundar Dhar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper describes an analog VLSI architecture, tocompute discrete cosine transform(DCT), using switched-switchedcapacitor blocks. The scheme operates from thegeneral expression of DCT where input samples are multipliedby all the DCT coefficients simultaneously usingan array of capacitors. These multiplied values are thenswitched parallely with the help of a cross-point switch, todifferent integrators to perform multiplication and accumulation(MAC). It can be used to compute DHT, DST and DFTand also its inverses. Proposed architecture is very simpleto implement and sutable where silicon area and power issuesare important with some compromise on accuracy.
Assessing usability evaluation methods on their effectiveness to elicit verbal comments from children subjects
Authors: Ilse E. H. van Kesteren, Mathilde M. Bekker, Arnold P. O. S. Vermeeren, Peter A. Lloyd
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

An exploratory study is described looking at children's ability to provide verbal comments in usability evaluation sessions. Six evaluation methods were applied to test an interactive toy by children aged 6 and 7. The results show that most verbal comments were gathered during Active Intervention sessions, by asking children questions during tasks. Unexpectedly, the Co-Discovery sessions were less successful, because children did not collaborate very well. Children also provided useful comments in the Thinking Aloud, Retrospection, and Peer Tutoring sessions. They could reflect on their actions at the end of Retrospection sessions, and were able to teach other children how to interact with the toy in Peer Tutoring sessions.
Internet-Assisted Laboratory Experiments for Distance Learning Systems
Authors: L. G. Guerrero, J. Carrillo, J. M. Ramírez, E. Palou, A. López-Malo, J. Welti-Chanes, R. P. Singh, K. Athmaram
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Universities are increasingly using the Internet toimprove undergraduate teaching, since it provides accessto sources not conveniently obtainable through othermeans, allows for the creation of unusually rich coursematerials, it is an exceptionally fine tool for creatingdensely woven, engaging, and highly demanding newcourse materials, and it can reinforce the conception ofstudents as active agents in the process of learning whileenhancing discussion groups unbounded by time or place(Singh, 1996; 2002). The objectives were:i) to create a set of instructional laboratory exercises,mainly in the areas of food and bioprocess engineeringthat contain remotely conducted experiments assisted bythe Internet,ii) to develop a complete set of instructions includingsoftware on how remotely conducted laboratories may beset up by an instructor, and iii) to evaluate the role ofremotely conducted experiments in the effectiveness ofteaching food and bioprocess engineering inundergraduate education.
A machine learning approach to coreference resolution of noun phrases
Authors: Wee Meng Soon, Hwee Tou Ng, Daniel Chung Yong Lim
Venue: Computational Linguistics (2001)

In this paper, we present a learning approach to coreference resolution of noun phrases in unrestricted text. The approach learns from a small, annotated corpus and the task includes resolving not just a certain type of noun phrase (e.g., pronouns) but rather general noun phrases. It also does not restrict the entity types of the noun phrases; that is, coreference is assigned whether they are of "organization," "person," or other types. We evaluate our approach on common data sets (namely, the MUC-6 and MUC-7 coreference corpora) and obtain encouraging results, in-dicating that on the general noun phrase coreference task, the learning approach holds promise and achieves accuracy comparable to that of nonlearning approaches. Our system is the first learning-based system that offers performance comparable to that of state-of-the-art nonlearning systems on these data sets.
Surface treatment of wire bonding metal pads
Authors: S. Alberici, D. Coulon, P. Joubin, Y. Mignot, L. Oggioni, P. Petruzza, D. Piumi, L. Zanotti
Venue: Microelectronic Engineering (2003)

The random formation of micrometric crystals on Al bonding pads can be an issue affecting wire bonding metal pad quality. The dry etch chemistry used to remove final passivation dielectric layers from the top of the bonding Al pad area is in fact based mainly on fluorine-containing gases (such as CF4, CHF3, etc.) which can leave fluorine as a residual on the metal pad surface as bonded or "free" AIF3, especially in the metal grain boundary zones. Fluorine contamination on the Al wire bonding pads, under particular temperature and humidity conditions, causes the formation of Al(OH)3 and Al/fluorine compound crystallites, not allowing, as a consequence, growth of the superficial and homogeneous natural Al2O3 layer. This paper concerns the analytical methods used to reveal the formation of such crystal defects and the operative solutions effective in preventing them, leaving the metal pad surface in the optimal condition for subsequent wire bonding operations.