ppxscal/embedding_network huggingface dataset:
Investigating Hidden Markov Models' Capabilities in 2D Shape Classification
Authors: Manuele Bicego, Vittorio Murino
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, Hidden Markov Models (HMMs) are investigated for the purpose of classifying planar shapes represented by their curvature coefficients. In the training phase, special attention is devoted to the initialization and model selection issues, which make the learning phase particularly effective. The results of tests on different data sets show that the proposed system is able to accurately classify objects that were translated, rotated, occluded, or deformed by shearing, also in the presence of noise.
A Similarity-Based Robust Clustering Method
Authors: Miin-Shen Yang, Kuo-Lung Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper presents an alternating optimization clustering procedure called a similarity-based clustering method (SCM). It is an effective and robust approach to clustering on the basis of a total similarity objective function related to the approximate density shape estimation. We show that the data points in SCM can self-organize local optimal cluster number and volumes without using cluster validity functions or a variance-covariance matrix. The proposed clustering method is also robust to noise and outliers based on the influence function and gross error sensitivity analysis. Therefore, SCM exhibits three robust clustering characteristics: 1) robust to the initialization (cluster number and initial guesses), 2) robust to cluster volumes (ability to detect different volumes of clusters), and 3) robust to noise and outliers. Several numerical data sets and actual data are used in the SCM to show these good aspects. The computational complexity of SCM is also analyzed. Some experimental results of comparing the proposed SCM with the existing methods show the superiority of the SCM method.
Sensitivity to haptic-audio asynchrony
Authors: Bernard D. Adelstein, Durand R. Begault, Mark R. Anderson, Elizabeth M. Wenzel
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

The natural role of sound in actions involving mechanical impact and vibration suggests the use of auditory display as an augmentation to virtual haptic interfaces. In order to budget available computational resources for sound simulation, the perceptually tolerable asynchrony between paired haptic-auditory sensations must be known. This paper describes a psychophysical study of detectable time delay between a voluntary hammer tap and its auditory consequence (a percussive sound of either 1, 50, or 200 ms duration). The results show Just Noticeable Differences (JNDs) for temporal asynchrony of 24 ms with insignificant response bias. The invariance of JND and response bias as a function of sound duration in this experiment indicates that observers cued on the initial attack of the auditory stimuli.
Symmetric Chain Decompositions of Linear Lattices
Authors: Frank Vogt, Bernd Voigt
Venue: Combinatorics, Probability and Computing (1997)

It has been known for several years that the lattice of subspaces of a finite vector space has a decomposition into symmetric chains, i.e. a decomposition into disjoint chains that are symmetric with respect to the rank function of the lattice. This paper gives a positive answer to the long-standing open problem of providing an explicit construction of such a symmetric chain decomposition for a given lattice of subspaces of a finite (dimensional) vector space. The construction is done inductively using Schubert normal forms and results in a bracketing algorithm similar to the well-known algorithm for Boolean lattices.
Intersecting families of permutations
Authors: Peter J. Cameron, C. Y. Ku
Venue: European Journal of Combinatorics (2003)

Let Sn be the symmetric group on the set X = {1, 2,...,n}. A subset S of Sn is intersecting if for any two permutations g and h in S, g(x) = h(x) for some x ∈ X (that is g and h agree on x). Deza and Frankl (J. Combin. Theory Ser. A 22 (1977) 352) proved that if S ⊆ Sn is intersecting then |S| ≤ (n - 1)!. This bound is met by taking S to be a coset of a stabiliser of a point. We show that these are the only largest intersecting sets of permutations.
Wavelet packets-based digital watermarking for image verification and authentication
Authors: Alexandre H. Paquet, Rabab K. Ward, Ioannis Pitas
Venue: Signal Processing (2003)

