ppxscal/embedding_network huggingface dataset:
Face verification using elastic graph matching based on morphological signal decomposition
Authors: Anastasios Tefas, Constantine Kotropoulos, Ioannis Pitas
Venue: Signal Processing (2002)

In this paper a novel method for frontal face verification is proposed. It is based on the morphological signal decomposition , a procedure that is used to model a facial image region as a sum of components. During the procedure, partial sums of components create a sequence of reconstructed images which starts with a crude approximation of the facial region that recursively becomes finer. More specifically, a feature vector is created at each node of a sparse grid superimposed on the facial area by concatenating the gray level values of the reconstructed images at the grid node position. When a candidate person claims the identity of a reference person, a variant of dynamic link matching, the so-called morphological signal decomposition--dynamic link architecture, is applied to yield a matching error between the reference grid and a variable grid that is built over the facial image region of the candidate person. Local coefficients are derived to weigh the contribution of each node to the total matching error according to the node discriminatory power. Moreover, an analysis of the discriminatory power of each level in morphological signal decomposition is undertaken to assess better the behavior of the proposed method. Experimental results are reported on the M2VTS facial image database yielding a very low equal error rate.
A Scalable High-Performance Computing Solution for Networks on Chips
Authors: Martti Forsell
Venue: IEEE Micro (2002)

The Eclipse network-on-a-chip architecture uses a sophisticated parallel programming model, realized through multithreaded processors, interleaved memory modules, and a high-capacity interconnection network to support system-on-a-chip designs.
In the Year 2020 In Search of Self-Belief: The 'BOP' Phenomenon
Authors: Robert L. Glass
Venue: Computer (1995)

In this fanciful tale, software practitioners lose their self- belief to external forces in the latter part of the 20th century and regain it in the early 21st century, thanks to the BOP phenomenon. The forces arrayed against that self-belief were truly formidable. There were the vendors, heralding every new technique in the marketplace as a "breakthrough." There were the academic researchers: They declared breakthroughs as dramatic as those of the vendors in order to obtain grants for further research. There was the press, proclaiming in print the breakthroughs that had earlier been made by the vendors and the researchers. And, of course, there was management. When the much-ballyhooed benefits failed to materialize from all the so-called breakthroughs, the software managers concluded that their people--not the promises-- were faulty. Layoffs and massive outsourcing became the order of the day. Self-belief began to be restored as techniques such as postdelivery review and postimplementation audit gained favor and were implemented. Experience factories, such as the one conceived by the Software Engineering Laboratory, were founded. Lessons learned from software projects were captured, recorded, and saved for organizations to learn from and apply to future projects. Another idea that focused people's thinking on ways to improve software-building processes was the five-level Capability Maturity Model. This led to a process-improvement trend that surpassed the lessons-learned approach. From these two concepts came the idea that finally halted the erosion of software practitioners' self-belief: best of practice, or BOP for short. The author concludes the tale by describing what the impact of BOP was and how it carried practitioners into the 21st century.
Finding Localized Associations in Market Basket Data
Authors: C. C. Aggarwal, C. Procopiuc, P. S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In this paper, we discuss a technique for discovering localized associations in segments of the data using clustering. Often, the aggregate behavior of a data set may be very different from localized segments. In such cases, it is desirable to design algorithms which are effective in discovering localized associations because they expose a customer pattern which is more specific than the aggregate behavior. This information may be very useful for target marketing. We present empirical results which show that the method is indeed able to find a significantly larger number of associations than what can be discovered by analysis of the aggregate data.
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
Authors: Thomas Bülow, Reinhard Klette
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional Euclidean space. The length of such a simple digital curve is defined to be the length of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. So far, no algorithm was known for the calculation of such a shortest polygonal curve. This paper provides an iterative algorithmic solution for approximating the minimum-length polygon of a given simple digital space-curve. The theoretical foundations of this algorithm are presented as well as experimental results.
Generating and Approximating Nondominated Coteries
Authors: Jan C. Bioch, Toshihide Ibaraki
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

A coterie, which is used to realize mutual exclusion in a distributed system, is a family C of incomparable subsets such that every pair of subsets in C has at least one element in common. Associate with a family of subsets C a positive (i.e., monotone) Boolean function fC such that fC(x) = 1 if the Boolean vector x is equal to or greater than the characteristic vector of some subset in C, and 0 otherwise. It is known that C is a coterie if and only if fC is dual-minor, and is a nondominated (ND) coterie if and only if fC is self-dual.In this paper, we introduce an operator ¿, which transforms a positive self-dual function into another positive self-dual function, and the concept of almost-self-duality, which is a close approximation to self-duality and can be checked in polynomial time (the complexity of checking positive self-duality is currently unknown). After proving several interesting properties of them, we propose a simple algorithm to check whether a given positive function is self-dual or not. Although this is not a polynomial algorithm, it is practically efficient in most cases. Finally, we present an incrementally polynomial algorithm that generates all positive self-dual functions (ND coteries) by repeatedly applying ¿ operations. Based on this algorithm, all ND coteries of up to seven variables are computed.
On Computing Connected Components of Line Segments
Authors: Ramakrishna Thurimella, Mario Alberto Lopez
Venue: IEEE Transactions on Computers (1995)

