ppxscal/embedding_network huggingface dataset:
Extended spatial keyframing for complex character animation
Authors: Byungkuk Choi Mi You Junyong Noh
Venue: Computer Animation and Virtual Worlds (2008)

As 3D computer animation becomes more accessible to novice users, it makes it possible for these users to create high-quality animations. This paper introduces a more powerful system to create highly articulated character animations with an intuitive setup then the previous research, Spatial Keyframing (SK). As the main purpose of SK was the rapid generation of primitive animation over quality animation, we propose Extended Spatial Keyframing (ESK) that exploits a global control structure coupled with multiple sets of spatial keyframes, and hierarchical relationship between controllers. The generated structure can be flexibly embedded into the given rigged character, and the system enables the given character to be animated delicately by user performance. During the performance, the movement of the highest ranking controllers across the control hierarchy is recorded in layered style to increase the level of detail for final motions. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Estimating Metabolic Pathways Parameters Using Distributed Monte Carlo Method
Authors: Paweł Lebioda, Piotr Bała
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Metabolic pathways can be represented as a huge set of differential equations with a large number of parameters. The solution of this system is not trivial because of the problem size and because of the limited information on model parameters. Most of the parameters cannot be calculated directly or obtained as direct experimental results. The only way is to estimate models parameters in such way that result of model approximate available experimental data. In this paper we present method of estimation of the parameters based on distributed computing using Monte Carlo method. This method has been applied to the tricarboxylic acid cycle [1] and compared with the existing model.
MARTE: a profile for RT/E systems modeling, analysis--and simulation?
Authors: Frédéric Mallet, Robert de Simone
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

As its name promises, the Unified Modeling Language (UML) provides a collection of diagrammatic modeling styles. To the early class/objects and use-case diagrams were almost immediately added state-, activity-, collaboration-, and component diagrams. All these modeling views, required for structural and behavioral representations of systems, were then progressed to further detailed expressivity. Provision for domain-specific specializations was made under the form of profiles. Somehow this goal of being rather universal and extendible discarded the possibility of UML to adopt too strict and precise a semantics; as users were generally to define and refine it in their stereotyped profiles anyway. As a result, even the little execution semantics there is in the standard is often not considered in such specializations. We tackled the general issue of defining a broadly expressive Time Model as a sub-profile of the upcoming OMG Profile for Modeling and Analysis of Real-Time Embedded systems (MARTE), currently undergoing finalization at OMG. The goal is to provide a generic timed interpretation, on which timed models of computation and timed simulation semantics could be built inside the UML definition scope, instead of as part of the many external proprietary profiles. The MARTE time library can be used as the basis for the definition of a UML real-time simulator.
Using Actor Portrayals to Systematically Study Multimodal Emotion Expression: The GEMEP Corpus
Authors: Tanja Bänziger, Klaus R. Scherer
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Emotion research is intrinsically confronted with a serious difficulty to access pertinent data. For both practical and ethical reasons, genuine and intense emotions are problematic to induce in the laboratory; and sampling sufficient data to capture an adequate variety of emotional episodes requires extensive resources. For researchers interested in emotional expressivity and nonverbal communication of emotion, this situation is further complicated by the pervasiveness of expressive regulations. Given that emotional expressions are likely to be regulated in most situations of our daily lives, spontaneous emotional expressions are especially difficult to access. We argue in this paper that, in view of the needs of current research programs in this field, well-designed corpora of acted emotion portrayals can play a useful role. We present some of the arguments motivating the creation of a multimodal corpus of emotion portrayals (Geneva Multimodal Emotion Portrayal, GEMEP) and discuss its overall benefits and limitations for emotion research.
A Global Approach for Automatic Fibroscopic Video Mosaicing in Minimally Invasive Diagnosis
Authors: Selen Atasoy, David P. Noonan, Selim Benhimane, Nassir Navab, Guang-Zhong Yang
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Recent developments in bio-photonics have called for the need of bringing cellular and molecular imaging modalities to an in vivo --- in situ setting to allow for real-time tissue characterization and functional assessment. Before such techniques can be used effectively in routine clinical environments, it is necessary to address the visualization requirement for linking point based optical biopsy to large area tissue visualization. This paper presents a novel approach for fibered endoscopic video mosaicing that permits wide region tissue visualization. A feature-based registration method is used to register the frames of the endoscopic video sequence by taking into account the characteristics of fibroscopic imaging such as non-linear lens distortion and high-frequency fiber optic facet pattern. The registration is combined with an efficient optimization scheme in order to align all input frames in a globally consistent way. An evaluation on phantom and ex vivo tissue images allowing free-hand camera motion is presented.
On the Construction of Sorted Reactive Systems
Authors: Lars Birkedal, Søren Debois, Thomas Hildebrandt
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We develop a theory of sorted bigraphical reactive systems.Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner's local bigraphs as a sorting on pure bigraphs.Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as a sorting.
A Composite Finite Element-Finite Difference Model Applied to Turbulence Modelling
Authors: Lale Balas, Asu İnan
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Turbulence has been modeled by a two equation k-¿ turbulence model to investigate the wind induced circulation patterns in coastal waters. Predictions of the model have been compared by the predictions of two equation k-¿ turbulence model. Kinetic energy of turbulence is k, dissipation rate of turbulence is ¿, and frequency of turbulence is ¿. In the three dimensional modeling of turbulence by k-¿ model and by k-¿ model, a composite finite element-finite difference method has been used. The governing equations are solved by the Galerkin Weighted Residual Method in the vertical plane and by finite difference approximations in the horizontal plane. The water depths in coastal waters are divided into the same number of layers following the bottom topography. Therefore, the vertical layer thickness is proportional to the local water depth. It has been seen that two equation k-¿ turbulence model leads to better predictions compared to k-¿ model in the prediction of wind induced circulation in coastal waters.
From Actions to Goals and Vice-Versa: Theoretical Analysis and Models of the Ideomotor Principle and TOTE
Authors: Giovanni Pezzulo, Gianluca Baldassarre, Martin V. Butz, Cristiano Castelfranchi, Joachim Hoffmann
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