In this paper, we present a novel watermarking scheme to ensure the authenticity of digital images. Our authentication technique is able to detect malicious tampering of images even if they have been incidentally distorted by basic image processing operations. The image protection is achieved by the insertion of a secret author's identification key in the image wavelet coefficients by their selective quantization. Our system uses characteristics of the human visual system to maximize the embedding weights while keeping good perceptual transparency. We develop an image-dependent method to evaluate, in the wavelet domain, the optimal quantization step allowing the tamper proofing of the image. The nature of multiresolution discrete wavelet decomposition allows the spatial and frequency localization of image tampering. Experimental results are presented to demonstrate the capacity of our system to detect unauthorized modification of images, to show its robustness to image compression and high security levels and to compare it with publicly available image authentication software.
Sharing design perspectives through storytelling
Authors: Ana Cristina Bicharra Garcia, Carlos Eduardo Carretti, Inhaüma Neves Ferraz, Cristiana Bentes
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Design consists of analyzing scenarios and proposing artifacts, obeying the initial set of requirements that lead from initial to goal state. Finding or creating alternative solutions, analyzing them, and selecting the best one are expected steps in the designer&rsquo;s decision making process. Very often, not a sole designer, but a team of them is engaged in the design process, sharing their expertise and responsibility to achieve optimum projects. In a design team, most conflicts occur due to misunderstanding of one&rsquo;s assessment of specifications and contexts. Decision explanations play a key role in teamwork success. Designers are rational agents trained to follow rational methods. Acceptable justifications include value function, requirements, constraints, and criteria. Generally, explanations are delivered in a multimedia fashion, composed of text, graphics and gestures, to provide the audience the ability to perceive what was contextually imagined. The more spatial the reasoning is, the richer the explanation channel should be. This paper presents CineADD, a design explanation generation model based on cinema techniques such as animation, scripting, editing, and camera movements. The idea is to provide designers with a tool for describing the way their projects should be visually explained, as in a movie. Designers develop their projects in an active design document environment. Rationale is captured as a design model, so explanations can be generated instead of retrieved. The captured design model serves as a base to visually reconstruct design, giving emphasis and guidance by using movie storytelling techniques. CineADD was implemented for the domain of oil pipeline layout showing the feasibility of this approach. We expect CineADD to become a commodity attachable to any intelligent CAD system.
Using Eclipse to demonstrate positive static assurance of Java program concurrency design intent
Authors: Aaron Greenhouse, T. J. Halloran, William L. Scherlis
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Assuring and evolving concurrent programs requires understanding the concurrency-related design decisions used in their implementation. Source code often does not reveal these design decisions because they may not have purely local manifestations in the code, or because they cannot be inferred from code. As a result, this design intent is usually not expressed, and it is therefore generally infeasible to assure that concurrent programs are free of race conditions.We describe a prototype Eclipse-based tool developed as part of research toward a practicable approach to capturing and assuring design intent. Through the use of annotations and composable static analyses we can help assure consistency of code and intent as both evolve. The dominant design consideration for the tool is the principle of "early gratification"---some assurance can be obtained with minimal or no annotation effort, and additional increments of annotation or other effort are rewarded with additional increments of assurance.
Fuzzy Extensions for Reverse Engineering Repository Models
Authors: Ulrike Kölsch, René Witte
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Reverse Engineering is a process fraught with imperfections.The importance of dealing with non-precise, possiblyinconsistent data explicitly when interacting with the reverseengineer has been pointed out before.In this paper, we go one step further: we argue that thecomplete reverse engineering process must be augmentedwith a formal representation model capable of modelingimperfections. This includes automatic as well as human-centeredtools.We show how this can be achieved by merging a fuzzyset-theory based knowledge representation model with a reverseengineering repository. Our approach is not only capableof modeling a wide range of different kinds of imperfections(uncertain as well as vague information), butalso admits robust processing models by defining explicitdegrees of certainty and their modification through fuzzy beliefrevision operators.The repository-centered approch is proposed as the foundationfor a new generation of reverse engineering tools.We show how various RE tasks can benefit from our approachand state first design ideas for fuzzy reverse engineeringtools.
Dissecting Computer Fraud: From Definitional Issues to a Taxonomy
Authors: Lucian Vasiu, Ioana Vasiu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Computer frauds, while less dramatic than crimes of violence, can inflict significant damage at community, organizational or individual level. In order to properly quantify and mitigate the risk, computer frauds needs to be well understood.In this paper, in a conceptual-analytical researchapproach, we propose a dissection of computer fraud. First, we look into the elements of an offense, the act of fraud in general, than explain what is and what is not computer fraud. Next, from a prevention perspective, we propose a taxonomy of computer fraud with respect to perpetration platform, and to perpetration method.We believe that our contributions extend the existing knowledge of the phenomenon, and can assist those fighting computer fraud to better understand it and to design means of preventing and reporting it.
Using cognitive ability and personality to select information technology professionals
Authors: L. A. Witt, L. A. Burke
Venue: Advanced topics in end user computing (2003)

