ppxscal/embedding_network huggingface dataset:
Quality-constrained routing in publish/subscribe systems
Authors: Bogumil Zieba, Marten van Sinderen, Maarten Wegdam
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

Routing in publish/subscribe (pub/sub) features a communication model where messages are not given explicit destination addresses, but destinations are determined by matching the subscription declared by subscribers. For a dynamic computing environment with applications that have quality demands, this is not sufficient. Routing decision should, in such environments, not only depend on the subscription predicate, but should also take the quality-constraints of applications and characteristics of network paths into account. We identified three abstraction levels of these quality constraints: functional, middleware and network. The main contribution of the paper is the concept of the integration of these constraints into the pub/sub routing. This is done by extending the syntax of pub/sub system and applying four generic, proposed by us, guidelines. The added values of quality-constrained routing concept are: message delivery satisfying quality demands of applications, improvement of system scalability and more optimise use of the network resources. We discuss the use case that shows the practical value of our concept.
An Online Partially Fractional Knapsack Problem
Authors: John Noga, Veerawan Sarbua
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

The knapsack problem can and has been used to model many resource sharing problems. The allocation of a portion of a resource to a particular agent provides a benefit to the system, but also blocks other agents from utilizing that portion of the resource. For a problem where the number of agents as well as each agent's demand and potential benefit are known prior to any decision being made, the optimal allocation and its value can be calculated. In many situations these values are not known initially, but only learned over time. Online algorithms and competitive analysis are often employed when a problem requires decisions to be made prior to having all information available. In this paper we will suggest an online version of the knapsack problem, provide some justification for the model, give the exact competitive ratio for the problem in the deterministic case, and provide bounds on the competitive ratio in the randomized case.
A high speed list processor for discrete event multiprocessor: simulators
Authors: Meir Barel
Venue: ACM SIGSIM Simulation Digest (1985)

List processing plays a central role in simulation programs. It is apparent that a distributed list processing is essential for a distributed simulation. The list processor reported here is a special microprogrammed processor, according to the co-processor concept, whose architecture 1) is optimized for the execution of list and arithmetic operations, and 2) support distributed list processing on several list processors. In order to accommodate a wide range of list applications a comprehensive basic instruction set has been implemented which allows the execution of many desired list operations, e.g. complex searching and sorting algorithms. For a specific application (e.g. event list manipulation) a high level instruction set can be built by using these basic instructions. For attribute manipulation an arithmetic instruction set (floating point) is also included.
Coevolutionary feature synthesized EM algorithm for image retrieval
Authors: Rui Li, Bir Bhanu, Anlei Dong
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

As a commonly used unsupervised learning algorithm in Content-Based Image Retrieval (CBIR), Expectation-Maximization (EM) algorithm has several limitations, especially in high dimensional feature spaces where the data are limited and the computational cost varies exponentially with the number of feature dimensions. Moreover, the convergence is guaranteed only at a local maximum. In this paper, we propose a unified framework of a novel learning approach, namely Coevolutionary Feature Synthesized Expectation-Maximization (CFS-EM), to achieve satisfactory learning in spite of these difficulties. The CFS-EM is a hybrid of coevolutionary genetic programming (CGP) and EM algorithm. The advantages of CFS-EM are: 1) it synthesizes low-dimensional features based on CGP algorithm, which yields near optimal nonlinear transformation and classification precision comparable to kernel methods such as the support vector machine (SVM); 2) the explicitness of feature transformation is especially suitable for image retrieval because the images can be searched in the synthesized low-dimensional space, while kernel-based methods have to make classification computation in the original high-dimensional space; 3) the unlabeled data can be boosted with the help of the class distribution learning using CGP feature synthesis approach. Experimental results show that CFS-EM outperforms pure EM and CGP alone, and is comparable to SVM in the sense of classification. It is computationally more efficient than SVM in query phase. Moreover, it has a high likelihood that it will jump out of a local maximum to provide near optimal results and a better estimation of parameters.
Object-oriented Configuration Management Technology can Improve Software Architectural Traceability
Authors: Tien N. Nguyen, Ethan V. Munson, Cheng Thao
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Software development is a dynamic process where engineers constantly modify and refine their systems. As a consequence, everything evolves including designs, system's architectural structure, and implementation source code. Software evolution can easily make architectural traceability relationships between software architectural entities and corresponding source code become out of date. This paper suggests the use of object-oriented software configuration (SCM) and version management technology to manage versions of architectural structure/entities, source code, and the traceability relationships among them. The resulting architectural SCM system, MolhadoArch, always keeps architectural entities version-consistent with source code. Consistent configurations are maintained not only among source code but also with the high-level software architecture. MolhadoArch supports the management of both planned and unplanned evolution of software architecture.
Generating UML Models from Domain Patterns
Authors: Dae-kyo Kim, Jon Whittle
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The development of a family of applications in a domain can be greatly eased if patterns in the domain are systematically reused. Systematic use of such patterns and their instantiation in a specific application context. In this paper, we present a prototype tool called RBML-Pattern Instantiator (RBML-PI) that generates application-specific UML class diagrams and sequence diagrams from a pattern specification describe in the Rolse-Based metamodeling Language (RBML), a pattern specification language defining a domain-specific sub-language of the UML. We give an overview of the RBML using the visitor design parttern , and demonstrate the tool using an RBML specification for CheckIn-CheckOut (CICO) domain pattern that specifies services to check in and check out items. We use the CICO pattern specification to generate an application specific UML model of a library system using RBML-PI
Impact of electroplated copper thickness on copper CMP and Cu/Coral¿ BEOL integration
Authors: C. H. Seah, G. Z. You, S. R. Wang, C. Y. Li, R. Kumar
Venue: Microelectronic Engineering (2005)

