ppxscal/embedding_network huggingface dataset:
An art-directed wrinkle system for CG character clothing and skin
Authors: Lawrence D. Cutler, Reid Gershbein, Xiaohuan Corina Wang, Cassidy Curtis, Erwan Maigret, Luca Prasso, Peter Farson
Venue: Graphical Models (2007)

We present a kinematic system for creating art-directed clothing and skin wrinkles on CG characters used in the production of computer-animated feature films. This system employs a curve-based method for generating wrinkles on reference poses, which are incorporated into a weighted matching algorithm that generates wrinkle deformations on an animated character. An artist creates wrinkle patterns in an interactive application that is intuitive to use and accommodates iterative art direction. The algorithm for evaluating wrinkles measures the local stress of a surface and creates weights that are used to interpolate between the reference wrinkle patterns during movement. We discuss various production pipeline issues, such as retargeting wrinkle patterns between different costumes and characters. We extend the approach to achieve believable age wrinkles for character skin. Our system has been used successfully in the production of feature-length animated films.
Effective memory protection using dynamic tainting
Authors: James Clause, Ioannis Doudalis, Alessandro Orso, Milos Prvulovic
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Programs written in languages that provide direct access tomemory through pointers often contain memory-related faults, which may cause non-deterministic failures and even security vulnerabilities. In this paper, we present a new technique based on dynamic tainting for protecting programs from illegal memory accesses. When memory is allocated, at runtime, our technique taints both the memory and the corresponding pointer using the same taint mark. Taint marks are then suitably propagated while the program executes and are checked every time a memory address m is accessed through a pointer p; if the taint marks associated with mand p differ, the execution is stopped and the illegalaccess is reported. To allow for a low-overhead, hardware-assisted implementation of the approach, we make several key technical and engineering decisions in the definition of our technique. In particular, we use a configurable, low number of reusable taint marks instead of a unique mark for each area of memory allocated, which reduces the overhead of the approach without limiting its flexibility and ability to target most memory-related faults and attacks known to date. We also define the technique at the binary level, which lets us handle the (very) common case of applications that use third-party libraries whose source code is unavailable. To investigate the effectiveness and practicality of our approach, we implemented it for heap-allocated memory and performed a preliminary empirical study on a set of programs. Our results show that (1) our technique can identify a large class of memory-related faults, even when using only two unique taint marks, and (2)a hardware-assisted implementation of the technique could achieve overhead in the single digits
Towards Location-aware Topology in both Unstructured and Structured P2P Systems
Authors: Tongqing Qiu, Guihai Chen, Mao Ye, Edward Chan, Ben Y. Zhao
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROPG for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROPO, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities.
Automatic expert identification using a text categorization technique in knowledge management systems
Authors: Kun-Woo Yang, Soon-Young Huh
Venue: Expert Systems with Applications: An International Journal (2008)

Since tacit knowledge such as know-how and experiences is hard to be managed effectively using information technology, it is recently proposed that providing an appropriate expert identification mechanism in KMS to pinpoint experts in the organizations with searched expertise is more effective and efficient to utilize this type of knowledge. In this paper, we propose a framework to automate expert identification using a text categorization technique called Vector Space Model to minimize maintenance cost of expert profiles as well as problems related to incorrectness and obsolescence resulted from subjective manual profile processing. Also, we define the structure of expertise consisting of activeness, relevance, and usefulness factors to enable deriving the overall expertise level of experts by analyzing knowledge artifacts registered to the knowledge base. The developed prototype system, ''Knowledge Portal for Researchers in Science and Technology'', is introduced to show the applicability of the proposed framework.
Magnetic field distribution and signal decay in functional MRI in very high fields (up to 9.4 T) using Monte Carlo diffusion modeling
Authors: Bernd Michael Mueller-Bierl, Kamil Uludag, Philippe L. Pereira, Fritz Schick
Venue: Journal of Biomedical Imaging (2007)