It is shown that given a set of n line segments, their connected components can be computed in time O(n4/3log3n). A bound of o(n4/3) for this problem would imply a similar bound for detecting, for a given set of n points and n lines, whether some point lies on some of the lines. This problem, known as Hopcroft¿s problem, is believed to have a lower bound of ¿(n4/3). For the special case when for each segment both endpoints fall inside the same face of the arrangement induced by the set of segments, we give an algorithm that runs in O(nlog 3n) time.
Modeling and Using Product Line Variability in Automotive Systems
Authors: Steffen Thiel, Andreas Hein
Venue: IEEE Software (2002)

Automotive systems fundamentally improve passenger comfort, safety, economy, and security. However, while many design problems related to requirements such as real-time performance and safety and reliability have become manageable, cost-effectiveness and time-to-market remain a challenge for the automotive industry. Product lines are a promising approach in this respect because they permit the strategic reuse of core assets during system development. However, to gain significant economies of scope within a product line approach, systematic planning and continuous management of variability throughout the development process is required. In this article, the authors discuss the value of variability in product lines and describe their approach to modeling and using variability, which evolved from their work with several industrial case studies at Bosch.
On vertex-transitive graphs of odd prime-power order
Authors: Yan-Quan Feng
Venue: Discrete Mathematics (2002)