In order to achieve competitive advantage, 21st century organizations will make substantial investments in information technology (IT). Effective human resource practices in the IT field will therefore be critical. We investigated the applicability of general mental ability and personality test scores in predicting high-performing IT professionals. Data collected from 94 information technology employees in a service industry firm were compared with supervisory ratings along four orthogonal criteria; technical proficiency, relationship management skills, adherence to documentation standards and requirements, and self-initiated professional development. Results were partially supportive of the hypotheses and provide impetus for further work investigating applications of these tests to predict programmer performance in staffing and selection processes.
Radiation detection efficiency evaluation of YAP: CE scintillator by Monte-Carlo methods
Authors: D. Nikolopoulos, P. Liaparinos, S. Tsantis, D. Cavouras, I. Kandarakis, G. Panayiotakis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Monte Carlo techniques were applied to evaluate the performance of YAP scintillator for use in medical imaging applications. The energy range considered was from 50 to 800 keV and the thickness range from 5 to 30 mm. The absorption efficiency of YAP decreases rapidly in the energy range from 50 up to 200 keV. For higher energies up to 800 keV, slow variation with energy is exhibited. In the energy range 200-800 keV the scintillator absorbs energy mainly through Compton recoil electrons while at the 50-200 keV energy range the photoelectric process dominates even following a scatter event.
Reduced Complexity Wavelet-Based Predictive Coding of Hyperspectral Images for FPGA Implementation
Authors: Agnieszka C. Miguel, Amanda R. Askew, Alexander Chang, Scott Hauck, Richard E. Ladner, Eve A. Riskin
Venue: Proceedings of the Conference on Data Compression (2004)

We present an algorithm for lossy compression of hyperspectral images for imple-mentation on field programmable gate arrays (FPGA). To greatly reduce the bit raterequired to code images, we use linear prediction between the bands to exploit thelarge amount of inter-band correlation. The prediction residual is compressed usingthe Set Partitioning in Hierarchical Trees algorithm. To reduce the complexity of thepredictive encoder, we propose a bit plane-synchronized closed loop predictor that doesnot require full decompression of a previous band at the encoder. The new techniqueachieves almost the same compression ratio as standard closed loop predictive codingand has a simpler on-board implementation.
Colour monitor calibration based on CIE standards
Authors: Radu I. Campcanu, John D. McFall
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Colour monitors are widely used in today's computer systems. For many applications, such as those used in vision research, programs arc required to generate specific colours on the monitor. Unfortunately, monitors vary significantly in the colour characteristics of their phosphors and the amount of light emitted for a particular applied voltage. However, there exist reasonable models for characterizing the colour properties of monitors. Also, the International Commission of Light (CIE) has standardized on particular representations of colour to which display monitors can be calibrated.In this paper we report on experiments related to the task of reproducing colours, specified in CIE? terms, on the monitor. We evaluate a calibration method based on solving the colorimetric equation for each desired colour, which produces gun voltages by using a piccewise linear interpolation algorithm. The chromaticity of each phosphor is assumed to be constant as the applied voltage varies. A second model, which provides for chromaticities to vary with applied voltages is found to yield more accurate results than the first model. Systematically we study errors associated with the models and discuss possible origins of these errors, as related to the CRT monitor. A comparison of results for two similar CRT monitors is included.
User interface technologies and guidelines to support children's creativity, collaboration, and learning
Authors: Juan Pablo Hourcade
Venue:  (2003)

Computers are failing children. They are taking time away from meaningful interactions with people, and are often providing children with inappropriate experiences. In particular, they are failing to support children collaborating, being creative, using their imagination, and accessing appropriate content. To address these issues, I have created developmentally appropriate technologies that support children collaborating, creating, and learning. To support collaboration, I developed MID (Multiple Input Devices), a Java toolkit that supports advanced events, including those from multiple input devices. I used MID to develop KidPad, a collaborative storytelling tool that supports groups of children in the creation of drawings and stories. To support collaboration in a concrete, developmentally appropriate manner, KidPad uses the local tools user interface metaphor in which I implemented several improvements to make efficient use of screen space and to encourage collaboration. SearchKids is an application that also supports collaboration and gives children the ability to search and browse a multimedia animal library. The International Children's Digital Library uses a similar user interface to enable children to search and browse an international collection of digitized children's books. Both applications offer children access to curated collections, shielding them from inappropriate content while keeping them in control of what to experience. While building these technologies I observed that young children had greater difficulty using input devices. This affected their ability to collaborate, be creative and access valuable content. Motivated by such observations, I conducted a study to gain a better understanding of how young children use mice as compared to adults. The results provide guidelines for the sizing of visual targets in young children's software and insight into how children use mice.
The MarCon algorithm: A systematic market approach to distributed constraint problems
Authors: H. Van Dyke Parunak, Allen C. Ward, John A. Sauter
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

