ppxscal/embedding_network huggingface dataset:
The painful face: pain expression recognition using active appearance models
Authors: Ahmed Bilal Ashraf, Simon Lucey, Jeffrey F. Cohn, Tsuhan Chen, Zara Ambadar, Ken Prkachin, Patty Solomon, Barry J. Theobald
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Pain is typically assessed by patient self-report. Self-reported pain, however, is difficult to interpret and may be impaired or not even possible, as in young children or the severely ill. Behavioral scientists have identified reliable and valid facial indicators of pain. Until now they required manual measurement by highly skilled observers. We developed an approach that automatically recognizes acute pain. Adult patients with rotator cuff injury were video-recorded while a physiotherapist manipulated their affected and unaffected shoulder. Skilled observers rated pain expression from the video on a 5-point Likert-type scale. From these ratings, sequences were categorized as no-pain (rating of 0), pain (rating of 3, 4, or 5), and indeterminate (rating of 1 or 2). We explored machine learning approaches for pain-no pain classification. Active Appearance Models (AAM) were used to decouple shape and appearance parameters from the digitized face images. Support vector machines (SVM) were used with several representations from the AAM. Using a leave-one-out procedure, we achieved an equal error rate of 19% (hit rate = 81%) using canonical appearance and shape features. These findings suggest the feasibility of automatic pain detection from video.
Guest Editors' Introduction: Real-Time Interaction with Complex Models
Authors: David J. Kasik, Dinesh Manocha, Philipp Slusallek
Venue: IEEE Computer Graphics and Applications (2007)

Over the past few decades, advances in acquisition, modeling, and simulation technologies have resulted in databases of 3D models that seem to be unlimited in size and complexity. Highly detailed models are increasingly produced in areas such as industrial CAD for airplanes, ships, production plants, and buildings; geographic information systems; oil and gas exploration; medical imaging; scanned 3D models; unorganized information spaces; and high-end scientific simulations. Such models might contain millions or even billions of 3D primitives, such as triangles, point sets, surfaces, and voxels. The models often have additional, higher-dimensional attributes associated with the primitives. The Guest Editors of this Special Issue of IEEE Computer Graphics and Applications discuss the challenges that complex models present and how those articles represent and address some of those challenges.
Query translation based on equivalence classes for heterogeneous multimedia repositories using XML and semantic annotation
Authors: M. Aguzzi, M. G. Albanesi, M. Ferretti, M. Garlaschelli
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper we present a novel infrastructure for querying heterogeneous databases composed of semantically annotated documents, using XML technology. We have developed a query generalization system in order to make the use of different XML schemas transparent. It uses a preliminary specification of elements considered equivalent in the various schemas. By defining different levels of equivalence, the system is able to translate queries between different annotated XML schemas. We have tested the system on the particular case of image database, more precisely, we consider different tagged image formats. We obtain query translation that preserves the semantics and offers a good match.
Multiple Entry Indexing and Double Indexing
Authors: Victor Teixeira de Almeida, Ralf Hartmut Guting, Christian Duntgen
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Traditional indexing techniques are not well suited for complex data types such as spatial, spatio-temporal, and multimedia data types, where an instance is a composite of multiple components. In this paper we propose two indexing techniques that allow the parts of a composite object to be indexed separately, called multiple entry indexing and double indexing. We present the implementation of these approaches in the SECONDO extensible database system. The improvements in terms of performance of both approaches presented in this paper are shown in an experimental evaluation.
One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements
Authors: Iliano Cervesato, Catherine Meadows
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