How can goals be represented in natural and artificial systems? How can they be learned? How can they trigger actions? This paper describes, analyses and compares two of the most influential models of goal-oriented behavior: the ideomotor principle (IMP), which was introduced in the psychological literature, and the "test, operate, test, exit" model (TOTE), proposed in the field of cybernetics. This analysis indicates that the IMP and the TOTE highlight complementary aspects of goal-orientedness. In order to illustrate this point, the paper reviews three computational architectures that implement various aspects of the IMP and the TOTE, discusses their main peculiarities and limitations, and suggests how some of their features can be translated into specific mechanisms in order to implement them in artificial intelligent systems.
A Virtual Camera Team for Lecture Recording
Authors: Fleming Lampi, Stephan Kopf, Manuel Benz, Wolfgang Effelsberg
Venue: IEEE MultiMedia (2008)

We present the design and implementation of a virtual camera team for recording classroom lectures. Our approach makes these recordings more lively and interesting.
Learning Kernel Perceptrons on Noisy Data Using Random Projections
Authors: Guillaume Stempfel, Liva Ralaivola
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classification noise. Our proposed approach relies on the combination of the technique of random or deterministic projections with a classification noise tolerant perceptron learning algorithm that assumes distributions defined over finite-dimensional spaces. Provided a sufficient separation margin characterizes the problem, this strategy makes it possible to envision the learning from a noisy distribution in any separable Hilbert space, regardless of its dimension; learning with any appropriate Mercer kernel is therefore possible. We prove that the required sample complexity and running time of our algorithm is polynomial in the classical PAC learning parameters. Numerical simulations on toy datasets and on data from the UCI repository support the validity of our approach.
New Attacks on the Stream Cipher TPy6 and Design of New Ciphers the TPy6-A and the TPy6-B
Authors: Gautham Sekar, Souradyuti Paul, Bart Preneel
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

