ppxscal/embedding_network huggingface dataset:
A BDD-Based Approach to Verifying Clone-Enabled Feature Models' Constraints and Customization
Authors: Wei Zhang, Hua Yan, Haiyan Zhao, Zhi Jin
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

In this paper, we present a kind of semantics for constraints in clone-enabled feature models, which resolves the problem of what kinds of constraint should be added to a feature model after some features are cloned. The semantics is composed of two patterns: the generating pattern and the adapting pattern, to address the two problems of what kind of constraints should be imposed on a clonable feature and its clones, and how an existing constraint should be transformed in the context that features involved in the constraint are cloned, respectively. After that, we propose a BDD-based approach to verifying clone-enabled feature models, an approach that makes efficient use of the BDD (binary decision diagram) data structures, by considering the specific characteristics of feature models' verification. Experiments show that this BDD-based approach is more efficient and can verify more complex feature models than our previous method.
A Novel and More Efficient Search Strategy of Quantum-Behaved Particle Swarm Optimization
Authors: Jun Sun, Choi H. Lai, Wenbo Xu, Zhilei Chai
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Based on the previous proposed Quantum-behaved Particle Swarm Optimization (QPSO), in this paper, a novel and more efficient search strategy with a selection operation is introduced into QPSO to improve the search ability of QPSO. While the center of position distribution of each particle in QPSO is determined by global best position and personal best position, in the Modified QPSO (MQPSO), the global best position is substituted by a personal best position of a randomly selected particle. The MQPSO also maintains the mean best position of the swarm as in the previous QPSO to make the swarm more efficient in global search. The experiment results on benchmark functions show that MQPSO has stronger global search ability than QPSO and PSO.
Making Computer Programming Fun and Accessible
Authors: Qusay H. Mahmoud, Wlodek Dobosiewicz, David Swayne
Venue: Computer (2004)

An introductory course's use of JavaScript provides an environment in which students can excel.
Relevance Optimization in Image Database Using Feature Space Preference Mapping and Particle Swarm Optimization
Authors: Mayuko Okayama, Nozomi Oka, Keisuke Kameyama
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Two methods for retrieval relevance optimization using the user's feedback is proposed for a content-based image retrieval (CBIR) system. First, the feature space used in database image clustering for coarse classification is transferred to a preference feature space according to the user's feedback by a map generated by supervised training, thereby enabling to collect user-preferred images in the matching candidates. Second, the parameters in the fine-matching relaxation operation is optimized according to the user's evaluation of the retrieved image ranking using Particle Swarm Optimization. In the experiments, it is shown that the retrieval rankings are improved suiting the user's preference when feature space mapping and parameter optimization are used.
Re-traffic Pricing for Fighting against DDoS
Authors: Yue-Yun Shen, Feng-Qin Fan, Wen-Xiu Xie, Lu-Feng Mo
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Our proposed design, which we refer to as Re-Traffic Pricing (RTP), aims to defense against application-level distributed denial-of-service (App-DDoS) attacks which is a rapidly growing problem. RTP prevents the server form overloading and encourages all the users to spend re-traffic which the legitimate users are assumed to have more of than the attackers to bid for the service resources. We apply the re-traffic which we define as the bandwidth uploaded after encouragement to the server as the constrained resource in this paper. The goal of RTP architecture is to allocate service resources in rough proportion to the users' re-traffic. On account of this mechanism, legitimate clients with greater re-traffic will receive the bulk of the service.
Set Partition Complexes
Authors: Alexander Engstr&#x00f6;m
Venue: Discrete Computational Geometry (2008)

The Hom complexes were introduced by Lov&#x00e1;sz to study topological obstructions to graph colorings. The vertices of *Hom*(G,K n ) are the n-colorings of the graph G, and a graph coloring is a partition of the vertex set into independent sets. Replacing the independence condition with any hereditary condition defines a set partition complex. We show how coloring questions arising from, for example, Ramsey theory can be formulated with set partition complexes. It was conjectured by Babson and Kozlov, and proved by &#x010c;uki&#x0107; and Kozlov, that *Hom*(G,K n ) is (n&#x2212;d&#x2212;2)-connected, where d is the maximal degree of a vertex of&#x00a0;G. We generalize this to set partition complexes.
New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach
Authors: Meriem Ennigrou, Khaled Ghédira
Venue: Autonomous Agents and Multi-Agent Systems (2008)