MarCon (Market-based Constraints) applies market-based control to distributed constraint problems. It offers a new approach to distributing constraint problems that avoids challenges faced by current approaches in some problem domains, and it provides a systematic method for applying markets to a wide array of problems. Constraint agents interact with one another via the variable agents in which they have a common interest, using expressions of their preferences over sets of assignments. Each variable integrates this information from the constraints interested in it and provides feedback that enables the constraints to shrink their sets of assignments until they converge on a solution. MarCon originated in a system for supporting human product designers, and its mechanisms are particularly useful for applications integrating human and machine intelligence to explore implicit constraints. MarCon has been tested in the domain of mechanical design, in which its set-narrowing process is particularly useful.
Partitioning Large Data to Scale up Lattice-Based Algorithm
Authors: Huaiguo Fu, Engelbert Mephu Nguifo
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Concept lattice is an effective tool and platform for data analysis and knowledge discovery such as classi.cation or association rules mining. The lattice algorithm to build formal concepts and concept lattice plays an essential role in the application of concept lattice. We propose a new efficient scalable lattice-based algorithm: ScalingNextClosure to decompose the search space of any huge data in some partitions, and then generate independently concepts (or closed itemsets) in each partition. The experimental results show the efficiency of this algorithm.
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
Authors: Günther R. Raidl, Bryant A. Julstrom
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 < D < n - 1, where n is the number of vertices in G. An existing greedy heuristic for the problem, called OTTC, is based on Prim's algorithm. OTTC usually yields poor results on instances in which the triangle inequality approximately holds; it always uses the lowest-weight edges that it can, but such edges do not in general connect the interior nodes of low-weight bounded-diameter trees. A new randomized greedy heuristic builds a bounded-diameter spanning tree from its center vertex or vertices. It chooses each next vertex at random but attaches the vertex with the lowest-weight eligible edge. This algorithm is faster than OTTC and yields substantially better solutions on Euclidean instances. An evolutionary algorithm encodes spanning trees as lists of their edges, augmented with their center vertices. It applies operators that maintain the diameter bound and always generate valid offspring trees. These operators are efficient, so the algorithm scales well to larger problem instances. On 25 Euclidean instances of up to 1000 vertices, the EA improved substantially on solutions found by the randomized greedy heuristic.
Embedding sparse matrix operations in SNOBOL4
Authors: Michael B. Feldman
Venue: ACM SIGPLAN Notices (1978)

We shall discuss in this paper how sparse matrix operations might be embedded in SNOBOL4, using the programmer-defined function capability, the TABLE datatype, and the APPLY built-in function which allows function names to be treated as variables.
The influence of load on the frequency response of rock bolt anchorage
Authors: Ana Ivanovic´, Andy Starkey, Richard D. Neilson, Albert A. Rodger
Venue: Advances in Engineering Software (2003)

A research programme into both the static and dynamic performance of ground anchorage systems, with an emphasis on resin bonded rock bolts, started at the University of Aberdeen in the early 1980s. The work involved measurements on active construction sites which was underpinned by laboratory and computer modelling and led to the development of a new method for the non-destructive testing of anchorages. Part of the research programme was focused on assessing how changes in the load influence the dynamic responses of an anchorage. This in turn produced a new testing method able to determine the variation in frequency response of the anchorage with changes in load. The development of a lumped parameter model able to simulate the response of anchorages to changes in static load and an applied impulse load was a further step forward in the research programme. The achievements of the lumped parameter model revealed the head of the anchorage to be the most influential component of the anchorage system in determining dynamic response. The results obtained from the numerical model when laboratory anchorages were simulated are shown to be in agreement with the results obtained from the actual laboratory tests. Based on the successful results obtained to date regarding laboratory rock bolt anchorages, a further step was made in order to employ the numerical model for the first time to observe the influence of load on the frequency response of rock bolt anchorages installed in the field. This paper describes the application of the model to such field anchorages and highlights some of the detailed modelling aspects required to replicate real anchorage behaviour.