ppxscal/embedding_network huggingface dataset:
Automatic Evaluation of Intrusion Detection Systems
Authors: Frederic Massicotte, Francois Gagnon, Yvan Labiche, Lionel Briand, Mathieu Couture
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

An Intrusion Detection System (IDS) is a crucial element of a network security posture. Although there are many IDS products available, it is rather difficult to find information about their accuracy. Only a few organizations evaluate these products. Furthermore, the data used to test and evaluate these IDS is usually proprietary. Thus, the research community cannot easily evaluate the next generation of IDS. Toward this end, DARPA provided in 1998, 1999 and 2000 an Intrusion Detection Evaluation Data Set. However, no new data set has been released by DARPA since 2000, in part because of the cumbersomeness of the task. In this paper, we propose a strategy to address certain aspects of generating a publicly available documented data set for testing and evaluating intrusion detection systems. We also present a tool that automatically analyzes and evaluates IDS using our proposed data set.
On-line Aggregation and Filtering of Pattern-based Queries
Authors: Cedric du Mouza, Philippe Rigaux, Michel Scholl
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

We consider an environment where a subscription system continuously evaluates pattern-based requests over unbounded sequential data. We propose an extension of the traditional pattern-matching techniques for efficiently handling large sets of such continuous queries. This extension relies on the introduction of variables in patterns in order to augment their expressivity. Based on this extended class of parameterized queries, our main contributions are threefold. First, we define a refinement relation based on variable relaxation. Second, we use the semi-lattice structure of the set of parameterized patterns for patterns aggregation and filtering. We propose an on-line pattern aggregation algorithm so as to both reduce the cost of pattern-matching evaluation as well as to filter out sequences that cannot match any of the patterns in a subscription cluster. Finally we show, through analysis and experiments, that our technique reduces quite effectively the cost of the matching process.
Confessible Threshold Ring Signatures
Authors: Yu-Shian Chen, Chin-Laung Lei, Yun-Peng Chiu, Chun-Ying Huang
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

We present two threshold ring signature schemes with different properties. One focuses on the confessibility (or signer verifiability) and the denouncibility properties. The other focuses on the threshold-confessibility. Our schemes are built on generic ring signature schemes and can be easily adapted to most existing ring signature schemes. Based on the former works, we also construct a realization of our schemes as an example. We prove that our schemes are secure in the random oracle model.
Answering Queries in the Presence of XML Keys
Authors: Mehdi Essid, Omar Boucelma, Stéphane Bressan
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

As XML seems to become the preferred candidate language for the interchange of data on the Internet, the integration of distributed, heterogeneous, and autonomous XML data sources in a mediation architecture is becoming a critical issue. In this paper, We present a novel and original query rewriting algorithm for the answering of queries to XML disparate sources in the presence of XML keys. The algorithm combines features of the MiniCon (Mini- Con descriptions) and the Styx algorithms (prefix and suffix queries) into an algorithm that returns more rewritings.
Experimental and numerical investigation of effect of particle size on particle distribution in particulate metal matrix composites
Authors: Mahmut D. Mat, Kemal Aldas
Venue: Applied Mathematics and Computation (2006)

The effect of particle size on particle distribution during the casting of particulate metal matrix composites (PMMC) is experimentally and numerically investigated. Pb20% Sn alloy and Zr2O3 particles are employed as matrix and reinforcing materials respectively. The casting is performed with an inert gas pressure. The final product is sectioned at several locations and particle fraction is determined using image processing software. Particle fraction is numerically determined by following trajectories of selected particles. It is found that particle fraction decreases along the mold and segregation is reduced with larger particles. The numerical results agree reasonable with experimental data
Direction-of-arrival estimation under sensor location uncertainty
Authors: Y. Yardimci, J. A. Cadzow
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The effect of modeling errors on the sensor output signals is analyzed and the distribution of the residual errors in the presence and absence of modeling errors is determined. Both conditional and unconditional models for source amplitudes currently in use are referred to. A new test for determining an aberrant sensor is introduced. Finally, it is incorporated in an iterative procedure where each iteration consists of a step of direction-of-arrival (DOA) estimation followed by a test for the presence of any aberrant sensors. The estimates of DOAs obtained through this iterative scheme are compared with those of other currently available algorithms.
Rational DP-Ball Curves
Authors: Natasha Dejdumrong
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this paper, a normalized totally positive (NTP) basis given by Delgado and Pena [5] is used to form non-rational and rational DP-Ball curves. The relationships between rational Bézier and rational DP-Ball curves are given using homogeneous coordinates. Consequently, an efficient algorithm with linear computational complexity is introduced in order to be used in evaluating the points on rational Bézier curve. Although the elegant de Casteljau algorithm is proven to be simple and stable. Unfortunately, compared with the linear time complexity of the proposed algorithm, it is not efficient. This algorithm can be used as an altertive algorithm to the popular Wang algorithm.
A versatile Nyquist-rate A/D converter with 16-18 bit performance for sensor readout applications
Authors: Pieter Rombouts, Ludo Weyten
Venue: Integration, the VLSI Journal (2005)

