ppxscal/embedding_network huggingface dataset:
Acoustic Impact on Decoding of Semantic Emotion
Authors: Erik J. Eriksson, Felix Schaeffler, Kirk P. Sullivan
Venue: Speaker Classification II: Selected Projects (2007)

This paper examines the interaction between the emotion indicated by the content of an utternance and the emotion indicated by the acoustic of an utterance, and considers whether a speaker can hide their emotional state by acting an emotion even though being semantically honest. Three female and two male speakers of Swedish were recorded saying the sentences "Jag har vunnit en miljon pa° lotto" (I have won a million on the lottery), "Det finns böcker i bokhyllan" (There are books on the bookshelf) and "Min mamma har just dött" (my mother just died) as if they were happy, neutral (indifferent), angry or sad. Thirty-nine experimental participants (19 female and 20 male) heard 60 randomly selected stimuli randomly coupled with the question "Do you consider this speaker to be emotionally X?", where X could be angry, happy, neutral or sad. They were asked to respond yes or no; the listeners' responses and reaction times were collected. The results show that semantic cues to emotion play little role in the decoding process. Only when there are few specific acoustic cues to an emotion do semantic cues come into play. However, longer reaction times for the stimuli containing mismatched acoustic and semantic cues indicate that the semantic cues to emotion are processed even if they impact little on the perceived emotion.
Behavioral Synthesis of Double-Precision Floating-Point Adders with Function-Level Transformations: A Case Study
Authors: Yuko Hara, Hiroyuki Tomiyama, Shinya Honda, Hiroaki Takada, Katsuya Ishii
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Recently, the continuously growing capacity of FPGAs has enabled us to place floating-point arithmetic IPs on FPGAs. The required area for floating-point computations, however, is still high. This paper presents a case study on behavioral synthesis of double-precision floating-point adders and adder/subtracters for FPGAs. With function-level transformations, we design totally 15 adders and 21 adder/subtracters from addition and subtraction functions written in C. Our experimental results show that the circuit area is reduced by 58%, the execution time is shortened by 47% and the area-delay product is improved by 69%. Through the case study, we show the effectiveness of behavioral synthesis with function-level transformations for designing complex arithmetic circuits.
A Novel Analysis Method of Information Hiding
Authors: Nan Jiang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The research on information hiding theory is drawing more and more enthusiasm in recent times. This paper tries to solve theoretical problems about information hiding using vector space methods. Firstly, we project information hiding system into vector space. Then we give the significations of imperceptibility, embedding intensity, attack intensity and robustness in multi-dimension space. Subsequently, the existence theorem of information hiding system is given and proved. Finally the upper bound of capacity is given. All of them provide a novel method to the analysis and development of information hiding system.
Characterization and Optimization of the Contact Formation for High-Performance Silicon Solar Cells
Authors: Sungjoon Lee, A. Pandey, Dongseop Kim, A. Rohatgi, Gary S. May, Sangjeen Hong, Seungsoo Han
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, p-n junction formation using screen-printed metallization and co-firing is used to fabricate high-efficiency solar cells on single-crystalline (SC) silicon substrates. In order to form high-quality contacts, co-firing of a screen-printed Ag grid on the front and Al on the back surface field is implemented. These contacts require low contact resistance, high conductivity, and good adhesion to achieve high efficiency. Before co-firing, a statistically designed experiment is conducted. After the experiment, a neural network (NN) trained by the error back-propagation algorithm is employed to model the crucial relationships between several input factors and solar cell efficiency. The trained NN model is also used to optimize the beltline furnace process through genetic algorithms.
Global Convergence Analysis of Decomposition Methods for Support Vector Regression
Authors: Jun Guo, Norikazu Takahashi
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Decomposition method has been widely used to efficiently solve the large size quadratic programming (QP) problems arising in support vector regression (SVR). In a decomposition method, a large QP problem is decomposed into a series of smaller QP subproblems, which can be solved much faster than the original one. In this paper, we analyze the global convergence of decomposition methods for SVR. We will show the decomposition methods for the convex programming problem formulated by Flake and Lawrence always stop within a finite number of iterations.
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Authors: Dominique Quadri, Eric Soutif, Pierre Tolla
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The separable quadratic multi-knapsack problem (QMKP) consists in maximizing a concave separable quadratic integer (non pure binary) function subject to m linear capacity constraints. In this paper we develop a branch-and-bound algorithm to solve (QMKP) to optimality. This method is based on the computation of a tight upper bound for (QMKP) which is derived from a linearization and a surrogate relaxation. Our branch-and-bound also incorporates pre-processing procedures. The computational performance of our branch-and-bound is compared to that of three exact methods: a branch-and-bound algorithm developed by Djerdjour et al. (1988), a 0-1 linearization method originally applied to the separable quadratic knapsack problem with a single constraint that we extend to the case of m constraints, a standard branch-and-bound algorithm (Cplex9.0 quadratic optimization). Our branch-and-bound clearly outperforms other methods for large instances (up to 2000 variables and constraints).
Selecting Users for Sharing Augmented Personal Memories
Authors: Alexander Kröner, Nathalie Basselin, Michael Schneider, Junichiro Mori
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Dense records of user actions allow an intelligent environment to support its user with an augmented personal memory. In this article, we report on task-oriented user studies concerning mechanisms for sharing such memories, and show how the structure of a social network can be exploited in order to extend the resulting sharing approach.
Observations About the Development of Theoretical Computer Science
Authors: Juris Hartmanis
Venue: IEEE Annals of the History of Computing (1981)