Extravascular signal decay rate R2 or R2* as a function of blood oxygenation, geometry, and field strength was calculated using a Monte Carlo (MC) algorithm for a wider parameter range than hitherto by others. The relaxation rates of gradient-recalled-echo (GRE) and Hahn-spin-echo (HSE) imaging in the presence of blood vessels (ranging from capillaries to veins) have been computed for a wide range of field strengths up to 9.4 T and 50% blood deoxygenation. The maximum HSE decay was found to be shifted to lower radii in higher compared to lower field strengths. For GRE, however, the relaxation rate was greatest for large vessels at any field strength. In addition, assessments of computational reliability have been carried out by investigating the influence of the time step, the Monte Carlo step procedure, boundary conditions, the number of angles between the vessel and the exterior field B0, the influence of neighboring vessels having the same orientation as the central vessel, and the number of proton spins. The results were compared with those obtained from a field distribution of the vessel computed by an analytic formula describing the field distribution of an ideal object (an infinitely long cylinder). It was found that the time step is not critical for values equal to or lower than 200 microseconds. The choice of the MC step procedure (three-dimensional Gaussian diffusion, constant one-or three-dimensional diffusion step) also failed to influence the results significantly; in contrast, the free boundary conditions, as well as taking too few angles into account, did introduce errors. Next neighbor vessels with the same orientation as the main vessel did not contribute significantly to signal decay. The total number of particles simulated was also found to play a minor role in computing R2/ R2*.
The Development of Intelligent Learning Objects with an Ontology based on SCORM Standard
Authors: Ricardo Azambuja Silveira
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Some research points that learning systems based on Multi-Agent architectures support the development of more interactive and adaptable systems and the Learning Objects approach gives reusability. In this paper, we proposed an approach where learning objects are built based on agent architectures. This paper presents how this multi-agent system was modeling, moreover, it is applied ontology based on SCORM standard to lead with learning objects.
Continuous K-nearest neighbor queries for continuously moving points with updates
Authors: Glenn S. Iwerks, Hanan Samet, Ken Smith
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

In recent years there has been an increasing interest in databases of moving objects where the motion and extent of objects are represented as a function of time. The focus of this paper is on the maintenance of continuous K- nearest neighbor (k-NN) queries on moving points when updates are allowed. Updates change the functions describing the motion of the points, causing pending events to change. Events are processed to keep the query result consistent as points move. It is shown that the cost of maintaining a continuous k-NN query result for moving points represented in this way can be significantly reduced with a modest increase in the number of events processed in the presence of updates. This is achieved by introducing a continuous within query to filter the number of objects that must be taken into account when maintaining a continuous k-NN query. This new approach is presented and compared with other recent work. Experimental results are presented showing the utility of this approach.
Computerized Blood Gas Interpretation and Reporting System
Authors: R. M. Gardner
Venue: Computer (1975)

With the increased sophistication of laboratory instrumentation, physician and nursing staffs are being presented with large amounts of clinical data which they are expected to interpret in order to formulate proper therapy for their patients. One of the recent advances has been the development of arterial blood gas analysis. This test now provides reliable, accurate data on the blood gas status of patients, thereby presenting information to clinical staffs which was not available before. Accompanying these improvements in technique has been a steady increase in knowledge and studies performed on various blood gas disorders.1-8
A model-based routing protocol for a mobile, delay tolerant network
Authors: Tim Wark, Wen Hu, Pavan Sikka, Lasse Klingbeil, Peter Corke, Chris Crossman, Greg Bishop-Hurley
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

This short-paper presents the design and experimental validation of model-based, mobile routing protocol for a delay tolerant network (DTN), where herds of animals are utilised as message ferries. We develop a novel routing protocol that utilises knowledge of the predicted behaviour of each ferry in order to choose optimal ferries for carrying messages from source to sink nodes, as well as minimise routing overhead of the network via adaptive beaconing based on current behaviour.
Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem
Authors: Lalinka de C.T. Gomes, Fernando J. Von Zuben
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