This work presents an ADC core for sensor readout applications. To achieve a high resolution combined with Nyquist-rate A/D conversion, it employs the extended counting technique (IEEE Trans. Circuits Syst. I, 42(11) (1995) 904). By making the number of counting steps programmable, the circuit allows to trade conversion speed for accuracy. In its nominal (lowest-accuracy) mode a conversion requires 71 clock cycles and achieves 16-bit performance in a conversion time of 50 µs. In the slowest, highest-accuracy mode it achieves 18-bit performance in a conversion time of 365 µs.To achieve this in a CMOS process that only provides nonlinear capacitors, a nonlinearity correction is investigated. It is shown that this can be approximated by inverting the voltage to charge relationship of the capacitors at the output of the converter. This was implemented as a simple third-order correction, which can easily be done in software. If this correction is omitted, the DNL of the convertor is nearly unchanged but its INL is affected.The circuit's power consumption is 5 mW. The silicon area including all control and reconstruction logic is 1.3 mm2.
Service-Oriented Business Performance Management for Real-Time Enterprise
Authors: Jun-Jang (JJ) Jeng
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

This paper presents a SOMA based methodology of defining SOA for business performance management. This method is coined as BPM SOMA. We will describe the essential capabilities that are supported by business performance management systems and how these capabilities can be materialized into BPM services that would constitute an SOA for business performance management (BPM). Business integration generates many technologies in last couple of decades, e.g., application integration, middleware, business process modeling and integration, business intelligence and business service management. To a larger extent, BPM contains part of all of the technologies for business integration. Customers are facing more severe business integration challenges than ever. For example, the gap between business and IT is becoming greater. Simple solution of exposing data to customers on the glass is not sufficient to help customers operate their businesses. BPM is aimed for resolving business integration issues by providing an integrated framework, enabling an organization to understand the status of business processes across business and IT, placing that understanding in context against goals and trends and taking timely action to improve business operations.
Detection of weak stochastic signals in non-Gaussian noise: a general result
Authors: P. M. Schultheiss, L. C. Godara
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The paper studies the performance of a locally optimum detector namely, the generalized energy detector and shows that its performance starts to deteriorate as the signal to noise ratio increases beyond a certain level. The study has been carried out to cover a much broader class of signal and noise distributions than allowed in previous studies to conclude that the performance of the generalized energy detector can become poorer than that of the power detector well within the practical range of signal to noise ratios and the apparently large gains predicted by the asymptotic theory may not be reachable in practice.
Design and Implementation of WIPI Runtime Engine
Authors: Sang-Yun Lee, Byung-Uk Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Wireless Internet Platform for Interoperability (WIPI) is a standard wireless Internet platform whose mounting is required by law for all terminals in Korea starting April 2005. We designed and implemented a WIPI runtime engine to support Clet, a WIPI-C application program. The implementation method of a dynamic linker and a loader, two core technologies of the runtime engine, was also described. The proposed runtime engine passed the Platform Certificate Tool (PCT) test, WIPI specifications' certification tool that guarantees the interoperability of the engine and ensures that it functions properly.
Mathematical programming for deliberation scheduling in time-limited domains
Authors: Jianhui Wu, Edmund H. Durfee
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Deliberation scheduling is the process of scheduling decision procedures to maximize overall performance. In this paper, we present novel mathematical programming algorithms for scheduling deliberations, and illustrate them through several increasingly complex classes of deliberation scheduling problems. In comparison to previous work, our algorithms are able to optimally or near-optimally solve deliberation scheduling problems for decision procedures that have more general performance profiles, and are applicable in complex domains with uncertainty. We also illustrate that, thanks to the mathematical programming form illation, our algorithms can be easily extended to model additional system aspects.
Resource Management Using Untrusted Auctioneers in a Grid Economy
Authors: Kris Bubendorfer, Wayne Thomson
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The CORA (Coallocative, Oversubscribing Resource Allocation) architecture is an auction based resource reservation system that makes combinatorial allocations of resources to clients. The focus of this paper is on the use of cryptographic tools in CORA to remove the need for trust in the resource auctioneer. One of the nice properties of this approach is that the auctioneers can be drawn from an arbitrary pool of untrusted peers, without the need to establish pre-existing trust or restrict the role of auctioneer to a trusted system service. This approach results in more flexibility in the design of large economic systems, with the potential for wide distribution of load amongst many auctioneers. In addition, only the winners of the auction and the prices they pay are revealed while all other bid values are kept secret. It is our belief that future growth or commercialisation of large scale Grid systems requires the provision of such mechanisms to share the wide pool of Grid brokered resources such as computers, software, licences and peripherals amongst many users and organisations. This paper encapsulates an overview of our design, our experiences of implementing two different secure auction protocols and the performances that we have achieved.
An Ontology-based Method in Information Translation
Authors: Bai Yan, Liu Dayou
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