This paper gives a personal account of some early developments in automata theory and the initiation of research in computational complexity theory. Although the account is subjective and deals primarily with the research areas of direct interest to the author, It discusses the underlying beliefs and philosophy that guided this research as well as the intellectual environment and the Ideas and contacts that influenced it. An attempt is also made to draw some general conclusions about computer science research and to discuss the nature of theoretical computer science. 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
Using Controlled Experiments for Validating UML Statechart Diagrams Measures
Authors: José A. Cruz-Lemus, Marcela Genero, Mario Piattini
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

In this work, we present the main conclusions obtained from the definition and validation of a set of measures for UML statechart diagrams, in a methodological way. The main focus is the empirical validation of the measures as early understandability indicators.
Real-time scheduling of batch systems using Petri nets and linear logic
Authors: Michel dos Santos Soares, Stéphane Julia, Jos Vrancken
Venue: Journal of Systems and Software (2008)

This paper presents an approach to model, design and verify scenarios of real-time systems used in the scheduling and global coordination of batch systems. The initial requirements of a system specified with sequence diagrams are translated into a single p-time Petri net model representing the global behavior of the system. For the Petri net fragments involved in conflicts, symbolic production and consumption dates assigned to tokens are calculated based on the sequent calculus of linear logic. These dates are then used for off-line conflict resolution within a token player algorithm used for scenario verification of real-time specifications and which can be seen as a simulation tool for UML interaction diagrams.
Development of real-time signal generator graphical user interface using Matlab 6.5
Authors: Muhammad Sharfi Najib, Mohd Shawal Jadin, Mohd Razali Daud
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Real-time application using MATLAB is very difficult to be implemented since the implementation requires very long and tedious programming code. This paper presents an approach to design real-time signal generator system that uses Graphical User Interface (GUI) development tools provided in MATLAB 6.5. The real-time signal generator GUI aimed to compensate the difficulties of writing programming code that enables a beginner to use the application without having to write programming code. The system uses Humosoft AD612 data acquisition card as the hardware part. The signals generated from the GUI are compared with the external oscilloscope to verify the reliability of the GUI. The example of application described in this paper is virtual oscilloscope with 3 independent channels display for real time signal generation.
The politics of outsourcing: bureaucrats, vendors, and public information technology (IT) projects
Authors: Alon Peled
Venue: Information Polity (2000)

A growing number of public organizations outsource the construction of critical Information Technology (IT) systems. The current public administration theory depicts a world in which the authoritative bureaucrat controls the subjugated vendor. Yet, following three years of fieldwork on this topic, I discovered that vendors play an increasingly influential political role in shaping the agenda of public IT projects. I develop four political models of public IT projects based on how bureaucrats employ their technical knowledge and how vendors manipulate their political status. I exemplify these models with four case studies that reveal the unique reality of public IT projects where failure is common and where planning and execution are inseparable activities. The cases also expose the variety of political roles vendors assume and how they sometimes lead public projects from behind the scenes.
Introducing the IEEE CG&A Editorial Board
Authors: Maureen C. Stone
Venue: IEEE Computer Graphics and Applications (2007)

IEEE CG&A Editor-in-Chief Maureen C. Stone describes the magazine's peer-review process and content guidelines, as well as introduces new editorial board members and bids farewell to departing members.
Using Intrinsic Object Attributes for Incremental Content Based Image Retrieval with Histograms
Authors: Jongan Park, Seungjo Han, Pankoo Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