A study was carried out to establish the impact of electrochemical plated (ECP) Cu thickness on the effect of dishing during Cu chemical mechanical planarization and the electrical and reliability performance of 0.13@mm Cu/Coral devices. The roughness of Cu films at the wafer edge was found to increase with increasing film thickness while it remained constant at the wafer centre. This resulted in different Cu grain morphology across the wafers. The reduction in sheet resistance (R"s) for the Cu film after annealing, as well as the as-deposited and post annealed film stresses were also found to be dependent on the ECP Cu thickness. As the thickness increased, the R"s reduction increased while the as-deposited and post annealed film stresses decreased. The different ECP Cu thickness did not show any significant difference in the amount of Cu dishing at the centre of the wafers. However, at the wafer edge, the Cu dishing amount was found to be significantly affected by the Cu thickness in which the amount of dishing increased as the thickness increased. The via chain, Kelvin via, M1 line and M2 line resistances also showed a strong dependence on the ECP Cu thickness. The thinnest Cu film of 0.7@mm gave the lowest results with the tightest spread for the four resistances tested. For the via chain and M1 line resistance, it was followed by the 1.0@mm Cu film and the 1.3@mm film yielded the worst data. In the case of Kelvin via and M2 line resistance, the thicker plated Cu films gave similar worse results. All the electrical results showed good coincidence with the Cu dishing data. The voltage ramp (v-ramp) data showed no significant difference in the electrical field leading to dielectric breakdown at both M1 and M2 lines for all the three types of ECP Cu thickness split.
Extracting Efficient Color Features for Face Recognition Using Evolutionary Computation
Authors: Peichung Shih, Chengjun Liu
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents an evolutionary framework as a novel color feature extraction method for face recognition. First, two new color spaces are defined as linear transformations of the input RGB color space. The first color space is defined by one luminance (L) channel and two chrominance channels (C¿, C¿), and the second color space incorporates one luminance channel (L) and three chrominance channels (C¿, C¿, C¿). Genetic Algorithms (GAs), driven by a fitness function that evaluates face recognition accuracy, thus search for the optimal transformations from the RGB color space to the LC¿C¿ and the LC¿C¿C¿ color spaces, respectively. The successful application of the proposed evolutionary framework is demonstrated with the Face Recognition Grand Challenge (FRGC) databases and the Biometric Experimentation Environment (BEE) baseline algorithm. In particular, when using an FRGC version 1 dataset containing 366 training images, 152 controlled gallery images, and 608 uncontrolled probe images, the evolutionary framework improves the rank-one face verification rate of the BEE baseline algorithm from 37% to 77%. When applied to an FRGC version 2 dataset consisting of 6,660 training images, 16,028 controlled target images, and 8,014 uncontrolled query images, the evolutionary framework improves the face verification rate (at 0.1% false acceptance rate) of the BEE baseline algorithm from 13% to 37%.
Design and Evaluation of Database Layouts for MEMS-Based Storage Systems
Authors: Jayaprakash Pisharath, Wei-keng Liao, Alok Choudhary
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

MEMS-based storage systems have recently generated significant interest due to their potential to be faster and more efficient than disks, while providing the non-volatility property. Designing data layouts for these devices is a challenging, important and interesting problem. In this paper, we explore various ways of placing a database on a MEMS-based storage architecture. Three novel data layouts are proposed after considering the MEMS device characteristics and the access patterns arising from queries. We then design the access methodology for each layout and evaluate these layouts based on their respective I/O service times. Overall, our results were able to identify the intricacies of placing data on a MEMS-based storage and also ascertain the large potential of MEMS-based devices for databases.
Applications of secure electronic voting to automated privacy-preserving troubleshooting
Authors: Qiang Huang, David Jao, Helen J. Wang
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Recent work [27, 15] introduced a novel peer-to-peer application that leverages content sharing and aggregation among the peers to diagnose misconfigurations on a desktop PC. This application poses interesting challenges in preserving privacy of user configuration data and in maintaining integrity of troubleshooting results. In this paper, we provide a much more rigorous cryptographic and yet practical solution for preserving privacy, and we investigate and analyze solutions for ensuring integrity.
An On-Chip Voltage Regulator with Improved Load Regulation and Light Load Power Efficiency
Authors: R. G. Raghavendra, Pradip Mandal
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

A new single stage driver circuit with improved load regulation is proposed for an on-chip voltage regulator. The improved load regulation was obtained by adding a load dependent extra current at an appropriate node of the driver circuit. Further, a load sensing circuit is proposed for improving the light load power efficiency of the on-chip voltage regulator. The circuit is implemented in 0.11µ CMOS technology. The on-chip voltage regulator generates 1.2V from 1.8V supply. The on-chip voltage regulator load current varies from 0mA to 960mA. Simulation results showed extra offset of 268mV for single stage driver without additional circuitry, where as with additional circuitry the offset was found to be 97mV, when the load current was varied from max to min load. Results also showed up 60% power savings under light load conditions, with only 32% power increase under max load conditions. The proposed circuit is particularly useful for applications with large dynamic range of load current.
Old Measures for New Services
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2005)