The stream ciphers Py, Pypy and Py6 were designed by Biham and Seberry for the ECRYPT-eSTREAM project in 2005. The ciphers were promoted to the `Focus' ciphers of the Phase II of the eSTREAM project. However, due to some cryptanalytic results, strengthened versions of the ciphers, namely, the TPy, the TPypy and the TPy6 were built. In this paper, we find hitherto unknown weaknesses in the keystream generation algorithms of the Py6 and its stronger variant the TPy6. Exploiting these weaknesses, a large number of distinguishing attacks are mounted on the ciphers, the best of which works with 2224.6 data and comparable time. In the second part, we present two new ciphers derived from the TPy6, namely, the TPy6-A and the TPy6-B, whose performances are 2.65 cycles/byte and 4.4 cycles/byte on Pentium III. As a result, to the best of our knowledge, on Pentium platforms the TPy6-A becomes the fastest stream cipher in the literature. Based on our security analysis, we conjecture that no attacks lower than the brute force are possible on the ciphers TPy6-A and TPy6-B.
Employers' perspectives on it learning outcomes
Authors: Craig S. Miller, Lucia Dettori
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

As part of the assessment process of our BS in Information Technology (IT), we sought the perspective of IT employers on needed skills and knowledge for a career in IT. To this end, we conducted structured interviews with 10 IT employers in the Chicago area. Starting with an open-ended query, we asked for knowledge, skills or competencies that they particularly value when hiring IT graduates. We then asked for feedback on four preselected competencies. All four competencies were framed in technology-independent terms and are consistent with the ACM 2005 IT curricula guidelines. Two of the competencies addressed abstraction and modeling, which directly correspond to learning outcomes in the core IT Fundamentals in the ACM guidelines. A third competency addressed object-based user interface development. A final competency focused on the distinction between interface and implementation. For each competency, we asked about their value with respect to their IT positions and how they assess the competency in a job candidate. One major finding from the interviews is that knowledge specific to a particular language or platform was rarely cited as relevant and often explicitly noted as irrelevant. The competency on abstraction was uniformly rated as needed, often receiving critical ratings. Modeling and ability to distinguish between interface and implementation were also indicated as needed by nearly every interviewee. Object-based user interface development was considered useful knowledge but only needed for specific types of positions. For assessing competencies, a common approach involved asking prospective recruits to present an experience where they applied principles associated with a particular competency. Several interviewees also assess level of understanding by presenting candidates with hypothetical scenarios and observing their problem-solving process. To complement the detailed commentary provided by our interviews, we plan a survey with a large number of respondents for more reliable estimates of how employers value and assess IT competencies.
A Fuzzy Thresholding Circuit for Image Segmentation
Authors: Angel Barriga, Nashaat M. Hussein
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

The paper describes a technique for image segmentation based on binary thresholding and the hardware implementation of the segmentation circuit. The technique applies a fuzzy logic strategy to calculate the threshold. The hardware design methodology is based on a high level behavioral description of the fuzzy system. The knowledge base is described using the standard hardware description language VHDL. The hardware design criterion is the low cost and, in special way, a high processing speed.
Attributed Graph Constraints
Authors: Fernando Orejas
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, in a previous paper, we showed that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In that paper we present a sound and complete proof system for reasoning with this kind of constraints. Those results apply, in principle, to any category satisfying some given properties, but the category of (typed) attributed graphs does not satisfy these properties. In particular, the proof rules introduced for reasoning with standard graph constraints allow us to infer infinitary formulas, making the logic incomplete. In addition, using the straightforward generalization of standard graph constraints, there is no obvious way of stating properties about the attributes of the given graphs.In this paper we introduce a new formulation for attributed graph constraints. More precisely, the idea is to see these constraints as standard graph constraints whose attributes are just variables, together with a logic formula that expresses properties that must be satisfied by these attributes. Then a proof system, which extends the one introduced in the previous paper, is presented and it is shown to be sound and complete.
Pose Robust Face Tracking by Combining Active Appearance Models and Cylinder Head Models
Authors: Jaewon Sung, Takeo Kanade, Daijin Kim
Venue: International Journal of Computer Vision (2008)

The active appearance models (AAMs) provide the detailed descriptive parameters that are useful for various autonomous face analysis problems. However, they are not suitable for robust face tracking across large pose variation for the following reasons. First, they are suitable for tracking the local movements of facial features within a limited pose variation. Second, they use gradient-based optimization techniques for model fitting and the fitting performance is thus very sensitive to initial model parameters. Third, when their fitting is failed, it is difficult to obtain appropriate model parameters to re-initialize them. To alleviate these problems, we propose to combine the active appearance models and the cylinder head models (CHMs), where the global head motion parameters obtained from the CHMs are used as the cues of the AAM parameters for a good fitting or re-initialization. The good AAM parameters for robust face tracking are computed in the following manner. First, we estimate the global motion parameters by the CHM fitting algorithm. Second, we project the previously fitted 2D shape points onto the 3D cylinder surface inversely. Third, we transform the inversely projected shape points by the estimated global motion parameters. Fourth, we project the transformed 3D points onto the input image and computed the AAM parameters from them. Finally, we treat the computed AAM parameters as the initial parameters for the fitting. Experimental results showed that face tracking combining AAMs and CHMs is more pose robust than that of AAMs in terms of 170% higher tracking rate and the 115% wider pose coverage.
Collisions for RC4-Hash
Authors: Sebastiaan Indesteege, Bart Preneel
Venue: Proceedings of the 11th international conference on Information Security (2008)

RC4-Hash is a variable digest length cryptographic hash function based on the design of the RC4 stream cipher. In this paper, we show that RC4-Hash is not collision resistant. Collisions for any digest length can be found with an expected effort of less than 29 compression function evaluations. This is extended to multicollisions for RC4-Hash. Finding a set of 2 k colliding messages has an expected cost of 27 + k·28 compression function evaluations.
The Study on a New Immune Optimization Routing Model
Authors: Jun Qin, Jiang-Qing Wang, Zi-Mao Li
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The integrated network (mixed with fixed network, cellular wireless network and ad hoc network etc.) would have different dynamic properties to the single-technique-based network, such as the movement of nodes and the change of delay of links. In this paper, we propose a new dynamic multicast routing model with a mechanism called local rearrangement to handle the changes in integrated network. Furthermore, D-IOA, an immune algorithm based on clone process, which employs gene library to improve the effectiveness of D-IOA to meet the real-time requirement in online multicast routing fields, is given to optimize the multicast sub-tree within the range of local rearrangement. The simulation results indicate that our algorithm balances three metrics better compared with other two famous dynamic multicast routing algorithms.
Case-Based Planning and Execution for Real-Time Strategy Games
Authors: Santiago Ontañón, Kinshuk Mishra, Neha Sugandh, Ashwin Ram
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Artificial Intelligence techniques have been successfully applied to several computer games. However in some kinds of computer games, like real-time strategy (RTS) games, traditional artificial intelligence techniques fail to play at a human level because of the vast search spaces that they entail. In this paper we present a real-time case based planning and execution approach designed to deal with RTS games. We propose to extract behavioral knowledge from expert demonstrations in form of individual cases. This knowledge can be reused via a case based behavior generator that proposes behaviors to achieve the specific open goals in the current plan. Specifically, we applied our technique to the WARGUS domain with promising results.
PAPEL: A Dictionary-Based Lexical Ontology for Portuguese
Authors: Hugo Gonçalo Oliveira, Diana Santos, Paulo Gomes, Nuno Seco
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

This paper describes a project aimed at creating a lexical ontology extracted (semi) automatically from a large Portuguese general dictionary. Although using machine readable dictionaries to extract semantic information is not new, we believe this is the first attempt for the Portuguese language. The paper describes a (to be) freely available resource, dubbed PAPEL, explaining the process used and the tools developed, and illustrating it with one specific relation: Causation.
Preimages for Reduced SHA-0 and SHA-1
Authors: Christophe Cannière, Christian Rechberger
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of these hash functions against these attacks, two new cryptanalytic techniques are developed: Reversing the inversion problem: the idea is to start with an impossible expanded message that would lead to the required digest, and then to correct this message until it becomes valid without destroying the preimage property. P 3 graphs : an algorithm based on the theory of random graphs that allows the conversion of preimage attacks on the compression function to attacks on the hash function with less effort than traditional meet-in-the-middle approaches. Combining these techniques, we obtain preimage-style shortcuts attacks for up to 45 steps of SHA-1, and up to 50 steps of SHA-0 (out of 80).