ppxscal/embedding_network huggingface dataset:
Retrieving reusable components with variation points from software product lines
Authors: Shih-Chien Chou, Yuan-Chien Chen
Venue: Information Processing Letters (2006)

Reusing software through software product lines has been recognized as useful. To improve reuse efficiency, retrieving proper systems or subsystems from software product lines for reuse is an important issue. This paper proposes a technique to retrieve reusable software systems/subsystems from software product lines.
Stereo Matching with Symmetric Cost Functions
Authors: Kuk-Jin Yoon, In So Kweon
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various techniques. However, most global methods mainly focus on how to minimize conventional cost functions efficiently, although it is more important to define cost functions well to improve performance. In this paper, we propose new symmetric cost functions for global stereo methods. We first present a symmetric data cost function for the likelihood and then propose a symmetric discontinuity cost function for the prior in the MRF model for stereo. In defining cost function, both the reference image and the target image are taken into account to improve performance without modeling half-occluded pixels explicitly and without using color segmentation. The performance improvement of stereo matching due to the proposed symmetric cost functions is verified by applying the proposed symmetric cost functions to the belief propagation (BP) based stereo method. Experimental results for standard testbed images show that the performance of the BP based stereo method is greatly improved by the proposed symmetric cost functions.
Catching spam before it arrives: domain specific dynamic blacklists
Authors: Duncan Cook, Jacky Hartnett, Kevin Manderson, Joel Scanlan
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

The arrival of any piece of unsolicited and unwanted email (spam) into a user's email inbox is a problem. It results in real costs to organisations and possibly an increasing reluctance to use email by some users. Currently most spam prevention techniques rely on methods that examine the whole email message at the mail server. This paper describes research that aims to deny spam entry into the internal network in the first place.Examination of live amalgamated audit logs from a Linux kernel firewall, the PortSentry intrusion detection system and the Sendmail mail transfer agents has shown that it is possible that automated mailing programs send characteristic probes to the network gateway just before launching an avalanche of mail. Similarly it seems possible to detect precursor activity from some potential zombie machines. A real time system that could detect such activity needs to be certain that a particular IP address is about to send spam before blocking all of its packets at the network gateway. The architecture for a system that establishes certainty that a particular IP address is about to or has started sending spam is described in this paper. The eventual aim is to recognise precursor activity from spammers in real time, establish certainty that this IP address is about to send or is currently sending spam packets and to then deny packets from this IP address at a range of communicating gateways
Automation of clock distribution network design for digital integrated circuits using divide and conquer technique
Authors: Anu Gupta, Bipin Kulkarni
Venue: Integration, the VLSI Journal (2006)

