ppxscal/embedding_network huggingface dataset:
Learning Mixture Models for Gender Classification Based on Facial Surface Normals
Authors: Jing Wu, W. A. Smith, E. R. Hancock
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

The aim in this paper is to show how to discriminate gender using a parameterized representation of fields of facial surface normals (needle-maps). We make use of principle geodesic analysis (PGA) to parameterize the facial needle-maps. Using feature selection, we determine the selected feature set which gives the best result in distinguishing gender. Using the EM algorithm we distinguish gender by fitting a two component mixture model to the vectors of selected features. Results on real-world data reveal that the method gives accurate gender discrimination results.
Frameworks in Teaching
Authors: Michael E. Caspersen, Henrik Bærbak Christensen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Software reuse is important in modern software engineering to ensure high quality software while keeping cost down. Software reuse is therefore an important topic in teaching. This chapter discusses issues relating to teaching object-oriented frameworks that represent a central technique for software reuse. We present concrete techniques for teaching the topic at both introductory and advanced programming level and convey our experiences. At the introductory level we discuss a simple yet powerful framework, Presenter, that serves as a first introduction to programming using frameworks as well as a gentle introduction to the more complex topic of graphical user interface frameworks like Java AWT and Swing. At the advanced level we discuss a complex framework, JHotDraw, that both serves to demonstrate concepts and techniques used in complex frameworks, as well as demonstrate how design patterns are combined in object-oriented frameworks.
Enabling Very-Large Scale Earthquake Simulations on Parallel Machines
Authors: Yifeng Cui, Reagan Moore, Kim Olsen, Amit Chourasia, Philip Maechling, Bernard Minster, Steven Day, Yuanfang Hu, Jing Zhu, Amitava Majumdar, Thomas Jordan
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The Southern California Earthquake Center initiated a major large-scale earthquake simulation called TeraShake. The simulations propagated seismic waves across a domain of 600x300x80 km at 200 meter resolution, some of the largest and most detailed earthquake simulations of the southern San Andreas fault. The output from a single simulation may be as large as 47 terabytes of data and 400,000 files. The execution of these large simulations requires high levels of expertise and resource coordination. We describe how we performed single-processor optimization of the application, optimization of the I/O handling, and the optimization of execution initialization. We also look at the challenges presented by run-time data archive management and visualization. The improvements made to the application as it was recently scaled up to 40k BlueGene processors have created a community code that can be used by the wider SCEC community to perform large scale earthquake simulations.
The OptIPortal, a scalable visualization, storage, and computing interface device for the OptiPuter
Authors: Thomas A. DeFanti, Jason Leigh, Luc Renambot, Byungil Jeong, Alan Verlo, Lance Long, Maxine Brown, Daniel J. Sandin, Venkatram Vishwanath, Qian Liu, Mason J. Katz, Philip Papadopoulos, Joseph P. Keefe, Gregory R. Hidley, Gregory L. Dawe, Ian Kaufman, Bryan Glogowski, Kai-Uwe Doerr, Rajvikram Singh, Javier Girado, Jurgen P. Schulze, Falko Kuester, Larry Smarr
Venue: Future Generation Computer Systems (2009)

The OptIPortal is a tiled display that is the visual interface to the OptIPuter, a global-scale computing system tied together by tens of gigabits of networking. The main point of the OptIPuter project is to examine a ''future'' in which networking is not a bottleneck to local, regional, national and international computing. OptIPortals are designed to allow collaborative sharing over 1-10 gigabit/second networks of extremely high-resolution graphic output, as well as video streams. OptIPortals typically consist of an array of 4 to 70 LCD display panels (either 2-megapixel or 4-megapixel each), driven by an appropriately sized cluster of PCs, with optimized graphics processors and network interface cards. Rather than exist as one-of-a-kind laboratory prototypes, OptIPortals are designed to be openly and widely replicated, balancing the state of the art of PCs, graphic processing, networks, servers, software, middleware, and user interfaces, and installed in the context of a laboratory or office conference room. Discussed in detail are the design decisions made to achieve a replicable tiled display that can be built by computational science researchers in various disciplines.
E-government in Australia: Promise and progress
Authors: Julian Teicher, Nina Dow
Venue: Information Polity (2002)