This paper presents a neuro-fuzzy system based on competitive learning to solve multiple criteria optimization problems. The proposed method promotes the simultaneous self-organization of several networks, employing unsupervised learning guided by a fuzzy rule base. The algorithm implements a policy of penalties and rewards, a strategy of neuron inhibition, insertion and pruning, and also takes into account certain statistical characteristics of the input space. A fuzzy inference system is designed to implement the decision making process under a multiobjective scenario, leading to an adaptive process of constraint relaxation. The effectiveness of the proposed method is attested by means of a series of computational simulations performed on standard data. In our simulations, we address two variants of the vehicle routing problem: the capacitated vehicle routing problem (CVRP) and the multiple traveling salesman problem (MTSP). There are a few works treating the vehicle routing problem by means of competitive learning. These approaches are briefly reviewed in this paper. We also present some improvements in the results of an implementation of tabu search by providing the solutions obtained by the neuro-fuzzy system as initial condition, showing that the proposed method can effectively produce satisfactory results when used in association with more dedicated approaches.
Achieving Accurate Timing Measurements on TTL/CMOS Devices
Authors: Dennis Petrich
Venue: IEEE Design Test (1986)

Production TTL and CMOS timing measurements obtained between different test systems and between test systems and the benchsetup often do not correlate or do not appear to be accurate even though the automatic test equipment system has subnanosecondaccuracy. Errors of as much as 2 ns can occur with small-, medium-, and large-scale integration and with gate arrays usingthe new TTL and CMOS technologies. This represents a 100- percent error factor for these emerging products.
Fast Iterative Division of p-adic Numbers
Authors: E. V. Krishnamurthy
Venue: IEEE Transactions on Computers (1983)

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.
Scheduling strategies for mapping application workflows onto the grid
Authors: Anirban Mandal, K. Kennedy, C. Koelbel, G. Marin, J. Mellor-Crummey
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

In this work, we describe new strategies for scheduling and executing workflow applications on grid resources using the GrADS [Ken Kennedy et al., 2002] infrastructure. Workflow scheduling is based on heuristic scheduling strategies that use application component performance models. The workflow is executed using a novel strategy to bind and launch the application onto heterogeneous resources. We apply these strategies in the context of executing EMAN, a bio-imaging workflow application, on the grid. The results of our experiments show that our strategy of performance model based, in-advance heuristic workflow scheduling results in 1.5 to 2.2 times better makespan than other existing scheduling strategies. This strategy also achieves optimal load balance across the different grid sites for this application.
Computer Graphics and Man-Machine Interactions
Authors: U. W. Pooch
Venue: Computer (1976)

During the past 10 years, there has been a considerable growth of interest in the problems of applying computer graphics techniques to practical use. This interest has created an increasing need for the applications of theoretical computer graphics methods to software and hardware systems that are cost-effective as well as user-oriented. A number of books have been published on the subject of computer graphics, and some rather cost-effective graphics devices have been designed and built for practical use. The latter has mainly been the result of microminiaturization technology of the last five years. Microprocessors, microcomputers, and microprogrammability have helped considerably in making cost-effective display devices a reality, the intelligence of such devices being limited only by the capability of the microprocessors. Applications of computer graphics have steadily increased in such areas as engineering, design, education, medicine/biomedicine, chemistry, business, analysis, computer-aided design, management, structural design, simulation, and communication. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Assessment of self-organizing map variants for clustering with application to redistribution of emotional speech patterns
Authors: Vassiliki Moschou, Dimitrios Ververidis, Constantine Kotropoulos
Venue: Neurocomputing (2007)

Two well-known variants of the self-organizing map (SOM) that are based on multivariate order statistics are the marginal median SOM and the vector median SOM. In the past, their efficiency was demonstrated for color image quantization. We employ the well-known IRIS and VOWEL data sets and we assess the SOM variants' performance with respect to the accuracy, the average over all neurons mean squared error between the patterns that were assigned to a neuron and the neuron's weight vector, the Rand index, the @C statistic, and the overall entropy. All figures of merit favor the marginal median SOM and the vector median SOM against the standard SOM. Based on the aforementioned findings, the marginal median SOM and the vector median SOM are used to redistribute emotional speech patterns from the Danish Emotional Speech database, which were originally classified as being neutral, to the emotional states of hot anger, happiness, sadness, and surprise.
Beyond Theory: Development of a Real World Localization Application as Low Power WSN
Authors: Marcel Baunach, Reiner Kolla, Clemens Muhlberger
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The real-world implementation of a just theoretically elaborated idea is sometimes cumbersome, often a couple of obstacles have to be overcome. That's likewise in the area of Wireless Sensor Networks (WSN), but complicated by some further restrictions, e.g. little memory or low power consumption. One well-known and often required application within WSN is the geographical localization of several sensor nodes. That's why this paper deals with some problems arising during the development of a WSN using the time difference of arrival (TDoA) of ultrasound and radio signals for positioning. Its focus is on handling of microcontroller difficulties like little memory, low computational power or low energy consumption as well as hardware driven failures like inaccurate measurements or node failures.
Fuzzy logic path planning for the robotic placement of fabrics on a work table
Authors: G. T. Zoumponos, N. A. Aspragathos
Venue: Robotics and Computer-Integrated Manufacturing (2008)

