ppxscal/embedding_network huggingface dataset:
A Neural Network Model for Image Change Detection Based on Fuzzy Cognitive Maps
Authors: Gonzalo Pajares, Alfonso Sánchez-Beato, Jesús M. Cruz, José J. Ruz
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper outlines a neural network model based on the Fuzzy Cognitive Maps (FCM) framework for solving the automatic image change detection problem. Each pixel in the reference image is assumed to be a node in the network. Each node has associated a fuzzy value, which determines the magnitude of the change. Each fuzzy value is updated by a trade-off between the influences received from the fuzzy values from other neurons and its own fuzzy value. Classical approaches in the literature have been designed assuming that the mutual influences between two nodes are symmetric. The main finding of this paper is the assumption that mutual influences could not be symmetric. This non symmetric relationship can be embedded by the FCM paradigm. The performance of the proposed method is illustrated by comparative analysis against some recent image change detection methods.
Designing and Evaluating Meeting Assistants, Keeping Humans in Mind
Authors: Patrick Ehlen, Raquel Fernandez, Matthew Frampton
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

Meeting assistants pose some interesting and unique challenges to the enterprise of software design and evaluation. As the technology reaches greater levels of development, we must begin to consider methods of evaluation that reach beyond regarding meeting browsers as signal replay and information search tools, and begin to assess the dimensions in which meeting assistants and browsers can augment or hinder human cognition and interaction. Some of these dimensions are considered, inasmuch as they were encountered during development of the DARPA CALO Meeting Assistant and Meeting Browser.
Lightweight Coding of Structurally Varying Dialogs
Authors: Michael Dunlavey
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

A non-language-specific technique is given for programming of user interface (UI) dialogs. It allows the model (application data) to be pure (containing no UI-specific code). It requires no writing of callbacks or event handler functions. It allows editing of arbitrary data structures, with dynamic structural variation. This is achieved with a paradigm in which the UI specification code need not overtly name or store objects. Object management is performed automatically, facilitated by an incremental control structure. Volume of source code is reduced by about an order of magnitude compared to common UI toolkits. It has been implemented several times and used extensively in industry.
Adjusting a Knowledge-Based Algorithm for Multi-agent Communication for CPS
Authors: Egon Baars, Rineke Verbrugge
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

Using a knowledge-based approach we adjust a knowledge-based algorithm for multi-agent communication for the process of cooperative problem solving (CPS). The knowledge-based algorithm for multi-agent communication [1] solves the sequence transmission problem from one agent to a group of agents, but does not fully comply with the dialogue communication. The number of messages being communicated during one-on-one communication between the initiator and each other agent from the group can differ. Furthermore the CPS process can require the communication algorithm to handle changes of initiator. We show the adjustments that have to be made to the knowledge-based algorithm for multi-agent communication for it to handle these properties of CPS. For the adjustments of this new multi-agent communication algorithm it is shown that the gaining of knowledge required for a successful CPS process is still guaranteed.
Traffic Aggregation for Malware Detection
Authors: Ting-Fang Yen, Michael K. Reiter
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