Marusic (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of order pk are Cayley graphs for each prime p and k = 1,2, or 3, and constructed a non-Cayley vertex-transitive graph of order pk and valency 2p + 2 for each prime p ≥ 5 and k ≥ 4. McKay and Praeger (J. Austral. Math. Soc. (A) 56 (1994) 53) gave an alternative construction of a non-Cayley vertex-transitive graph of order pk for each prime p ≥ 3 and k ≥ 4. In this paper it is proved that, for each positive integer k and each prime p ≥ 3, a vertex-transitive graph of order pk with valency less than 2p + 2 is a Cayley graph.
Trigger Condition Testing and View Maintenance Using Optimized Discrimination Networks
Authors: E. N. Hanson, S. Bodagala, U. Chadaga
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper presents a structure that can be used both for trigger condition testing and view materialization, along with a study of techniques for optimizing the structure. The structure presented is known as a discrimination network. The type of discrimination network introduced and studied in this paper is a highly general type of discrimination network which we call the Gator network. The structure of several alternative Gator network optimizers is described, along with a discussion of optimizer performance, output quality, and accuracy. The optimizers can choose an efficient Gator network for testing the conditions of a set of triggers or optimizing maintenance of a set of views, given information about the structure of the triggers or views, database size, predicate selectivity, and update frequency distribution. The efficiency of optimized Gator networks relative to alternatives is analyzed. The results indicate that overall, Gator networks can be optimized effectively and can give excellent performance for trigger condition testing and materialization of views.
Unsupervised Learning with Mixed Numeric and Nominal Data
Authors: Cen Li, Gautam Biswas
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper presents a Similarity-Based Agglomerative Clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure, proposed by Goodall for biological taxonomy, that gives greater weight to uncommon feature value matches in similarity computations and makes no assumptions of the underlying distributions of the feature values, is adopted to define the similarity measure between pairs of objects. An agglomerative algorithm is employed to construct a dendrogram and a simple distinctness heuristic is used to extract a partition of the data. The performance of SBAC has been studied on real and artificially generated data sets. Results demonstrate the effectiveness of this algorithm in unsupervised discovery tasks. Comparisons with other clustering schemes illustrate the superior performance of this approach.
User interfaces and help systems: from helplessness to intelligent assistance
Authors: Sylvain Delisle, Bernard Moulin
Venue: Artificial Intelligence Review (2002)

Despite a large body of multidisciplinary research on helpful and user-oriented interface design, help facilities found in most commercial software are so ill-conceived that they are often 'unhelpful'. From a wide spectrum of disciplines and software tools, we present an extensive review of related work, identifying their limitations as well as their most promising aspects. Using this material, we attempt to recapitulate the necessary requirements for useful help systems.
Compiling Global Name-Space Parallel Loops for Distributed Execution
Authors: C. Koelbel, P. Mehrotra
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

Compiler support required to allow programmers to express their algorithms using a global name-space is discussed. A general method for the analysis of a high-level source program and its translation into a set of independently executing tasks that communicate using messages is presented. It is shown that if the compiler has enough information, the translation can be carried out at compile time. Otherwise, run-time code is generated to implement the required data movement. The analysis required in both situations is described, and the performance of the generated code on the Intel iPSC/2 hypercube is presented.
Toolkit for enabling analysis and modeling of adaptive workflow (TEAMWORK)
Authors: Perakath C. Benjamin, Madhav Erraguntla, Richard J. Mayer, Charles Marshall
Venue: ACM SIGGROUP Bulletin (1999)

The increasing uncertainties of the global economy necessitate a radical rethinking in the way enterprises will operate in the coming millennium. A key challenge in the coming years will be agility, the ability to respond adequately to and thrive within an unpredictable and continuously changing environment. This ability will distinguish the successful organizations of the next decade. Important prerequisites for agility are the ability to: (i) design and produce products that are agile (i.e., product agility); (ii) design, execute, and maintain processes and organizations that are responsive to unpredictable change (i.e., organization and process agility); and (iii) rapidly evolve the infrastructure and technology of the enterprise in response to the changing environment (i.e., technology and infrastructure agility). This paper describes the architecture and concept of operation of TEAMWORK, a Toolkit for Enabling Analysis and Modeling of Adaptive Workflow--that addresses some of these requirements.
Text Compression for Dynamic Document Databases
Authors: Alistair Moffat, Justin Zobel, Neil Sharman
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

For compression of text databases, semi-static word-based methods provide good performance in terms of both speed and disk space, but two problems arise. First, the memory requirements for the compression model during decoding can be unacceptably high. Second, the need to handle document insertions means that the collection must be periodically recompressed if compression efficiency is to be maintained on dynamic collections. Here we show that with careful management the impact of both of these drawbacks can be kept small. Experiments with a word-based model and over 500 Mb of text show that excellent compression rates can be retained even in the presence of severe memory limitations on the decoder, and after significant expansion in the amount of stored text.
A Multi-Mode Scannable Memory Element for High Test Application Efficiency and Delay Testing
Authors: E. S. Sogomonyan, A. D. Singh, M. Goessel
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper introduces a new multi-mode scannable memory element which allows pseudorandom testing to be integrated with scan in sequential circuits without the need of any design changes. As in the case of scan, the new element is used in place of regular flip-flops in the design library. Concurrent with normal operation, the design can accumulate a signature of the state variables in the scan-register configured as a multiple input signature analyzer (MISA). Thus virtually complete state observability is achieved without the need of scanning-out the state for each test-input. The pseudorandom states of the MISA can also be utilized as state inputs in pseudorandom testing. In this way, most faults are covered in a pseudorandom, &ldquo;test per clock&rdquo; mode. Only a few random pattern resistant faults require scan, greatly reducing test application time. Pseudorandom delay testing of the true normally active circuit paths is also possible. Two-pattern tests are supported. Finally, we show that the new memory element can also be used for fault-tolerant design.
A Simulation Study of Decoupled Vector Architectures
Authors: Roger Espasa, Mateo Valero
Venue: The Journal of Supercomputing (1999)

Decoupling techniques can be applied to a vector processor, resulting in a large increase in performance of vectorizable programs. We simulate a selection of the Perfect Club and Specfp92 benchmark suites and compare their execution time on a conventional single port vector architecture with that of a decoupled vector architecture. Decoupling increases the performance by a factor greater than 1.4 for realistic memory latencies, and for an ideal memory system with zero latency, there is still a speedup of as much as 1.3. A significant portion of this paper is devoted to studying the tradeoffs involved in choosing a suitable size for the queues of the decoupled architecture. The hardware cost of the queues need not be large to achieve most of the performance advantages of decoupling.
Clothing the E-Emperor
Authors: John R. Michener, Steven D. Mohan
Venue: Computer (2001)

Internet users need a more trustworthy and accountable exchange system for online transactions.
A Structural Equation Modeling Approach to Examining the Predictive Power of Determinants of Individuals' Health Expenditures
Authors: Jin-Yuan Chern, Thomas T. H. Wan, James W. Begun
Venue: Journal of Medical Systems (2002)

Understanding the determinants of health expenditures is essential for a fair and effective utilization profiling, particularly in the setting of capitation rates in risk-adjustment models. The objective of the study was to examine the relative importance of determinants in predicting future health expenditures, using structural equation modeling. Based on Andersen's behavioral system model, individual determinants along with prior utilization and measures of health status from 1994 are evaluated in a longitudinal design for their predictive power for health expenditures in 1995. A total of 4255 policyholders enrolled in three health plans at Trigon BlueCross/BlueShield of Virginia who responded to a mail survey were included for analysis. Person-level annual charges for health services utilization were used as the dependent variable. Five health scales were excerpted from Health Survey SF-36 to represent an individual's health status. Excluding prior utilization in 1994, health status (&gamma; &equals; &minus;0.19, p < 0.001) and having diabetes (&gamma; &equals; 0.08, p < 0.001) are two statistically significant predictors of health expenditures in 1995. Including prior utilization, both health status (&gamma; &equals; &minus;0.15, p < 0.001) and prior utilization (&gamma; &equals; 0.15, p < 0.001) are the most important predictors, followed by having diabetes (&gamma; &equals; 0.08, p < 0.001). Health status is a powerful predictor of future health expenditures, even when prior utilization is controlled.
Testing Tools Combine Best Of New And Old
Authors: Robert M. Poston
Venue: IEEE Software (1995)

The commercial marketplace now offers a perplexing array of testing tools, so it is not surprising that many people are confused. What kinds of tools are now available? How do they work? How can Tool X help me? In this article, Robert Poston walks through testing as it unfolds during the entire development process, stopping to discuss tools useful to testers at each phase.¿ Dave Sharon
Folklore confirmed: reducible flow graphs are exponentially larger
Authors: Larry Carter, Jeanne Ferrante, Clark Thomborson
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

Many program analysis techniques used by compilers are applicable only to programs whose control flow graphs are reducible. Node-splitting is a technique that can be used to convert any control flow graph to a reducible one. However, as has been observed for various node-splitting algorithms, there can be an exponential blowup in the size of the graph.We prove that exponential blowup is unavoidable. In particular, we show that any reducible graph that is equivalent to the complete graph on n nodes (or to related bounded-degree control flow graphs) must have at least 2n-1 nodes. While this result is not a surprise, it may be relevant to the quest for finding methods of obfuscation for software protection.
On the Use of SDF-Type Filters for Distortion Parameter Estimation
Authors: Neil Muller, B. M. Herbst
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Synthetic discriminant functions have been used to locate objects irrespective of distortions and to estimate the extent of the distortion. It was recognized from the beginning that accurate estimates are only possible provided the training set is constructed carefully. In this paper, we obtain conditions that will ensure the accuracy of the estimates. The conditions also suggest efficient ways of constructing the training sets and the results are extended to a wide class SDF-type filters. The theoretical results are illustrated with (idealized) examples and are also applied to the more realistic problem of accurate facial location.
Guest Editors' Introduction: Requirements Engineering
Authors: Daniel M. Berry, Brian Lawrence
Venue: IEEE Software (1998)

Slowly, we are bridging the gap between requirements engineering research and practice. The gap is still large, but we have a few more practice-validated methods and tools in our pockets, and the bridge building continues.
Managing Complex Documents Over the WWW: A Case Study for XML
Authors: Paolo Ciancarini, Fabio Vitali, Cecilia Mascolo
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The use of the World Wide Web as a communication medium for knowledge engineers and software designers is limited by the lack of tools for writing, sharing, and verifying documents written with design notations. For instance, the Z language has a rich set of mathematical characters, and requires graphic-rich boxes and schemas for structuring a specification document. It is difficult to integrate Z specifications and text on WWW pages written with HTML, and traditional tools are not suited for the task. On the other hand, a newly proposed standard for markup languages, namely XML, allows one to define any set of markup elements; hence, it is suitable for describing any kind of notation. Unfortunately, the proposed standard for rendering XML documents, namely XSL, provides for text-only (although sophisticated) rendering of XML documents, and thus it cannot be used for more complex notations. We present a Java-based tool for applying any notation to elements of XML documents. These XML documents can thus be shown on current-generation WWW browsers with Java capabilities. A complete package for displayingZ specifications has been implemented and integrated with standard text parts. Being a complete rendering engine, text parts andZ specifications can be freely intermixed, and all the standard features of XML (including HTML links and form elements) are available outside and inside Z specifications. Furthermore, the extensibility of our engine allows any additional notations to be supported and integrated with the ones we describe here.
Machine Intelligence-The Animat Path to Intelligent Adaptive Behaviour
Authors: P. M. Todd
Venue: Computer (1992)

The animat path to artificial intelligence (AI), a bottom-up approach to creating intelligent systems, is described. Using this approach, artificial creatures or agents animats are constructed in an environment. They begin simply and are gradually made more and more complex, exhibiting more and more complex behaviors at each step. The goals and accomplishments of five research projects incorporating the animat path to AI methodology are reviewed.