Like fashions and music, computing styles tend to come and go. For example, structured techniques let us measure software quality based on coupling and cohesion¿concepts that are equally applicable to today¿s service-oriented systems.
Asymmetric extreme interdependence in emerging equity markets: Research Articles
Authors: Beatriz Vaz de Melo Mendes
Venue: Applied Stochastic Models in Business and Industry (2005)

We assess the extent of integration between stock markets during stressful periods using the concept of copulas. Our methodology consists of fitting copulas to simultaneous exceedances of high thresholds, and computing copula-based measures of interdependence and contagion. Using 21 pairs of emerging stock markets daily returns, we investigate if dependence increases with crisis, and analyse the chances of both markets crashing together. Dependence at joint positive and negative extreme returns levels may differ. This type of asymmetry is captured by the upper and lower tail dependence coefficients. Propagation of crisis may be faster in one direction, and this feature is captured by asymmetric copulas. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Real-Time Range Acquisition by Adaptive Structured Light
Authors: Thomas P. Koninckx, Luc Van Gool
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

The goal of this paper is to provide a "self-adaptive” system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. Instead of using generic, static coding that is supposed to work under all circumstances, system adaptation is proposed. This occurs on-the-fly and renders the system more robust against instant scene variability and creates suitable patterns at startup. A continuous trade-off between speed and quality is made. A weighted combination of different coding cues—based upon pattern color, geometry, and tracking—yields a robust way to solve the correspondence problem. The individual coding cues are automatically adapted within a considered family of patterns. The weights to combine them are based on the average consistency with the result within a small time-window. The integration itself is done by reformulating the problem as a graph cut. Also, the camera-projector configuration is taken into account for generating the projection patterns. The correctness of the range maps is not guaranteed, but an estimation of the uncertainty is provided for each part of the reconstruction. Our prototype is implemented using unmodified consumer hardware only and, therefore, is cheap. Frame rates vary between 10 and 25 fps, dependent on scene complexity.
Impact of software engineering research on the practice of software configuration management
Authors: Jacky Estublier, David Leblang, André van der Hoek, Reidar Conradi, Geoffrey Clemm, Walter Tichy, Darcy Wiborg-Weber
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