This paper has two principal objectives: to provide an account of the nature and extent of e-government in Australia at the three levels of government and to examine some of the major obstacles to the realization of the potential of e-government. Drawing on the published record and a benchmark survey of Australian public managers, it is apparent that, in Australia, the implementation of e-government is still largely focused at the information only level and that its spread is uneven, particularly in rural and remote areas. Furthermore, the increasing popularity of portals is paradoxical, with a proliferation of portals at each level of government, rather than a single point of entry. More significantly, there is little evidence of progress toward the ideal of joined up government.
Classification of Concrete Textual Syntax Mapping Approaches
Authors: Thomas Goldschmidt, Steffen Becker, Axel Uhl
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Textual concrete syntaxes for models are beneficial for many reasons. They foster usability and productivity because of their fast editing style, their usage of error markers, autocompletion and quick fixes. Furthermore, they can easily be integrated into existing tools such as diff/merge or information interchange through e-mail, wikis or blogs. Several frameworks and tools from different communities for creating concrete textual syntaxes for models emerged during recent years. However, these approaches failed to provide a solution in general. Open issues are incremental parsing and model updating as well as partial and federated views. To determine the capabilities of existing approaches, we provide a classification schema, apply it to these approaches, and identify their deficiencies.
Remarks on Self-organization and Trust in Organic Computing Systems
Authors: Hartmut Schmeck
Venue: Proceedings of the 4th international conference on Autonomic and Trusted Computing (2007)

The vision of Organic Computing postulates the advent of multitudes of services provided by collections of intelligent devices by means of self-organized cooperation. Due to their large numbers and their versatile interactions in potentially unlimited networks, it will be unfeasible to explicitly control the behavior of these (partially mobile) devices and their services. Therefore, they will have to respond autonomously in an intelligent way to changing parameters in their environment in order to guarantee appropriate degrees of behavioral robustness and flexibility. Because of these life-like properties, they are called Organic Computing systems. Apparently, the behavior of adaptive, self-organized systems might be hard to predict. At the same time, these systems will have to be trustworthy to be accepted by human users, otherwise, their potential benefits would not be exploited. A necessary prerequisite for establishing and maintaining trust will be the possibility to influence the behavior of Organic Computing systems in a controlled way whenever the system is moving into behavioral regions that are viewed to be unacceptable by human users or by their current execution environment. Hence, an important facet of Organic Computing is the presence of controlled self-organization, enabled by appropriately designed observer/controller mechanisms and methods of data analysis. The talk will elaborate on the state of the art in the area of Organic Computing and, in particular, will focus on possibilities and problems for the engineering of trustworthy organic systems.
A hybrid cryptosystem based on WEP for 802.11 networks
Authors: Ramzi A. Haraty, Walid El Horr
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Wireless is the next generation networking technology. The security of such technology is very critical because its physical layer is the electro-magnetic waves that can be easily intercepted by anyone. The original security protocol for 802.11 wireless networks is called WEP (Wired Equivalent Privacy). It is a protocol that is based on symmetric-key encryption algorithm RC4 (Rivest Cipher 4). Unfortunately, this protocol had many flaws that made it exposed to many attacks. This paper presents a set of improvements for WEP, which include key management and distribution, and authentication. These improvements convert WEP to a hybrid cryptosystem, a system that is based on both a symmetric-key algorithm and an asymmetric-key algorithm.
Analysis of Historical Artistic Documentaries
Authors: Matthias Zeppelzauer, Dalibor Mitrovic, Christian Breiteneder
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

The paper introduces a novel interdisciplinary project addressing the analysis of historical artistic films. The type of employed material has not been subject to automatic analyses, so far. It poses challenges in all areas of content-based analysis and retrieval due to its complex temporal structure and due to substantial degradations. We propose robust features and a method for shot cut detection for this material that outperforms established techniques.
Content Synchronization in Replicated Grid Database Resources
Authors: Marek Ciglan, Ladislav Hluchý
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Widely used approach to increase data availability and fault tolerance in grid systems is the data replication. Most of the grid data management and data replication solutions deal purely with read-only data sets. There is a lack of the tools that enable the management of updatable grid database replicas. This work presents a set of services for the replica content synchronization, which are designed to support relational and xml data resources, provide the interoperability of heterogeneous systems and enable the utilization of proven methods for consistency handling to synchronize replicas in the heterogeneous grid environment. The main component of proposed system is the update propagation service that coordinates the functionality of other involved middleware services. We present the prototype implementation and summarize achieved results. The achievements include the empowerment of multiple legacy grid middleware components by increasing their availability and the tolerance to the faults.
Geospatial image stream processing: models, techniques, and applications in remote sensing change detection
Authors: Carlos Alberto Rueda-Velasquez
Venue:  (2007)