In this paper, an innovative fuzzy logic approach for the robotic laying of fabrics on a work table and based on fuzzy sets is presented. Through handling experiments the solution domain for the path of the robotic gripper is determined, the handling parameters are identified and implicit knowledge is accumulated. Then a proper scheme for the data acquisition is formed and a path-planning algorithm based on fuzzy logic is developed. Due to conflicts and inaccuracies of the acquired data, a subtractive clustering algorithm is used, to identify the proper clusters for the two developed fuzzy systems, with the first employing the clusters as rules and the second a neuro-fuzzy system initialised by the implicit knowledge and trained via back-propagation. Finally, the effectiveness of the two path-planning systems is investigated in an experimental stage where the robot successfully places on a table fabrics of a variety of materials and sizes.
Collaborative framework for supporting indigenous knowledge management
Authors: Theodora Mondo T. Mwebesa, Venansius Baryamureeba, Ddembe Williams
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Indigenous knowledge (IK) is an integral part of the culture and history of local communities. We need to learn from local communities to enrich the development process. IK systems are also dynamic; new knowledge is continuously added. IK is stored in people's memories, activities and is expressed and communicated orally and this posses a serious threat to its preservation and development. However this depicts Indigenous knowledge Management (IKM) as a complex, global and dynamic issue and hence a need for a collaborative framework that will enhance information exchange. Utilization of collaborative frameworks, are increasingly being used in solving problems whose efficiency depends on an interactive nature. Networking or collaboration allows for a more effective pooling of resources and sharing of experiences and information on indigenous knowledge, both among various individuals and organizations.
Research on Rule Hiding Algorithm of Transaction Adding and Removing
Authors: Xiaoming Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new approach by transaction adding and removing (TAR) is presented for association rule hiding. Only a few transactions need updating to the mined dataset. Firstly, two definitions of weak associated transaction (WAT) and strong associated transaction (SAT) are defined. Then, the TAR approach and algorithm are stated in detail with two main processes of WAT adding and SAT removing. Two selections of modifying item are studied for single rule and multiple rules hiding. And two kinds of WAT modifying approaches are described and compared to avoid the transaction duplication in the database. Based on the detail experimental results, the data type modifying approach can be always better than the Unknown approach. The side effects of the TAR algorithm are usually lower than 15% when the hiding rate reaches to 100%. The algorithm can be suitable for single rule and multiple rules hiding.
Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
Authors: Oscar P. Bruno, Youngae Han, Matthew M. Pohlman
Venue: Journal of Computational Physics (2007)

We present a new method for construction of high-order parametrizations of surfaces: starting from point clouds, the method we propose can be used to produce full surface parametrizations (by sets of local charts, each one representing a large surface patch - which, typically, contains thousands of the points in the original point-cloud) for complex surfaces of scientific and engineering relevance. The proposed approach accurately renders both smooth and non-smooth portions of a surface: it yields super-algebraically convergent Fourier series approximations to a given surface up to and including all points of geometric singularity, such as corners, edges, conical points, etc. In view of their C^~ smoothness (except at true geometric singularities) and their properties of high-order approximation, the surfaces produced by this method are suitable for use in conjunction with high-order numerical methods for boundary value problems in domains with complex boundaries, including PDE solvers, integral equation solvers, etc. Our approach is based on a very simple concept: use of Fourier analysis to continue smooth portions of a piecewise smooth function into new functions which, defined on larger domains, are both smooth and periodic. The ''continuation functions'' arising from a function f converge super-algebraically to f in its domain of definition as discretizations are refined. We demonstrate the capabilities of the proposed approach for a number of surfaces of engineering relevance.