Software Configuration Management (SCM) is an important discipline in professional software development and maintenance. The importance of SCM has increased as programs have become larger, more long lasting, and more mission and life critical. This article discusses the evolution of SCM technology from the early days of software development to the present, with a particular emphasis on the impact that university and industrial research has had along the way. Based on an analysis of the publication history and evolution in functionality of the available SCM systems, we trace the critical ideas in the field from their early inception to their eventual maturation in commercially and freely available SCM systems. In doing so, this article creates a detailed record of the critical value of SCM research and illustrates how research results have shaped the functionality of today's SCM systems.
Prediction of Outer Membrane Proteins by Support Vector Machines Using Combinations of Gapped Amino Acid Pair Compositions
Authors: Ssu-Hua Huang, Ru-Sheng Liu, Chien-Yu Chen, Ya-Ting Chao, Shu-Yuan Chen
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Discriminating outer membrane proteins from proteins with other subcellular localizations and with other folding classes are both important to predict further their functions and structures. In this paper, we propose a method for discriminating outer membrane proteins from other proteins by Support Vector Machines using combinations of gapped amino acid pair compositions. Using 5-fold cross-validation, the method achieves 95% precision and 92% recall on the dataset of proteins with well-annotated subcellular localizations, consisting of 471 outer membrane proteins and 1,120 other proteins. When applied on another dataset of 377 outer membrane proteins and 674 globular proteins belonging to four typical structural classes, the method reaches 96% precision and recall and correctly excludes 98% of the globular proteins. Our method outperforms the OM classifier of PSORTb v.2.0 and a method based on dipeptide composition.
Optimised Global Reduction on QsNet^ⅠⅠ
Authors: Duncan Roweth, Ashley Pittman
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

In this paper we describe how QsNet^II supports reduction, a key collective for massively parallel applications. Results from jobs run on a 512-node quad CPU cluster show excellent scaling, with the average time to execute a 2048 process global sum being 22 microsecs.
Redundant Class-Dependence Feature Analysis Based on Correlation Filters Using FRGC2.0 Data
Authors: Chunyan Xie, Marios Savvides, B. V. K. Vijaya Kumar
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper we propose a new method called redundant class-dependence feature analysis (CFA) based on the advanced correlation filters to perform robust face recognition on the Face Recognition Grand Challenge (FRGC) data set. The FRGC contains a large corpus of data and a set of challenge problems. The data is divided into training and validation partitions, with the standard still-image training partition consisting of 12,800 images, and the validation partition consisting of 16,028 controlled still images, 8,014 uncontrolled stills, and 4,007 3D scans. We have tested the proposed CFA method and compared it with the PCA and LDA methods in a recognition scenario on the FRGC2.0 data. The preliminary results show that the CFA outperforms the other two compared methods in our experiments. We also show the improved performance of the CFA method on the FRGC experiments #1 and #4.
Pre-processing Methods for Handwritten Arabic Documents
Authors: Faisal Farooq, Venu Govindaraju, Michael Perrone
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In order to improve the readability and the automatic recognition of handwritten document images, preprocessing steps are imperative. These steps in addition to conventional steps of noise removal and filtering include text normalization such as baseline correction, slant normalization and skew correction. These steps make the feature extraction process more reliable and effective. Recently Arabic handwriting recognition has received some attention from the research community. Due to the unique nature of the script, the conventional methods do not prove to be effective. In our work, we describe an orientation independent technique for baseline detection of Arabic words. In addition to that we describe, in the rest of the paper, our techniques for slant normalization, slope correction, line and word separation in handwritten Arabic documents. We show how the baseline can be exploited for slope and skew correction before proceeding with the steps of line and word separation.
A new phylogenetic tree model for fuzzy characters
Authors: Blayne E. Mayfield
Venue:  (2005)

Computer Science began as an extension of the study of Mathematics to investigate the mechanisms of mathematical computation. Modern Computer Science often involves the transition from a problem in some domain, to a mathematical model, and subsequently to a computer-based solution. A good transition requires both an effective description and an efficient representation of the application. This dissertation proposes a new phylogenetic tree model, called fuzzy phylogeny. Fuzzy phylogeny is an extension of a classic phylogenetic model, called perfect phylogeny. The motivation and the detail definition of fuzzy phylogeny are first explained. Then, an algorithmic solution that transforms the fuzzy phylogeny problem to its perfect phylogeny counterpart is presented. Next, relaxation problems of fuzzy phylogeny are proposed and the complexities are studied. Finally, the relaxation problems are solved by three approaches and empirical analyses are performed.