Stealthy malware, such as botnets and spyware, are hard to detect because their activities are subtle and do not disrupt the network, in contrast to DoS attacks and aggressive worms. Stealthy malware, however, does communicate to exfiltrate data to the attacker, to receive the attacker's commands, or to carry out those commands. Moreover, since malware rarely infiltrates only a single host in a large enterprise, these communications should emerge from multiple hosts within coarse temporal proximity to one another. In this paper, we describe a system called T¿md (pronounced "tamed") with which an enterprise can identify candidate groups of infected computers within its network. T¿md accomplishes this by finding new communication "aggregates" involving multiple internal hosts, i.e., communication flows that share common characteristics. We describe characteristics for defining aggregates--including flows that communicate with the same external network, that share similar payload, and/or that involve internal hosts with similar software platforms--and justify their use in finding infected hosts. We also detail efficient algorithms employed by T¿md for identifying such aggregates, and demonstrate a particular configuration of T¿md that identifies new infections for multiple bot and spyware examples, within traces of traffic recorded at the edge of a university network. This is achieved even when the number of infected hosts comprise only about 0.0097% of all internal hosts in the network.
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
Authors: Christian Hundt, Maciej Liśkiewicz
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Image matching is an important problem in image processing and arises in such diverse fields as video compression, optical character recognition, medical imaging, watermarking etc. Given two images, image matching determines a transformation that changes the first image such that it most closely resembles the second. Common approaches require either exponential time, or find only an approximate solution, even when only rotations and scalings are allowed. This paper provides the first general polynomial time algorithm to find the exact solution to the image matching problem under projective, affine or linear transformations. Subsequently, nontrivial lower bounds on the number of different transformed images are given which roughly induce the complexity of image matching under the three classes of transformations.
Improved Results on Solving Quadratic Programming Problems with Delayed Neural Network
Authors: Minghui Jiang, Shengle Fang, Yi Shen, Xiaoxin Liao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, in terms of a linear matrix inequality (LMI), using a delayed Lagrangian network to solve quadratic programming problems, sufficient conditions on delay-dependent and delay-independent are given to guarantee the globally exponential stability of the delayed neural network at the optimal solution. In addition, exponential convergence rate is estimated by the equation in the paper. Furthermore, the results in this paper improved the ones reported in the existing literatures and the proposed sufficient condition can be checked easily by solving LMI. Two simulation examples are provided to show the effectiveness of the approach and applicability of the proposed criteria.
Reconciling Axiomatic and Model-Based Specifications Reprised
Authors: Ken Robinson
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

This paper is a reprise of a paper presented at ZB2000 that attempted to reconcile the worlds of model-based and axiomatic specification. The new paper uses the same problem, but treats it very differently in Event B. The development also serves as a short tutorial example in Event B.
Validation of a Digital Mammography Image Simulation Chain with Automated Scoring of CDMAM Images
Authors: Mary Yip, Abdulaziz Alsager, Emma Lewis, Kevin Wells, Kenneth C. Young
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

A wide variety of digital mammography systems are available for breast cancer imaging, each varying in physical performance. However, the relationship between physical performance assessment and clinical outcome is not clear. Thus, a means of simulating technically and clinically realistic images from different systems would represent a first step towards elucidating the impact of physical performance on clinical outcome. To this end, a framework for simulating technically realistic images has been developed. A range of simulated test objects, including CDMAM have been used to determine whether the simulation chain correctly reproduces these objects thus validating the simulation framework. Results evaluated for two digital mammography systems have been promising, with simulated images proving similar to experimental images for Modulation Transfer Function and Normalised Noise Power Spectrum measurements differing by approximately 3%.
A Framework for Designing Embedded Real-Time Controllers
Authors: Yifan Wu, Enrico Bini, Giorgio Buttazzo
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Control systems are typically designed assuming an ideal behavior of the computing infrastructure where controllers execute. In practice, however, in highly loaded computing systems consisting of multiple concurrent controllers, resource constraints may introduce delays and jitter in control loops that may degrade control performance significantly. Hence, taking resource constraints into account since the beginning of the design cycle is crucial for optimizing the performance of a control system. In this paper, we propose a general framework for evaluating the performance of a control system as a function of multiple timing attributes (e.g., sampling frequencies, delays and jitter) and for selecting the proper control task parameters (e.g., periods and deadlines) taking resource constraints into account. The proposed framework is illustrated using a real control plant.
Multi-agent Coordination Schemas in Decentralized Production Systems
Authors: Gang Li, Yongqiang Li, Linyan Sun, Ping Ji
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Decentralized production systems are considered organizational structures able to match agility and efficiency which are necessary to compete in the global market. One of the challenges faced by the decentralized production systems is to ensure the coordination of heterogenuous decisions of the multi-agent populated production system. In the decentralized production system, the double marginalization makes the upstream agents conservative to build the system optimal capacity. This further makes the system falling into inefficiency. To overcome the system inefficiency, this paper proposes the cost-revenue sharing schema and the transfer-payment schema. These schemas are self-enforcing, which coordinate the capacity decision in the production systems, and allow the system profit to be maximized as well as the agents' profits to be improved.
Investigating the effects of fine-grain three-dimensional integration on microarchitecture design
Authors: Yuchun Ma, Yongxiang Liu, Eren Kursun, Glenn Reinman, Jason Cong
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