In this paper we show how we can increase the ease of reading and writing security requirements for cryptographic protocols at the Dolev-Yao level of abstraction by developing a visual language based on fault trees. We develop such a semantics for a subset of NPATRL, a temporal language used for expressing safety requirements for cryptographic protocols, and show that the subset is sound and complete with respect to the semantics. We also show how the fault trees can be used to improve the presentation of some specifications that we developed in our analysis of the Group Domain of Interpretation (GDOI) protocol. Other examples involve a property of Kerberos 5, and a visual account of the requirements in Lowe's authentication hierarchy.
Thermal error modeling of a machine tool using data mining scheme
Authors: Kun-Chieh Wang, Tzuoo-Lii Yei, Ting-Cheng Chang, Kun-Li Wen
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Thermal effect on machine tools is a well-recognized problem in an environment of increasing demand for product quality. The performance of a thermal error compensation system significantly depends on the thermal error model used. How to efficiently, quickly and accurately build a thermal error model is always drawing much attention in regard of engineering application. This paper presents an integrated scheme which includes k-means (KM) theory, rough set (RS) theory and linear regression (LR) method that seek to address this issue. The experimental data is first classified by the KM method and then the RS scheme is used to select crucial factors combination that contributes to the thermal error linearly. Eventually a LR thermal error model is established via these processed data. To evaluate the performance of this integrated model, an adaptive network fuzzy inference system (ANFIS) model was included. The proposed integrated thermal error modeling scheme can be built quickly and applied accurately. Besides, the established simple linear regression relationship can be easily installed into a CNC controller.
Searching for experts in the enterprise: combining text and social network analysis
Authors: Kate Ehrlich, Ching-Yung Lin, Vicky Griffiths-Fisher
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Employees depend on other people in the enterprise for rapid access to important information. But current systems for finding experts do not adequately address the social implications of finding and engaging strangers in conversation. This paper provides a user study of SmallBlue, a social-context-aware expertise search system that can be used to identify experts, see dynamic profile information and get information about the social distance to the expert, before deciding whether and how to initiate contact. The system uses an innovative approach to privacy to infer content and dynamic social networks from email and chat logs. We describe usage of SmallBlue and discuss implications for the next generation of enterprise-wide systems for finding people.
Approximate Structural Matching over Ordered XML Documents
Authors: Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

There is an increasing need for an XML query en- gine that not only searches for exact matches to a query but also returns \query-like" structures. We have designed and developed XFinder, an efficient top K tree pattern query evaluation system, which reduces the problem of approximate tree structural matching to a simpler problem of subsequence matching. How- ever, since not all subsequences correspond to valid tree structures, it is expensive to enumerate common sub- sequences between XML data and query and then fil- ter the invalid ones. XFinder addresses this challenge by detecting and pruning structurally irrelevant subse- quence matches as early as possible. Experiments show the efficiency of XFinder on various data and query sets.
Smart Phones to the Rescue: The Virtual Blood Bank Project
Authors: Ramesh Singh, Preeti Bhargava, Samta Kain
Venue: IEEE Pervasive Computing (2007)

The Virtual Blood Bank Project is a pervasive computing application that aims to supply people information about potential donors and blood banks through their cell phones.
Cognitive States Detection in fMRI using incremental P
Authors: Minh-Tuan T.Hoang, Yonggwan Won, Hyung-Jeong Yang
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The functional Magnetic Resonance Imaging (fMRI) has emerged as a powerful noninvasive method for collecting large amount of data about activities in human brain. Analysis for fMRI is essential to the success in detecting cognitive states. Due to very high dimensionality of feature vectors, feature extraction should be considered as a critical step to preprocess fMRI data before the stage of cognitive state detection. Up to now, different feature extraction methods have been applied to this type of data and they require domain experts to specify the Regions of Interests (RoI). However, none of them can give a dominant approach for precisely detecting cognitive states. In this paper, incremental principal component analysis (iPCA) proves to be an efficient method of feature extraction for fMRI data without using domain experts. Our experimental results show that this approach gives a higher performance compared to other feature extraction methods which require domain experts to select Regions of Interests.
Magic's Circuit Extractor
Authors: Walter Scott, John Ousterhout
Venue: IEEE Design Test (1986)