An ontology-based method named AOBM is proposed in this paper. It fully takes into account the factors that will afect the communication, and using ontology can be represented in agent's knowledge base. Pmvided ontology did not belong to the public data or have any public ontology, AOBM establishes a layering algorithm, which is able to avoid logical exception handling policies, ensure the right understanding of the communication entity concept, and resolve the consistency problem of the concept translation. Experimental results show that AOBM is superior to other methods, and can effectively improve the communication consistency of a mobile agent system under certain conditions.
eye-q: eyeglass peripheral display for subtle intimate notifications
Authors: Enrico Costanza, Samuel A. Inverso, Elan Pavlov, Rebecca Allen, Pattie Maes
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

Mobile devices are generally used in public, where the user is surrounded by others not involved in the interaction. Audible notification cues are often a cause of unnecessary disruption and distraction both for co-located people and even for the user to whom they are directed. We present a wearable peripheral display embedded in eyeglasses that delivers subtle, discreet and unobtrusive cues. The display is personal and intimate; it delivers visual cues in the wearers' periphery without disrupting their immediate environment. A user study conducted to validate the design reveals that the display is effective and subtle in notifying users. Experimental results show, with significance, that the cues can be designed to meet specific levels of visibility and disruption for the wearer, so that some cues are less noticeable when the user is not under high workload, which is highly desirable in many practical circumstances. Hence, peripheral notification displays can provide an effective solution for designing socially acceptable notification displays, unobtrusive to the user and the immediate environment.
Adaptive filtering in subbands using a weighted criterion
Authors: M. de Courville, P. Duhamel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Classical transform-domain algorithms adapt the filter coefficients (in each "frequency bin") by minimizing a criterion depending on a full-band time-domain error. This paper proposes an algorithm which updates each portion of the frequency response of the adaptive filter according to the error in the same subband. For this purpose, a multirate adaptive filter is used where a subband decomposition of the error is performed using critically sampled lossless perfect reconstruction filter banks. This new algorithm is based on the minimization of a weighted criterion by a stochastic gradient algorithm and leads to improvements in the convergence rate compared to both LMS and classical frequency domain algorithms.
A semantic approach to boost passage retrieval effectiveness for question answering
Authors: Bahadorreza Ofoghi, John Yearwood, Ranadhir Ghosh
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