In this article we propose techniques that enable efficient exploration of the 3D design space, where each logical block can span more than one silicon layer. Fine-grain 3D integration provides reduced intrablock wire delay as well as improved power consumption. However, the corresponding power and performance advantage is usually underutilized, since various implementations of multilayer blocks require novel physical design and microarchitecture infrastructure to explore 3D microarchitecture design space. We develop a cubic packing engine which can simultaneously optimize physical and architectural design for efficient vertical integration. This technique selects the individual unit designs from a set of single-layer or multilayer implementations to get the best microarchitectural design in terms of performance, temperature, or both. Our experimental results using a design driver of a high-performance superscalar processor show a 36&percnt; performance improvement over traditional 2D for 2--4 layers and 14&percnt; over 3D with single-layer unit implementations. Since thermal characteristics of 3D integrated circuits are among the main challenges, thermal-aware floorplanning and thermal via insertion techniques are employed to keep the peak temperatures below threshold.
New results for global stability of Cohen-Grossberg neural networks with multiple time delays
Authors: Zeynep Orman, Sabri Arik
Venue: Neurocomputing (2008)

This paper studies the global convergence properties of Cohen-Grossberg neural networks with multiple time delays. Without assuming the symmetry of interconnection weight coefficients, and the differentiability and boundedness of activation functions, and by employing Lyapunov functionals, we derive new delay independent sufficient conditions under which a delayed Cohen-Grossberg neural network converges to a unique and globally asymptotically stable equilibrium point. Several examples are given to illustrate the advantages of our results over the previously reported results in the literature.
Investigation and Reduction of Fault Sensitivity in the FlexRay Communication Controller Registers
Authors: Yasser Sedaghat, Seyed Ghassem Miremadi
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

It is now widely believed that FlexRay communication protocol will become the de-facto standard for distributed safety-critical automotive systems. In this paper, the fault sensitivity of the FlexRay communication controller registers are investigated using transient single bit-flip fault injection. To do this, a FlexRay bus network, composed of four nodes, was modeled. A total of 135,600 transient single bit-flip faults were injected to all 408 accessible single-bit and multiple-bit registers of the communication controller in one node. The results showed that among all 408 accessible registers, 30 registers were immediately affected by the injected faults. The results also showed that 26.2% of injected faults caused at least one error. Based on the fault injection results, the TMR and the Hamming code techniques were applied to the most sensitive parts of the FlexRay protocol. These techniques reduced the fault affection to the registers from 26.2% to 10.3% with only 13% hardware overhead.
Decreasing Neighborhood Revisited in Self-Organizing Maps
Authors: Antonio Neme, Elizabeth Chavez, Alejandra Cervera, Victor Mireles
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Decreasing neighborhood has been identified as a necessary condition for self-organization to hold in the self-organizing map (SOM). In the SOM, each best matching unit (BMU) decreases its influence area as a function of time and this area is always radial. Here, we present a model in which the BMU does not reduce its neighborhood, but the rest of the neurons exclude some BMUs from affecting them. In this model, what decreases as a function of time is the number of BMUs that affect each neuron, not the neighborhood of the BMUs. Each neuron identifies, from the set of BMUs that influenced it during each epoch, the farthest one and becomes refractory to it for the rest of the process. This BMU exclusion is not equivalent to the original decreasing neighborhood scheme. Even though the decreasing neighborhood condition is not totally maintained, self-organization remains, as shown by several experiments.
Attributions of Human-Avatar Relationship Closeness in a Virtual Community
Authors: Yi Zhao, Weiquan Wang
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