This fast hierarchical circuit extractor for the Magic VLSI layout system derives its speed from its ability to handle hiearchicalarrays, and from a new algorithm based on corner-stitching, a geometrical data structure for representing Manhattan shapes.Corner-stitching's ability to find adjacent mask information is critical to the basic extractor speed, and its ability tosearch areas makes the hiearchical extraction algorithm practical. The extractor is incremental, necessitating re-extractionof only a few cells after a layout is modified. It accepts a hierarchical layout that may contain nearly arbitrary overlapsbetween cells, and produces a circuit description with the same hierarchical structure as the layout. The extractor can completelyextract a 37,000-transistor chip in 20 minutes of VAX CPU time, or incremetally in an average of 8 minutes. The extractorprocesses 50-65 FETS per second on a VAX-11/780 running Unix. if only substrate capacitance is being extracted. If couplingcapacitance is also extracted, the basic extractor processes 25-35 transistors per second.
Single machine group scheduling under decreasing linear deterioration
Authors: Ji-Bo Wang, Ai-Xia Guo, Feng Shan, Bo Jiang, Li-Yan Wang
Venue: Journal of Applied Mathematics and Computing (2007)

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.
Construction and Analysis of Evolving Data Summaries: An Application on Web Usage Data
Authors: Alzennyr da Silva, Yves Lechevallier, Fabrice Rossi, Francisco de Carvalho
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Taking the temporal dimension into account during the analysis of Web usage data has become a necessity since the way a site is visited may well evolve due to modifica- tions in the structure and content of the site, or even due to changes in the behavior of certain user groups. Conse- quently, the models associated with these behaviors must be continuously updated. One solution to this problem is to up- date these models using summaries obtained by means of an evolutionary approach based on clustering methods. To do this, we carry out various clustering strategies that are ap- plied on time sub-periods. We compare the results obtained using this method with those reached by traditional global analysis.
Refined assured forwarding framework for differentiated services architecture
Authors: Mostafa H. Dahshan, Pramode K. Verma
Venue: Computer Communications (2007)

This paper presents a new refined assured forwarding (RAF) framework for improving the performance of DiffServ architecture where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to existing DiffServ routers by adding a second layer of classification of flows based on their average packet sizes and using Weighted Fair Queueing for flow scheduling. The efficiency of the new architecture in enhancing the performance of DiffServ is demonstrated by simulation results for delay, packet delivery, throughput, and packet loss, under different traffic scenarios.
Scheduling of embedded time-triggered systems
Authors: András Balogh, András Pataricza, Judit Rácz
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

Distributed system composition is the main trend in creating safety-critical (SC) real-time systems like automotive, aerospace, and industrial control systems. Their growing complexity (e.g. tens of control units in a modern car) led to an integrated architecture concept [7]. It supports the sharing of hardware resources between different sub-applications for the sake of cost reduction, but still keeps the overall system safety by properly isolating jobs from each other. Validation and certification of SC sytems are a key problem. They are especially hard, if not impossible at all, if the behavior of the system is non-deterministic. The time triggered (TT) paradigm (such as TTP/C [14] and FlexRay [4]) uses a strictly deterministic, static, design time generated schedule for both the computation jobs in the processing nodes and the internode communication tasks. Current tools create the intranode job and interjob communication allocation and scheduling in two distinct steps in order to reduce the total computational complexity to a feasible level. However, this separation of the two design steps despite their strong mutual influence may result in sub-optimal resource utilization, thus additional costs. The rapid growth in the computational power commonly available to the designer justifies re-visiting the potential of single phased global optimization. The recent paper introduces a novel approach calculating resource allocation and task schedules in a single step by using a standard mixed integer linear programming (MILP) solver covering extra-functional requirements as well. At first, optimization is used to explore the boundaries of the design space from the points of view of cost, throughput, robustness and extensibility. Subsequently, the designer can formulate his priorities between these, frequently contradicting goals by creating a weighted objective funtion. Optimization is accelerated by heuristic lower and upper estimates.
Handling Multiple Credentials in a Heterogeneous SOA Environment
Authors: Fred Dushin, Eric Newcomer
Venue: IEEE Security and Privacy (2007)

The problem of juggling several credentials at once frequently arises in the applications to which service-oriented architecture (SOA) technologies are applied. This article examines this predicament and discusses the particular challenges that such SOA environments introduce.
Interactive rendering of optical effects in wet hair
Authors: Rajeev Gupta, Nadia Magnenat-Thalmann
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Visually, wet hair is easily distinguishable from dry hair because of the increased highlights and intense darkening displayed by them. It is therefore essential for realism to capture these characteristics under certain real world conditions. In this regard we propose a model for rendering wet hair at interactive rates. We start by analyzing the physical aspect behind this special effect in hair and then present a model for incorporating the variations in visual appearance of the hair due to presence of water. For simulating the increased specularity because of the water layer on hair, we present a parameter controlled Gaussian-based model. To simulate darkening in hair, for outer hair we consider total internal reflection at water-hair interface as dominant and propose a probabilistic approach to determine the amount of light absorbed. For inner hair, we consider that increase in opacity due to water results in stronger self-shadow and propose a model that updates the opacities based on water content and accumulates them to calculate the self-shadow term. By preprocessing and optimising our algorithm both for the self-shadow in dry hair and the special effects due to water presence, we can get visually pleasing results at interactive rates. Furthermore, the model is highly versatile and can easily be adaptable to other liquids and hair styling products.
Unitary Shift-Register Realizations of Sequential Machines
Authors: C. C. Su, S. S. Yau
Venue: IEEE Transactions on Computers (1968)