In the current state of the rapid growth of information resources and the huge number of requests submitted by users to existing information retrieval systems; recently, Question Answering systems have attracted more attention to meet information needs providing users with more precise and focused retrieval units. As one of the most challenging and important processes of such systems is to retrieve the best related text excerpts with regard to the questions, we propose a novel approach to exploit not only the syntax of the natural language of the questions and texts, but also the semantics relayed beneath them via a semantic question rewriting and passage retrieval task. The semantic structure used to address the surface mismatch of the semantically related passages and queries is FrameNet which is a lexical resource for English constituted based on frame semantics. We have run our proposed approach on a subset of the TREC 2004 factoid questions to retrieve passages containing correct answers from the AQUAINT collection and we have obtained promising results.
Applying Advance Reservation to Increase Predictability of Workflow Execution on the Grid
Authors: Marek Wieczorek, Mumtaz Siddiqui, Alex Villazon, Radu Prodan, Thomas Fahringer
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper we present an extension to devise and implement advance reservation as part of the scheduling and resource management services of the ASKALON Grid application development and runtime environment. The scheduling service has been enhanced to offer a list of resources that can execute a specific task and to negotiatewith the resource manager about resources capable of processing tasks in the shortest possible time. We introduce progressive reservation approach which tries to allocate resources based on a fair-share principle. Experiments are shown that demonstrate the effectiveness of our approach, and that reflect different QoS parameters including performance, predictability, resource usage and resource fairness.
Functional Model Exploration for Multimedia Applications via Algebraic Operators
Authors: Shinjiro Kakita, Yosinori Watanabe, Douglas Densmore, Abhijit Davare, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

An optimized functional design space exploration method for multimedia applications is proposed. The basis of the method is a way of representing the dependency and the concurrency of an application in a compact form exploiting algebraic operators and expressions. The optimized design process consists of mapping one of the possible expressions in the application space onto a concurrent architecture. We use the Metropolis design framework to demonstrate the effectiveness of the procedure using an FPGA architecture as the target implementation platform. The advantage of using this platform is the availability of models that approximate well the performance of the final implementation when performing the mapping from function to architecture thus yielding a robust design methodology.
Effective Filtering Scheme against RREQ Flooding Attack in Mobile Ad Hoc Networks
Authors: Jian-Hua Song, Fan Hong, Yu Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In Mobile Ad hoc Networks (MANET), various types of Denial of Service Attacks (DoS) are possible because of the inherent limitations of its routing protocols. The attack of initiating / forwarding fake Route Requests (RREQs) can lead to hogging of network resources and hence denial of service to genuine nodes. This type of attack is hard to detect since malicious nodes mimic normal nodes in all aspects except that they do route discoveries much more frequently than the other nodes. A distrusted filtering mechanism is proposed to mitigate such situations and reduce the loss of throughput. The proposed mechanism could prevent this specific kind of DoS attack and does not use any additional network bandwidth.
CDMA Based Multiple-User Digital Watermarking
Authors: Deyun Peng, Jiazhen Wang, Sumin Yang, Suzhen Wang, Aizhen Liu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper proposes a new type of multi-user digital watermarking based on CDMA, which aims at the demand of multi-user copyright sharing protection. It presents two CDMA based approaches, i.e. wavelet domain direct approach (WD) and wavelet domain neighbor linear prediction approach (WNLP). It analyses the influence of user quantity and embedding depth on the quality of watermarked images and extracted watermarks. Experiment results show that the algorithm can solve the problem of watermarks collision and relieve the restriction of user quantity of multiple watermarking algorithms.
Discriminative Patch Selection using Combinatorial and Statistical Models for Patch-Based Object Recognition
Authors: Akshay Vashist, Zhipeng Zhao, Ahmed Elgammal, Ilya Muchnik, Casimir Kulikowski
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In an object recognition task where an image is represented as a constellation of image patches, often many patches correspond to the cluttered background. If such patches are used for object class recognition, they will adversely affect the recognition rate. In this paper, we present a two stage method for selecting image patches which characterize the target object class and are capable of discriminating between the positive images containing the target objects and the complementary negative images. The first stage selection is done using a novel combinatorial optimization formulation on a weighted multipartite graph representing similarities between images patches across different instances of the target object. The following stage is a statistical method for selecting those images patches from the positive images which, when used individually, have the power of discriminating between the positive and negative images in the evaluation data. The individual methods have a performance competitive with the state of the art methods on a popular benchmark data set and their sequential combination consistently outperforms the individual methods and most of the other known methods while approaching the best known results.