Detection of changes in environmental phenomena using remotely sensed data is a major requirement in the Earth sciences, especially in natural disaster related scenarios where real-time detection plays a crucial role in the saving of human lives and the preservation of natural resources. Although various approaches formulated to model multidimensional data can in principle be applied to the inherent complexity of remotely sensed geospatial data, there are still challenging peculiarities that demand a precise characterization in the context of change detection, particularly in scenarios of fast changes. In the same vein, geospatial image streams do not fit appropriately in the standard Data Stream Management System (DSMS) approach because these systems mainly deal with tuple-based streams. Recognizing the necessity for a systematic effort to address the above issues, the work presented in this thesis is a concrete step toward the foundation and construction of an integrated Geospatial Image Stream Processing framework, GISP. First, we present a data and metadata model for remotely sensed image streams. We introduce a precise characterization of images and image streams in the context of remotely sensed geospatial data. On this foundation, we define spatially-aware temporal operators with a consistent semantics for change analysis tasks. We address the change detection problem in settings where multiple image stream sources are available, and thus we introduce an architectural design for the processing of geospatial image streams from multiple sources. With the aim of targeting collaborative scientific environments, we construct a realization of our architecture based on Kepler, a robust and widely used scientific workflow management system, as the underlying computational support; and open data and Web interface standards, as a means to facilitate the interoperability of GISP instances with other processing infrastructures and client applications. We demonstrate our GISP framework with representative remote sensing applications including land cover detection, wildfire detection, and near real-time validation of surface temperature measurements integrating ground- and satellite-based data. 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
Dimensionality Reduction for Mass Spectrometry Data
Authors: Yihui Liu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

In this paper multilevel wavelet analysis is performed for high dimensional mass spectrometry data. A set of wavelet approximation coefficients at different scale is used to characterize the features of mass spectrometry data. Approximation coefficients compress mass spectrometry data and act as "fingerprint" of mass spectrometry data. Support vector machine is used to classify the different tissue based on these wavelet features. 2 and 3 fold cross validation experiments are performed on 2 datasets based on approximation coefficients at 1st, 2nd and 3rd level decomposition respectively. A highly competitive accuracy in comparison to the best performance of other kinds of classification models is achieved. 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
Many-Objective Particle Swarm Optimization by Gradual Leader Selection
Authors: Mario Köppen, Kaori Yoshida
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Many-objective optimization refers to multi-objective optimization problems with a number of objectives considerably larger than two or three. This papers contributes to the use of Particle Swarm Optimization (PSO) for the handling of such many-objective optimization problems. Multi-objective PSO approaches typically rely on the employment of a so-called set of leaders that generalizes the global best particle used in the standard PSO algorithm. The exponentially decreasing probability of finding non-dominated points in search spaces with increasing number of objectives poses a problem for the selection from this set of leaders, and renders multi-objective PSOs easily unusable. Gradual Pareto dominance relation can be used to overcome this problem. The approach will be studied by means of the problem to minimize the Euclidian distances to a number of points, where each distance to the points is considered an independent objective. The Pareto set of this problem is the convex closure of the set of points. The conducted experiments demonstrate the usefulness of the proposed approach and also show the higher resemblance of the proposed PSO variation with the standard PSO.
Pervasive Services on the Move: Smart Service Diffusion on the OSGi Framework
Authors: Davy Preuveneers, Yolande Berbers
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

The ubiquity of wireless ad hoc networks and the benefits of loosely coupled services have fostered a growing interest in service oriented architectures for mobile and pervasive computing. Many architectures have been proposed that implement context-sensitive service discovery, selection and composition, or that use a component-based software engineering methodology to facilitate runtime adaptation to changing circumstances. This paper explores live service mobility in pervasive computing environments as a way to mitigate the risk of disconnections during service provision in mobile ad hoc networks. It focuses on context-aware service migration and diffusion to multiple hosts to increase accessibility and expedite human interaction with the service. We analyze the basic requirements for service mobility and discuss an implementation on top of OSGi. Finally, we evaluate our approach to service mobility and illustrate its effectiveness by means of a real-life scenario.
Mechanical structuring, surface treatment and tribological characterization of steel mould inserts for micro powder injection moulding
Authors: J. Schneider, A. Kienzler, M. Deuchert, V. Schulze, J. Kotschenreuther, K.-H. Zum Gahr, D. L&#x00f6;he, J. Fleischer
Venue: Microsystem Technologies (2008)