Abstract The problem of determining secondary state assignments for sequential machines such that the binary memory elements are connected in the form of shift registers is studied. An algorithm for finding such state assignments is developed. One or more code words may be assigned to a state of the sequential machine. The only restriction is that the realizations be unitary. A single shift-register realization of a sequential machine is unitary if and only if all the code words assigned to a state have the same first digits. A multiple shift-register realization of a sequential machine is unitary if and only if all the code words assigned to a state have l identical digits, where l is the number of shift registers in the realization. With our technique, the unitary realizations with the minimum number of shift registers can be obtained for any finite, deterministic, synchronous, and reduced (minimal-state) sequential machine, each of whose states has a nonempty predecessor set. The algorithm is suitable for programming on digital computers.
An example of an almost greedy uniformly bounded orthonormal basis for Lp(0,1)
Authors: Morten Nielsen
Venue: Journal of Approximation Theory (2007)

We construct a uniformly bounded orthonormal almost greedy basis for L"p(0,1), 12, to the class of almost greedy bases.
Application of a Methodology for the Development and Validation of Reliable Process Control Software
Authors: C. V. Ramamoorthy
Venue: IEEE Transactions on Software Engineering (1981)

This paper discusses the necessity of a good methodology for the development of reliable software, especialy with respect to the final software validation and testing activities. A formal specification development and validation methodology is proposed. This methodology has been applied to the development and validation of a pilot software, incorporating typical features of critical software for nuclear power plant safety protection. The main features of the approach indude the use of a formal specification language and the independent development of two sets of specifications. Analyses on the specifications consists of three-parts: validation against the functional requirements consistency and integrity of the specifications, and dual specification comparison based on a high-level symbolic execution technique. Dual design, implementation, and testing are performed. Automated tools to facilitate the validation and testing activities are developed to support the methodology. These includes the symbolic executor and test data generator/dual program monitor system. The experiences of applying the methodology to the pilot software are discussed, and the impact on the quality of the software is assessed.
Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems
Authors: Filip Blagojevic, Dimitrios S. Nikolopoulos, Alexandros Stamatakis, Christos D. Antonopoulos, Matthew Curtis-Maury
Venue: Parallel Computing (2007)

We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate conventional cores that run legacy codes with specialized cores that serve as computational accelerators. The term multi-grain parallelism refers to the exposure of multiple dimensions of parallelism from within the runtime system, so as to best exploit a parallel architecture with heterogeneous computational capabilities between its cores and execution units. We investigate user-level schedulers that dynamically ''rightsize'' the dimensions and degrees of parallelism on the cell broadband engine. The schedulers address the problem of mapping application-specific concurrency to an architecture with multiple hardware layers of parallelism, without requiring programmer intervention or sophisticated compiler support. We evaluate recently introduced schedulers for event-driven execution and utilization-driven dynamic multi-grain parallelization on Cell. We also present a new scheduling scheme for dynamic multi-grain parallelism, S-MGPS, which uses sampling of dominant execution phases to converge to the optimal scheduling algorithm. We evaluate S-MGPS on an IBM Cell BladeCenter with two realistic bioinformatics applications that infer large phylogenies. S-MGPS performs within 2-10% of the optimal scheduling algorithm in these applications, while exhibiting low overhead and little sensitivity to application-dependent parameters.
On the Application of Improved Back Propagation Neural Network in Real-Time Forecast
Authors: Guohui Jiang, Bing Shen, Yuqing Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

For the classical algorithm of BP network model, its convergence rate is slow and it may result in locally optimal solution. But on the condition of same arithmetic complicacy, the Fletcher-Reeves algorithm can improve the convergence rate and come to the least point along the conjugate direction so as to improve the forecasting precision of the BP network model. According to the check results of the BP network model in Guanyinge reservoir, it is proved that this model can fulfill the requirement of forecasting precision and is valuable to be used for reference or be generalized in real-time forecast of afflux runoff in other area under the same condition.