One of the most carefully engineered components of a digital integrated circuit is the clock distribution network. A clock is unarguably the most important signal and the network used for its distribution contributes to nearly half of the entire power dissipated by the IC. The design of a clock distribution network requires tremendous resources in terms of time and effort to achieve optimized results. This paper discusses the development of a new algorithm with smaller time complexity for automation of the design of clock distribution network that can greatly reduce the time and effort required, at the same time meeting the conditions set for delays and maximum allowable power dissipation.
Non-rigid Image Registration Using Geometric Features and Local Salient Region Features
Authors: Jinzhong Yang, Rick S. Blum, James P. Williams, Yiyong Sun, Chenyang Xu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present a novel feature-based non-rigid image registration algorithm using a small number of automatically extracted points and their associated local salient region features. Our automatic registration is a hybrid approach co-optimizing point-based and image-based terms. Motivated by the paradigm of the TPS-RPM algorithm [6], we develop the RHDM (Robust Hybrid Deformable Matching) algorithm by alternatively optimizing correspondences and transformations for registration. The local salient region features and the geometric features, together with the softassign and deterministic annealing techniques, are used for solving correspondences. Thin-plate splines are used for generating a smooth non-rigid spatial transformation. Our algorithm is built to be extremely robust to feature extraction errors. A new dynamic outlier rejection mechanism is described for rejecting outliers and generating accurate spatial mappings. A local refinement technique is used for correcting non-exactly matched correspondences arising from image noise and irregular deformations. In contrast with the TPS-RPM algorithm, which can handle only outliers in one point set, our algorithm is able to handle a considerable number of outliers in both point sets. The experimental results demonstrate the robustness and accuracy of our algorithm.
An Intelligent and Cooperative Information System for the Dynamic Management of E-government Services in Inter-administration
Authors: Guo-wei Gao, Yan-zhang Wang, Ning Wang, Huai-ming Li, Du-juan Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Public service management is essentially about inter-administration cooperation in a competitive, continuously changing environment, which occurs frequently in the provision of service chain. The paper presents an inter-administration cooperation model and intelligent and cooperative information system which makes public service management efficient. It aims at studying the exploitation of multi-agent for supporting the dynamic management of E-government services in inter-administration. To improve the agent's capability of intelligence and cooperation in which the system can be effective, an approach for knowledge representation based on government ontology is adopted.
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Authors: Mark Goadrich, Louis Oliphant, Jude Shavlik
Venue: Machine Learning (2006)

Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall instead of simply using accuracy. The goal of our research is to find new approaches within ILP particularly suited for large, highly-skewed domains. We propose Gleaner, a randomized search method that collects good clauses from a broad spectrum of points along the recall dimension in recall-precision curves and employs an "at least L of these K clauses" thresholding method to combine sets of selected clauses. Our research focuses on Multi-Slot Information Extraction (IE), a task that typically involves many more negative examples than positive examples. We formulate this problem into a relational domain, using two large testbeds involving the extraction of important relations from the abstracts of biomedical journal articles. We compare Gleaner to ensembles of standard theories learned by Aleph, finding that Gleaner produces comparable testset results in a fraction of the training time.
Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs
Authors: Maciej Ciesielski, Priyank Kalla, Serkan Askar
Venue: IEEE Transactions on Computers (2006)

A Taylor Expansion Diagram (TED) is a compact, word-level, canonical representation for data flow computations that can be expressed as multivariate polynomials. TEDs are based on a decomposition scheme using Taylor series expansion that allows one to model word-level signals as algebraic symbols. This power of abstraction, combined with the canonicity and compactness of TED, makes it applicable to equivalence verification of dataflow designs. The paper describes the theory of TEDs and proves their canonicity. It shows how to construct a TED from an HDL design specification and discusses the application of TEDs in proving the equivalence of such designs. Experiments were performed with a variety of designs to observe the potential and limitations of TEDs for dataflow design verification. Application of TEDs to algorithmic and behavioral verification is demonstrated.
Parietal Lobe Contribution to Mental Rotation Demonstrated with rTMS
Authors: Irina M. Harris, Carlo Miniussi
Venue: Journal of Cognitive Neuroscience (2003)

A large number of imaging studies have identified a role for the posterior parietal lobe, in particular Brodmann's area 7 and the intraparietal sulcus (IPS), in mental rotation. Here we investigated whether neural activity in the posterior parietal lobe is essential for successful mental rotation performance by observing the effects of interrupting this activity during the execution of a mental rotation task. Repetitive transcranial magnetic stimulation (rTMS) was applied to posterior parietal locations estimated to overlie Brodmann's area 7 in the right and the left hemisphere, or to a posterior midline location (sham condition). In three separate experiments, rTMS (four pulses, 20 Hz) was delivered at these locations either 200-400, 400-600, or 600-800 msec after the onset of a mental rotation trial. Disrupting neural activity in the right parietal lobe interfered with task performance, but only when rTMS was delivered 400 to 600 msec after stimulus onset. Stimulation of the left parietal lobe did not reliably affect mental rotation performance at any of the time points investigated. The time-limited effect of rTMS was replicated in a fourth experiment that directly compared the effects of rTMS applied to the right parietal lobe either 200-400 or 400-600 msec into the mental rotation trial. The results indicate that the right superior posterior parietal lobe plays an essential role in mental rotation, consistent with its involvement in a variety of visuospatial and visuomotor transformations.
Information order effects: examining the effect of sequencing and complexity in a long sequence of information
Authors: Leonard Adelman
Venue:  (2006)