The Flexible Job Shop problem is among the hardest scheduling problems. It is a generalization of the classical Job Shop problem in that each operation can be processed by a set of resources and has a processing time depending on the resource used. The objective is to assign and to sequence the operations on the resources so that they are processed in the smallest time. In our previous work, we have proposed two Multi-Agent approaches based on the Tabu Search (TS) meta-heuristic. Depending on the location of the optimisation core in the system, we have distinguished between the global optimisation approach where the TS has a global view on the system and the local optimisation approach (FJS MATSLO) where the optimisation is distributed among a collection of agents, each of them has its own local view. In this paper, firstly, we propose new diversification techniques for the second approach in order to get better results and secondly, we propose a new promising approach combining the two latter ones. Experimental results are also presented in this paper in order to evaluate these new techniques.
Progressive Ranking for Efficient Keyword Search over Relational Databases
Authors: Guoliang Li, Jianhua Feng, Feng Lin, Lizhu Zhou
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

The existing approaches of keyword search over relational databases usually first generate all possible results composed of relevant tuples and then sort them based on their individual ranks. These traditional methods are inefficient to identify the top-k answers with the highest ranks. This paper studies the problem of progressively identifying the top-k answers from the relational databases. The approach of progressively identifying the answers is very desirable as it generates the higher ranked results earlier thereby reducing the delay in responding to the user query. We have implemented our proposed method, and the experimental results show that our method outperforms existing state-of-the-art approaches and achieves much better search performance.
Towards Automating Simulation-Based Design Verification Using ILP
Authors: Kerstin Eder, Peter Flach, Hsiou-Wen Hsueh
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Increasing the productivity of simulation-based semiconductor design verification is one of the urgent challenges identified in the International Technology Roadmap for Semiconductors. The most difficult aspect is the generation of stimulus for functional coverage closure. This paper introduces a new Coverage-Directed test Generation (CDG) feedback loop which applies Inductive Logic Programming (ILP) to selected tests and coverage data to induce rules that can be used to automatically direct stimulus generation towards outstanding coverage. The case study documented in this paper shows a significant reduction of simulation time when ILP-based CDG is compared to random test generation. This is an exciting and promising new application area for ILP.
Driver Fatigue Detection by Fusing Multiple Cues
Authors: Rajinda Senaratne, David Hardy, Bill Vanderaa, Saman Halgamuge
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

A video-based driver fatigue detection system is presented. The system automatically locates the face in the first frame, and then tracks the eyes in subsequent frames. Four cues which characterises fatigue are used to determine the fatigue level. We used Support Vector Machines to estimate the percentage eye closure, which is the strongest cue. Improved results were achieved by using Support Vector Machines in comparison to Naive Bayes classifier. The performance was further improved by fusing all four cues using fuzzy rules.
The relationship of controllability between classical and fuzzy discrete-event systems
Authors: Junping Liu, Yongming Li
Venue: Information Sciences: an International Journal (2008)

We have known that the controllability of classical discrete-event systems has already been extended into fuzzy discrete-event systems. In this paper, firstly, we recall some related definitions and results of the controllability for classical and fuzzy discrete-event systems, respectively. Secondly, we are concerned with the relationship of the controllability between classical and fuzzy discrete-event systems. In particular, we show that there is an equivalence of the controllability between the two systems to some extent, some special proofs are also presented. Finally, we use this equivalence to extend some general controllability properties of classical discrete-event systems into fuzzy ones.
On the Behaviour of the TRSIM Model for Trust and Reputation
Authors: Alberto Caballero, Juan A. Botía, Antonio Gómez-Skarmeta
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

We study here the behaviour of a trust and reputation model for agents in P2P environment, where agents act as providers or consumers of resources. We present partial results of the refinement process of our model in order to identify the suitable structure, functions, and parameters to correctly manage trust and reputation. We show some experimental results comparing several alternatives to obtain the quality of the response given the requirements, and the increase of the satisfaction of the recommended response when it uses a right way to estimate trust and reputation values using stored information about similar tasks.
Patterns for documenting frameworks: customization
Authors: Ademar Aguiar, Gabriel David
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

Good design and implementation are necessary but not sufficient pre-requisites for the successful reuse of object-oriented frameworks. Although not always recognized, good documentation is crucial for effective framework reuse but comes with many issues. Writing good quality documentation for a framework is often hard, costly, and tiresome, especially when not aware of its key problems and the best ways to address them. This document presents two of a set of related patterns that describe proven solutions to help non-experts on solving recurrent problems of documenting object-oriented frameworks. The patterns here presented address the problems of describing the customization points of the framework and how such customization is supported, respectively the patterns "Customization Points" and "Design Internals".
A C++ Class for Rule-Base Objects
Authors: William J. Grenney
Venue: Scientific Programming (1992)