An incremental Content Based Image Retrieval (CBIR) method is proposed in this paper. This method is based on color histogram. Standard histograms, because of their efficiency and insensitivity to small changes, are widely used for content based image retrieval. We define an algorithm that utilizes the concept of Histogram Refinement [1] and we call it Color Refinement Method. Color Refinement method splits the pixels in a given bucket into several classes just like histogram refinement method. The classes are all related to colors and are based on color coherence vectors. After the calculation of clusters using color refinement method, inherent features of each of cluster is calculated. These inherent features are used for incremental CBIR.
Mixed Finite-/Infinite-Capacity Priority Queue with Interclass Correlation
Authors: Thomas Demoor, Joris Walraevens, Dieter Fiems, Herwig Bruneel
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

We consider a discrete-time queueing system with two priority classes and absolute priority scheduling. In our model, we capture potential correlation between the arrivals of the two priority classes. For practical use, it is required that the high-priority queue is of (relatively) small size and we hence use a model with finite high-priority queue capacity. We obtain expressions for the probability mass functions of the steady-state system content and delay of the high-priority class as well as for the probability generating functions and moments of the steady-state system content and delay of the low-priority class. The results are compared to those of a similar system, but with an infinite capacity for high priority packets, and it is shown that the latter can be inaccurate. We also investigate the effect of correlation between the arrivals of both priority classes on the performance of the system.
A Fast and Accurate Heuristic for the Single Individual SNP Haplotyping Problem with Many Gaps, High Reading Error Rate and Low Coverage
Authors: Loredana M. Genovese, Filippo Geraci, Marco Pellegrini
Venue: Proceedings of the 7th international workshop on Algorithms in Bioinformatics (2007)

Single nucleotide polymorphism (SNP) is the most frequent form of DNA variation. The set of SNPs present in a chromosome (called the haplotype) is of interest in a wide area of applications in molecular biology and biomedicine, including diagnostic and medical therapy. In this paper we propose a new heuristic method for the problem of haplotype reconstruction for (portions of ) a pair of homologous human chromosomes from a single individual (SIH). The problem is well known in literature and exact algorithms have been proposed for the case when no (or few) gaps are allowed in the input fragments. These algorithms, though exact and of polynomial complexity, are slow in practice. Therefore fast heuristics have been proposed. In this paper we describe a new heuristic method that is able to tackle the case of many gapped fragments and retains its effectiveness even when the input fragments have high rate of reading errors (up to 20%) and low coverage (as low as 3). We test our method on real data from the HapMap Project.
A Comparative Study of Local Descriptors for Object Category Recognition: SIFT vs HMAX
Authors: Plinio Moreno, Manuel J. Marín-Jiménez, Alexandre Bernardino, José Santos-Victor, Nicolás Pérez Blanca
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this paper we evaluate the performance of the two most successful state-of-the-art descriptors, applied to the task of visual object detection and localization in images. In the first experiment we use these descriptors, combined with binary classifiers, to test the presence/absence of object in a target image. In the second experiment, we try to locate faces in images, by using a structural model. The results show that HMAX performs slightly better than SIFT in these tasks.
On linear combinations of two commuting hypergeneralized projectors
Authors: Oskar Maria Baksalary, Julio Benítez
Venue: Computers Mathematics with Applications (2008)

The concept of a hypergeneralized projector as a matrix H satisfying H^2=H^@?, where H^@? denotes the Moore-Penrose inverse of H, was introduced by Grosz and Trenkler in [J. Grosz, G. Trenkler, Generalized and hypergeneralized projectors, Linear Algebra Appl. 264 (1997) 463-474]. Generalizing substantially preliminary observations given therein, Baksalary et al. in [J.K. Baksalary, O.M. Baksalary, J. Grosz, On some linear combinations of hypergeneralized projectors, Linear Algebra Appl. 413 (2006) 264-273] characterized some situations in which a linear combination c"1H"1+c"2H"2, where c"1,c"2@?C and H"1, H"2 are hypergeneralized projectors such that H"1H"2=@h"1H"1^2+@h"2H"2^2=H"2H"1 for some @h"1,@h"2@?C, inherits the hypergenerality property. In the present paper, the problem considered in the latter paper is revisited and solved completely under the essentially weaker assumption that H"1H"2=H"2H"1.
Fuzzy Neural Petri Nets
Authors: Hua Xu, Yuan Wang, Peifa Jia
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Fuzzy Petri net (FPN) is a powerful modeling tool for fuzzy production rules based knowledge systems. But it is lack of learning mechanism, which is the main weakness while modeling uncertain knowledge systems. Fuzzy neural Petri net (FNPN) is proposed in this paper, in which fuzzy neuron components are introduced into FPN as a sub-net model of FNPN. For neuron components in FNPN, back propagation (BP) learning algorithm of neural network is introduced. And the parameters of fuzzy production rules in FNPN neurons can be learnt and trained by this means. At the same time, different neurons on different layers can be learnt and trained independently. The FNPN proposed in this paper is meaningful for Petri net models and fuzzy systems.
Recent Extensions to the Stochastic Process Algebra Tool CASPA
Authors: Martin Riedl, Johann Schuster, Markus Siegle
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