This study tested if the theory of anchoring adjusting predicted the results for a long series of sequentially presented information when complexity, as defined by Hogarth Einhorn (1992), and sequencing of directional information were manipulated. Hogarth Einhorn's belief revision model predicted there would be a force towards primacy for a long evidence series, regardless of task variables because individuals anchor on early evidence and do not attend to recent information. This study tested two hypotheses. First, anchoring adjusting does not always result in primacy when complexity and sequencing were manipulated. Second, that complexity and sequencing significantly affect belief revision through a mediator, mental effort. Using Reserve Officer Training Corps Cadets, empirical evidence showed that the current belief revision model did not accurately predict a long series of sequentially presented information. Consistent with the first hypothesis, the interaction of the task variables order, complexity, and sequencing significantly impact belief revision and do not always result in a primacy effect for a long evidence series. In fact, when evidence was simple and grouped by direction, participants over adjusted to recent information resulting in a strong recency effect. When the evidence was grouped by direction and complex, participants did not over adjust to recent information resulting in a slight primacy effect. Additionally, when the information sequencing was mixed, there was a slight recency effect for simple evidence and no order effect for complex evidence. The mixed sequencing of evidence caused a reinterpretation of neutral information, which was designed not to favor a particular hypothesis. The data however did not support the second hypothesis. Complexity and sequencing did not affect belief revision through the predicted mediator, mental effort, but the study recommends future research focus on measuring the mediator at the individual level, rather than globally as Hogarth Einhorn's (1992) model assumes. This research found that anchoring adjusting best describes the cognitive process of belief updating when evidence was sequenced by direction, just not necessarily in the way predicted by Hogarth Einhorn. The study discussed engineering implications of designing systems to account for adjustment in a long evidence series. Additionally, the study recommended that future research focus more thoroughly on the task variables in a long evidence series and the effect that mixed sequencing had on the interpretation of neutral information.
A Self-Adapted Wavelet-Based Fuzzy Predictor of Network Traffic
Authors: Wenxuan Guo, Hanping Hu
Venue: Proceedings of the 15th International Conference on Computing (2006)

In this paper, we present a self-adapted fuzzy method to predict network traffic 1 . This method incorporates the traffic decomposition by wavelet transform as well as a fuzzy lookup scheme. In addition, a clustering method is designed to determine the parameters of membership functions of the fuzzy system. The experimental results show that our method can enhance the prediction accuracy.
Materialized Views in the Presence of Reporting Functions
Authors: Dirk Habich, Wolfgang Lehner, Michael Just
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Materialized views are a well-known optimization strategy with the potential for massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer has to know how and when to exploit materialized views. Reporting functions represent a novel technique to formulate sequence-oriented queries in SQL. They provide a column-wise ordering, partitioning, and windowing mechanism for aggregation functions and therefore extend the well-known way of grouping and applying simple aggregation functions. Up to now, current work has not considered the frequently used reporting functions in data warehouse environments. In this paper, we introduce materialized reporting function views and show how to rewrite queries with reporting functions as well as aggregation queries to this new kind of materialized views. We demonstrate the efficiency of our approach with a large number of experiments.
Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings
Authors: Jie Zhang, Robin Cohen
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In electronic marketplaces populated by self-interested agents, buyer agents would benefit by modeling the reputation of seller agents, in order to make effective decisions about which agents to trust. One method for representing reputation is to ask other agents in the system (called advisor agents) to provide ratings of the seller agents. The problem of unfair ratings exists in almost every reputation system, including both unfairly high and unfairly low ratings. We begin by surveying some existing approaches to this problem, characterizing their capabilities and categorizing them in terms of two main dimensions: public-private and global-local. The impact of reputation system architectures on approach selection is also discussed. Based on the study, we propose a novel personalized approach for effectively handling unfair ratings in an enhanced centralized reputation system. Experimental results demonstrate that the approach effectively adjusts the trustworthiness of advisor agents according to the percentages of unfair ratings provided by them. We then argue for the merits of our model as the basis for designing social networks to share reputation ratings of sellers in electronic marketplaces.
A Robotic Model (ROBI) of Autonomous Bicycle System
Authors: Himanshu Dutt Sharma, Umashankar N
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The authors have applied robotics based approach in formulating the generalized dynamic equations of motion of a bicycle system. The developed model is considerably more comprehensive than any of the existing models. The model formulation considers a bicycle system to be composed of three rigid bodies connected by revolute joints. The presented model facilitates study of various parameters of motion namely- lean, steer, angular speed, lean-rate, steer-rate, lean-torque, steer-torque, speed-torque, inertial forces, coriolis and centrifugal forces, gravity forces, kinetic energy, potential energy and total energy of various rigid body parts forming the system. The model equations are verified by simulation in MATLAB for the bicycle's behavior when running autonomously.
Visualizing coercible simulations
Authors: Joseph C. Carnahan, Paul F. Reynolds,  Jr., David C. Brogan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The labor intensive aspects of simulation development and maintenance make exploration of reuse essential. However, reuse is generally difficult to achieve in practice due to inflexible assumptions and changing requirements. This paper discusses a technology for simulation reuse called COERCE and the visualization tools that this technology requires. COERCE addresses techniques to make simulations more flexible (coercibility) and the process of transforming a simulation to meet new objectives (coercion). We address the following question: Given that COERCE is a semi-automated technology, what visualization capabilities are necessary to support it? We address this question empirically by studying the role of visualization in the construction of a new coercible simulation and in the coercion of an existing example simulation. Based on this study, we propose a set of requirements for any visualization toolkit meant to support COERCE.
Simulation experiment for improving construction processes
Authors: Shihyi Wang, Daniel W. Halpin
Venue: Proceedings of the 36th conference on Winter simulation (2004)