A C++ class, called Tripod, was created as a tool to assist with the development of rule-base decision support systems. The Tripod class contains data structures for the rule-base and member functions for operating on the data. The rule-base is defined by three ASCII files. These files are translated by a preprocessor into a single file that is located when a rule-base object is instantiated. The Tripod class was tested as part of a proto-type decision support system (DSS) for winter highway maintenance in the Intermountain West. The DSS is composed of two principal modules: the main program, called the wrapper, and a Tripod rule-base object. The wrapper is a procedural module that interfaces with remote sensors and an external meterological database. The rule-base contains the logic for advising an inexperienced user and for assisting with the decision making process.
Verifying Balanced Trees
Authors: Zohar Manna, Henny B. Sipma, Ting Zhang
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability comes at a price; balanced trees are more complex than their unbalanced counterparts both in terms of data structure themselves and related manipulation operations. In this paper we present a framework to model balanced trees in decidable first-order theories of term algebras with Presburger arithmetic. In this framework, a theory of term algebras (i.e., a theory of finite trees) is extended with Presburger arithmetic and with certain connecting functions that map terms (trees) to integers. Our framework is flexible in the sense that we can obtain a variety of decidable theories by tuning the connecting functions. By adding maximal path and minimal path functions, we obtain a theory of red-black trees in which the transition relation of tree self-balancing (rotation) operations is expressible. We then show how to reduce the verification problem of the red-black tree algorithm to constraint satisfiability problems in the extended theory.
A CMOS multi-band low noise amplifier using high-Q active inductors
Authors: Jenn-Tzer Yang, Yuan-Hao Lee, Ming-Jeui Wu, Yi-Yuan Huang, Yu-Min Mu
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

In this paper, a CMOS Multi-band LNA using High-Q active inductors load with a binary code band selector suitable for multi-standards wireless applications is proposed. Using an improved high-Q active inductor including two bits binary controlled code, the multi-band low noise amplifier operating at four different frequency bands is realized. The proposed amplifier is designed in TSMC 0.18-µm CMOS technology. Based on the simulation results, the amplifier can operate at 900MHz, 1.8GHz, 1.9GHz, and 2.4GHz with forward gain (S21) of 40.7dB, 35.9dB, 37.2dB, and 30.7dB, and the noise figure (NF) of 0.018dB, 0.006dB, 0.001dB, and 0.01dB, respectively. Furthermore, the power dissipation of this amplifier can retain constant at all operating frequency bands and consume around 10.53 mW from 1.8-V power supply.
Coordinated Collective Motion of Groups of Autonomous Mobile Robots with Directed Interconnected Topology
Authors: Hui Yu, Yongji Wang
Venue: Journal of Intelligent and Robotic Systems (2008)

Coordinated collective motion of groups of autonomous mobile robots is studied. A qualitative analysis for the collective dynamics of multiple autonomous robots with directed interconnected topology using nearest neighbor rules is given. A necessary and sufficient graphical condition is proposed to guarantee that the headings of all robots converge to the same heading. The graph having a globally reachable node plays a crucial role in convergence analysis. Furthermore, we show that the globally reachable node having no neighbors serves as a group leader as a special case
When cars start gossiping
Authors: Paolo Costa, Daniela Gavidia, Boris Koldehofe, Hugo Miranda, Mirco Musolesi, Oriana Riva
Venue: Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications (2008)