This paper describes two recent extensions of CASPA: Firstly, for better usability, a GUI for graphical model speciﬁcation has been built. Secondly, the CASPA input language has been extended by immediateactions.
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
Authors: S. Schaefer, J. Warren
Venue: Computer Aided Geometric Design (2008)

In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact evaluation technique either restrict the grids to have subdivision sampling and are, hence, exponentially increasing in size or make assumptions about the underlying surface being piecewise polynomial (Stam's method is a widely used technique that makes this assumption). As opposed to Stam's technique, our method works for both polynomial and non-polynomial schemes. The values for this exact evaluation scheme can be computed via a simple system of linear equation derived from the scaling relations associated with the scheme or, equivalently, as the dominant left eigenvector of an upsampled subdivision matrix associated with the scheme. To illustrate one possible application of this method, we demonstrate how to generate adaptive polygonalizations of a non-polynomial quad-based subdivision surfaces using our exact evaluation method. Our tessellation method guarantees a water-tight tessellation no matter how the surface is sampled and is quite fast. We achieve tessellation rates of over 33.5 million triangles/second using a CPU implementation.
Analysis of Anatomical Linear Structure Information in Mammographic Risk Assessment
Authors: Edward M. Hadley, Erika R. Denton, Josep Pont, Elsa Pérez, Reyer Zwiggelaar
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Mammographic risk assessment is concerned with the probability of a woman developing breast cancer. Recently, it has been suggested that the density of linear structures is related to risk. Two independent sets of mammographic images were annotated according to BIRADS risk classes by expert radiologists. Linear structure information was extracted from each image using the line operator method, and density segmentation was performed using a method based on minimum error thresholding.Linear discriminant analysis and a Support Vector Machine classifer were used to classify the images in to BIRADS classes. The classification was performed three times for each dataset --- once using density information only, once using linear structure information only, and once using both density and linear structure information. The results of classification showed a marked improvement when both density and linear structure information were used, suggesting that linear structure information is valuable in mammographic risk classification.
Slogger: A profiling and analysis system based on Semantic Web technologies
Authors: Mark Baker, Richard Boakes
Venue: Scientific Programming (2008)

Increasingly, distributed systems are being used to host all manner of applications. While these platforms provide a relatively cheap and effective means of executing applications, so far there has been little work in developing tools and utilities that can help application developers understand problems with the supporting software, or the executing applications. To fully understand why an application executing on a distributed system is not behaving as would be expected it is important that not only the application, but also the underlying middleware, and the operating system are analysed too, otherwise issues could be missed and certainly overall performance profiling and fault diagnoses would be harder to understand. We believe that one approach to profiling and the analysis of distributed systems and the associated applications is via the plethora of log files generated at runtime. In this paper we report on a system (Slogger), that utilises various emerging Semantic Web technologies to gather the heterogeneous log files generated by the various layers in a distributed system and unify them in common data store. Once unified, the log data can be queried and visualised in order to highlight potential problems or issues that may be occurring in the supporting software or the application itself.
Molecular geometry, charge distribution and polarization in platinum nitrides. An ab initio and density functional theory study of PtNN, PtPtNN, NPtPtN, and NNPtNN
Authors: Demetrios Xenides, George Maroulis
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

We have calculated molecular geometries, atomic charges, dipole moments and polarizabilities for the linear platinum nitrides PtNN, PtPtNN, PtNNPt and NNPtNN. The calculation of the electric properties relies on finite-field M&oslash;ller-Plesset perturbation theory and Coupled Cluster techniques. Our best values for the polar PtNN and PtPtNN molecules are calculated at the CCSD(T) level of theory and are &mu; /ea$_{0}$=&minus;0.7089 (PtNN) and &minus;0.1196 (PtPtNN), &alpha;&macr;/e$^{2}$a$_{0}^{2}$ E$_{h}^{-1 }$=56.60 (PtNN) and 123.06 (PtPtNN), &Delta; &alpha;/e$^{2}$a$_{0}^{2}$ E$_{h}^{-1 }$=27.40 (PtNN) and 68.18 (PtPtNN). For PtNNPt and NNPtNN we obtain &alpha;&macr;/e$^{2}$a$_{0}^{2}$E$_{h}^{-1 }$= 120.51 (PtNN) and 79.02 (PtPtNN), &Delta; &alpha; /e$^{2}$a$_{0}^{2}$E$_{h}^{-1 }$=116.38 (PtNN) and 76.75 (PtPtNN). Compared to the best values, the performance of the DFT methods is rather erratic.