As avatars have become increasingly used in virtual communities (VCs) to provide users with a more natural and favorable online experience, promoting a close human-avatar relationship has been a necessity to the sustainable development of VCs. In this study, we intend to explore users' attributions of human-avatar relationship closeness in VCs. We conceptualize human-avatar relationship closeness as composed of activity diversity, interaction frequency, and relational influence, and identify its antecedents (i.e., perceived needs fulfillment, irreplaceableness, resource investment) by extending theories in an interpersonal domain into a human-artifact interaction domain. The hypothesized model is empirically tested through an online survey in the specific context of Second Life (SL), a popular virtual community (VC), and we find that people's perceived needs fulfillment has positive effects on relational influence, perceived relationship irreplaceableness has positive effects on activity diversity and relational influence, while perceived resource investment positively associates with all three dimensions of human-avatar relationship closeness.
EAR: An Energy-Aware Block Reallocation Framework for Energy Efficiency
Authors: Woo Hyun Ahn
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

File systems, which are embedded in low-power computer systems, have continuously improved energy saving features. However, the inevitable aging of the file system gives disks less chances to stay idle, thus increasing the energy consumption along with the decrease in performance. As a solution to the problem, we propose the energy-aware block reallocation framework (EAR), which is a software framework with a reallocation algorithm applicable to file systems. EAR dynamically reallocates fragmented data with the same relationship to disk locations where less disk accesses and seeks are achieved. The optimized file data layout improves the energy saving on aged disks.
Computationally Efficient Quantitative Testing of Image Segmentation with a Genetic Algorithm
Authors: H. Al-Muhairi, M. Fleury, A. F. Clark
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Quantitative testing of segmentation algorithms implies rigorous testing against ground truth segmentations. Though under-reported in the literature, the performance of a segmentation algorithm depends on the choice of input parameters. The paper reports wide variety both in evaluation time and segmentation results for an example mean-shift algorithm. When testing extends over an algorithm’s parameter space, then the search for satisfactory settings has a considerable cost in time. This paper considers the use of a genetic algorithm (GA) to avoid an exhaustive search. As application of the GA drastically reduces search times, the paper investigates how best to apply the GA in terms of initial candidate population, convergence speed, and application of a final polishing round. The GA parameter search forms part of a three-component computation environment aimed at automating the search and reducing the evaluation time. The first component relies on scripted testing and collation of results. The second component transfers to a commodity cluster computer. And the third component applies a genetic algorithm to avoid an exhaustive search.
Prototypes for Medical Case-Based Applications
Authors: Rainer Schmidt, Tina Waligora, Olga Vorobieva
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

Already in the early stages of Case-Based Reasoning prototypes were considered as an interesting technique to structure the case base and to fill the knowledge gap between single cases and general knowledge. Unfortunately, later on prototypes never became a hot topic within the CBR community. However, for medical applications they have been used rather regularly, because they correspond to the reasoning of doctors in a natural way. In this paper, we illustrate the role of prototypes by application programs, which cover all typical medical tasks: diagnosis, therapy, and course analysis.
Topic 12: Theory and Algorithms for Parallel Computation
Authors: Geppino Pucci, Coromoto Leon, Ioannis Caragiannis, Kieran T. Herley
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Parallelism permeates all levels of current computing systems, from single CPU machines to large server farms. Effective use of parallelism relies crucially on the availability of suitable models of computation for algorithm design and analysis, and of efficient strategies for the solution of key computational problems on prominent classes of platforms, as well as of good models of the way the different components are interconnected. With the advent of multicore parallel machines, new models and paradigms are needed to allow parallel programming to advance into mainstream computing. Topic 12 focuses on contibutions providing new results on foundational issues of parallelism in computing and/or proposing improved approaches for the solution of specific algorithmic problems.
Extension of a Polynomial Time Mehrotra-Type Predictor-Corrector Safeguarded Algorithm to Monotone Linear Complementarity Problems
Authors: Mingwang Zhang, Yanli Lv
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Mehrotra-type predictor-corrector algorithms are the basis of interior point methods software packages. Salahi et al. in their recent work have shown a feasible version of a variation of Mehrotra's second order algorithm for linear optimization may be forced to make many small steps that motivated them to introduce certain safeguards, what allowed them to prove polynomial iteration complexity while keeping its practice efficiency. In this paper, we extend their algorithm to monotone linear complementarity problems. Our algorithm is different from their method in the way of updating the barrier parameter and the complexity analysis, and we also show that the polynomial complexity of our algorithm is $\emph{O}\left(n^{2}\log\frac{(x^{0})^{T}s^{0}}{\varepsilon}\right)$.