Manufacturing of ceramic and metallic micro components in micro powder injection moulding (&#x03bc;PIM) requires mould inserts offering high wear resistance and a sufficient demoulding behaviour. Within the frame of this research &#x03bc;PIM mould inserts made from low and high alloyed tool steel were structured by micro milling and finished by micro peening and ultrasonic wet peening. Influence of surface condition on wear and demoulding behaviour of the steels in &#x03bc;PIM with ceramic feedstock was characterized using a laboratory tribotester simulating powder injection moulding and a specially adapted static friction tester. Results indicate that performance of mould inserts in micro powder injection moulding depends not only on hardness, surface condition and homogeneity of the mould insert materials but also is strongly influenced by the characteristics of the feedstock, like composition of the binder or amount and hardness of the ceramic particles.
Combiner Driven Management Models and Their Applications
Authors: Michael Beiter
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

In this paper, we will study the question of performing arbitrary updates in secret sharing schemes when shares of unaffected parties shall remain unchanged. We will introduce a new phase in the lifetime of secret sharing schemes to simplify constructions of multi-time secret sharing schemes and propose management models that allow unlimited updates from arbitrary schemes without need for broadcasts. As an example, we give an implementation based on Shamir's threshold scheme.
When Interaction Choices Trigger Business Evolutions
Authors: Guillaume Godet-Bar, Sophie Dupuy-Chessa, Dominique Rieu
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

In the context of development methods, early collaborations between specialists (SE, HCI, business, usability experts ...) allows having a broader view of the development possibilities, notably in terms of user-system interaction. Consequently, in-depth transformations of the processes and concepts can be considered with minimum financial or temporal impact. We discuss in this paper the opportunities for business process evolutions emerging from the application of our collaborative method, based on the choices made for designing the interaction.
Distributed algorithms for source localization using quantized sensor readings
Authors: Antonio Ortega
Venue:  (2007)

We consider sensor-based distributed source localization applications, where sensors transmit quantized data to a fusion node, which then produces an estimate of the source location. For this application, the goal is to minimize the amount of information that the sensor nodes have to exchange in order to attain a certain source localization accuracy. We propose an iterative quantizer design algorithm that allows us to take into account the localization accuracy for quantizer design. We show that the quantizer design should be &ldquo;application-specific&rdquo; and a new metric should be defined to design such quantizers. In addition, we address, using the generalized BFOS algorithm, the problem of allocating rates to each sensor so as to minimize the error in estimating the position of a source.We also propose a distributed encoding algorithm that is applied after quantization and achieves significant rate savings by merging quantization bins. The bin-merging technique exploits the fact that certain combinations of quantization bins at each node cannot occur because the corresponding spatial regions have an empty intersection.We apply these algorithms to a system where an acoustic amplitude sensor model is employed at each sensor for source localization. For this case, we propose a distributed source localization algorithm based on the maximum a posteriori (MAP) criterion. If the source signal energy is known, each quantized sensor reading corresponds to a region in which the source can be located. Aggregating the information obtained from multiple sensors corresponds to generating intersections between the regions. We develop algorithms that estimate the likelihood of each of the intersection regions. This likelihood can incorporate uncertainty about the source signal energy as well as measurement noise. We show that the computational complexity of the algorithm can be significantly reduced by taking into account the correlation of the received quantized data. Our simulations show the improved performance of our quantizer over traditional quantizer designs and that our localization algorithm achieves good performance with reasonable complexity as compared to minimum mean square error (MMSE) estimation. They also show that an optimized rate allocation leads to significant rate savings (e.g., over 60%) with respect to a rate allocation that uses the same rate for each sensor, with no penalty in localization efficiency. In addition, they demonstrate rate savings (e.g., over 30%, 5 nodes, 4 bits per node) when our novel bin-merging algorithms are used.
Letters: Gaussian moments for noisy unifying model
Authors: Yumin Yang, Chonghui Guo
Venue: Neurocomputing (2008)

A unifying model that combines three properties is proposed by Hyvarinen, and a gradient ascent algorithm for independent component analysis (ICA) is performed by maximum likelihood estimation. In this paper, we consider the estimation of the data model of ICA when Gaussian noise is present and the independent components are time dependent. Firstly, according to the useful property of Gaussian moments, we introduce Gaussian moments algorithm to estimation of the noisy unifying model when the noise covariance matrix is known. Next, when the noise covariance is unknown, a new Gaussian moments algorithm is developed. Finally, the validity and performance of our algorithms are demonstrated by computer simulations.