From the perspective of flow analysis, the more complex the project, the more wastes are prone to build up, due to the increasing number of interfaces between activities. When processes are further expanded beyond the jobsite to the scale of a supply chain, the complexity is usually beyond human perception. In order to provide a systematic approach to help management make correct and timely decisions, an analytical approach capable of efficiently and economically modeling the complicated processes and to address various managerial questions is necessary.An analytical framework combining simulation, design of experiment, regression analysis, and mathematical programming is proposed to facilitate management to determine the optimal design for a construction process under various constraints. A simplified concrete delivery process is used as an example to illustrate how the framework is implemented. Some implementation issues and other potential applications will be discussed.
A component-level path-based simulation approach for efficient analysis of large Markov models
Authors: Vinh V. Lam, Peter Buchholz, William H. Sanders
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Markov models are used in many industrial applications, but, for very large models, simulation is often currently the only viable evaluation technique. However, simulation techniques that are based on evaluating trajectories at the level of individual states and transitions can be inefficient because they have to keep track of many details. Moreover, since they use statistical methods, estimating solutions at higher confidence intervals requires the evaluation of an increasingly large number of trajectories which often leads to poor performance. On the other hand, analytical path-based techniques can be used for computing guaranteed bounds on the true solutions, but they can have poor performance because they must evaluate many paths to obtain reasonable bounds. In this paper, we present a path-based simulation approach for evaluating models at the component, rather than individual state/transition, level. At this level of abstraction, the approach can compute more accurate solutions than traditional discrete-event simulation techniques can in a given amount of time. In addition to presenting the approach, we compare its performance and effectiveness against a path-based analytic technique.
Top-Down Motif Discovery in Biological Sequence Datasets by Genetic Algorithm
Authors: Ulas Baran BALOGLU, Mehmet KAYA
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This paper presents a novel approach for motif discovery. Finding motif in biosequences is the most important primitive operation in computational biology. There are many computational requirements for a motif discovery algorithm such as computer memory space requirement and computational complexity. To overcome the complexity of motif discovery, we propose an alternative solution integrating genetic algorithm and top-down data mining approaches for eliminating multiple sequence alignment process. The experimental results demonstrate that the proposed method outperforms two well-known motif discovery algorithms, called MEME and Gibbs Sampler.
Lieb-Thirring and Bargmann-type inequalities for circular arc
Authors: Leonid Golinskii
Venue: Journal of Approximation Theory (2006)

For measures on the unit circle with convergent Verblunsky coefficients we find relations in form of inequalities between these coefficients and the distances from mass points to the essential support of the measure.