Vehicular ad hoc networks present challenging characteristics, such as very dynamic behavior and sparse connectivity, that need to be taken into account in designing adequate communication support. Gossip-based protocols have recently emerged as an effective approach to providing reliable and efficient communication in this domain. Nonetheless, despite the preliminary encouraging results, to the best of our knowledge, no previous work has systematically analyzed how gossip protocols are affected by the intrinsic characteristics of vehicular networks such as the very specific mobility patterns of vehicles, the relative abundance of memory and computational resources that vehicles offer, and the availability of geographical information through GPS receivers. In this paper, we aim at filling this gap by examining core requirements of vehicular network applications and analyzing the research challenges that gossip-based communication protocols need to address.
Analysis of Non-stationary Neurobiological Signals Using Empirical Mode Decomposition
Authors: Zareen Mehboob, Hujun Yin
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper describes the use of empirical mode decomposition and Hilbert transform for the analysis of non-stationary signal. The effectiveness of the method is shown on examples of both artificial signals and neurobiological recordings. The method can decompose a signal into data-driven intrinsic mode functions, which can be regarded as underlying oscillations contained in the signal. Then the Hilbert transform is used to extract instantaneous frequencies. Better time-frequency resolution can be obtained compared to the Fourier or wavelet transforms. Initial attempt has also been made on clustering decomposed and extracted signal components. The study suggests that using the instantaneous frequency as the matching criteria can reveal hidden features that may not be observable using features from other transformation methods.
Face Recognition Using Clustering Based Optimal Linear Discriminant Analysis
Authors: Wenxin Yang, Shuqin Rao, Jina Wang, Jian Yin, Jian Chen
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Recently, A. M. Martinez indicated that, the angle between the eigenvector corresponding to the largest eigenvalue of the inter-class covariance and the eigenvector corresponding to the largest eigenvalue of the intra-class covariance is more crucial to the performance of traditional linear discriminant methods, furthermore, if the two eigenvectors are parallel, the final results may be disputable. However, upon careful scrutiny on his assertion, we concluded that the angle between the two eigenvectors is less decisive to the performance, more over, the main drawback of traditional linear methods is the inter-class covariance cannot precisely reflect the discriminant information. Simply maximizing the inter-class covariance in the principle component space may induce the losing of adjacent class-pair's contribution. Therefore,we propose the Optimal Linear Discriminant Analysis(henceforth OLDA)method, which distributes equivalent authority for each class-pair by employing "discriminative power". Besides, we employ the gradient scheme to derive the feature vectors. Thirdly, to address the multimodal problem, the pre-clustering mechanism is adopted to ameliorate the nonlinear structure. We apply our method on a practical face database and a virtual database, the experimental results show the promise of our method.
Put: Language-Based Interactive Manipulation of Objects
Authors: Sharon Rose Clay, Jane Wilhelms
Venue: IEEE Computer Graphics and Applications (1996)

Describing a scene to a computer is an inherent task of computer graphics applications. Modeled scenes are typically built with direct placement techniques or specialized scripting languages. The scene description task could be greatly eased if natural language were an interactive control option. However, natural language understanding is notoriously difficult for computers. This difficulty is exacerbated in the case of computer graphics by the need for geometric output, not just "conceptual understanding" or high-level inferencing. General text-understanding techniques have not been successfully applied to scene generation. Typically, a few task-specific commands, such as "walk," are implemented as an ad-hoc collection of procedures. Our approach aims to separate the expressive power of fundamental natural concepts from the difficult task of text understanding. We are developing a 3D object placement system based on a combination of natural commands and interactive techniques. Guided by research in cognitive linguistics, we use basic spatial relationships--such as in, on, and at--and fundamental scene parameters--such as viewer location and object dimensionality--to identify regions of placement for objects in a scene. These natural commands can be used to quickly prototype a complex scene and constrain object placement.
Teaching sequential tasks with repetition through demonstration
Authors: Harini Veeraraghavan, Manuela Veloso
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

For robots to become prevalent in human environments, the robots need to be able to perform complex tasks often involving sequential repetition of actions. In this work, we present a demonstration-based approach to teach a robot generalized plans for performing sequential tasks with repetitions. We introduce action definitions through perception. Using the action definitions and the demonstration, the robot learns a task specific plan for tasks containing repetition of sub-sequences.
Conductive Inkjet-Printed Wireless Sensor Nodes on Flexible Low-Cost Paper-Based Substrates
Authors: Manos M. Tentzeris, L. Yang, A. Rida, R. Vyas, A. Traille, C. Kruessi
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

In this paper, inkjet-printed flexible antennas fabricated on paper substrates are introduced as a system-level solution for ultra-low-cost mass production of UHF Radio Frequency Identification (RFID) Tags and Wireless Sensor Nodes (WSN) in an approach that could be easily extended to other microwave and wireless applications. A compact inkjet-printed UHF "passive-RFID" antenna using the classic T-match approach and designed to match IC's complex impedance, is presented as a demonstrating prototype for this technology. In addition, the authors briefly touch up the state-of-the-art area of fully-integrated wireless sensor modules on paper and show the first ever 2D sensor integration with an RFID tag module on paper, as well as the possibility of a 3D multilayer paper-based RF/microwave structures.
Teaching with A Hierarchically Structured Digital Systems Laboratory
Authors: J. Grason
Venue: Computer (1975)

"Learning by doing" has been a strong tradition at Carnegie-Mellon University. In addition to the usual class discussion periods, students at CMU are asked to devote a considerable amount of time to project work, especialy including laboratory projects. Solving practical, applied problems that go beyond the range of classroom or laboratory exercises is an important component of students' education -that will better prepare them for both industrial and academic careers. This article describes a digital systems laboratory in the Electrical Engineering Department at CMU that implements such a learning-by-doing philosophy in the computer engineering area.