ppxscal/embedding_network huggingface dataset:
Network traffic anomaly detection based on packet bytes
Authors: Matthew V. Mahoney
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Hostile network traffic is often "different" from benign traffic in ways that can be distinguished without knowing the nature of the attack. We describe a two stage anomaly detection system for identifying suspicious traffic. First, we filter traffic to pass only the packets of most interest, e.g. the first few packets of incoming server requests. Second, we model the most common protocols (IP, TCP, telnet, FTP, SMTP, HTTP) at the packet byte level to flag events (byte values) that have not been observed for a long time. This simple system detects 132 of 185 attacks in the 1999 DARPA IDS evaluation data set [5] with 100 false alarms, after training on one week of attack-free traffic.
Selective Sampling for Nearest Neighbor Classifiers
Authors: Michael Lindenbaum, Shaul Markovitch, Dmitry Rusakov
Venue: Machine Learning (2004)

Most existing inductive learning algorithms work under the assumption that their training examples are already tagged. There are domains, however, where the tagging procedure requires significant computation resources or manual labor. In such cases, it may be beneficial for the learner to be active, intelligently selecting the examples for labeling with the goal of reducing the labeling cost. In this paper we present LSS&mdash;a lookahead algorithm for selective sampling of examples for nearest neighbor classifiers. The algorithm is looking for the example with the highest utility, taking its effect on the resulting classifier into account. Computing the expected utility of an example requires estimating the probability of its possible labels. We propose to use the random field model for this estimation. The LSS algorithm was evaluated empirically on seven real and artificial data sets, and its performance was compared to other selective sampling algorithms. The experiments show that the proposed algorithm outperforms other methods in terms of average error rate and stability.
Distributed Reinforcement Learning Control for Batch Sequencing and Sizing in Just-In-Time Manufacturing Systems
Authors: Joonki Hong, Vittaldas V. Prabhu
Venue: Applied Intelligence (2004)

This paper presents an approach that is suitable for Just-In-Time (JIT) production for multi-objective scheduling problem in dynamically changing shop floor environment. The proposed distributed learning and control (DLC) approach integrates part-driven distributed arrival time control (DATC) and machine-driven distributed reinforcement learning based control. With DATC, part controllers adjust their associated parts' arrival time to minimize due-date deviation. Within the restricted pattern of arrivals, machine controllers are concurrently searching for optimal dispatching policies. The machine control problem is modeled as Semi Markov Decision Process (SMDP) and solved using Q-learning. The DLC algorithms are evaluated using simulation for two types of manufacturing systems: family scheduling and dynamic batch sizing. Results show that DLC algorithms achieve significant performance improvement over usual dispatching rules in complex real-time shop floor control problems for JIT production.
Integrating Software into PRA
Authors: Bin Li, Ming Li, Susmita Ghose, Carol Smidts
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Probabilistic Risk Assessment is a technique to assessthe probability of failure or success of a mission. Resultsprovided by the risk assessment methodology are used tomake decisions concerning choice of upgrades,scheduling of maintenance, decision to launch, etc.However, current PRA neglects the contribution ofsoftware to the risk of failure of the mission. This paperpresents a framework for "Integrating Software intoPRA", a methodology for systematic integration of thesoftware contribution to risk in system failure analysis. Inparticular, we established a software-related failure modetaxonomy and a three-level PRA sub-model to account forthe impact of software to the classical PRA structure.Application and validation of the taxonomy are discussedin this paper. Future research is also summarized.
The Information Systems Research Cycle
Authors: Alan R. Hevner, Salvatore T. March
Venue: Computer (2003)

IS research should combine the creativity and precision of design science with the empiricism and discipline of behavioral science.
A conceptual model completely independent of the implementation paradigm
Authors: Oscar Dieste, Marcela Genero, Natalia Juristo, José L. Maté, Ana M. Moreno
Venue: Journal of Systems and Software (2003)

Several authors have pointed out that current conceptual models have two main shortcomings. First, they are clearly oriented to a specific development paradigm (structured, objects, etc.). Second, once the conceptual models have been obtained, it is really difficult to switch to another development paradigm, because the model orientation to a specific development approach. This fact induces problems during development, since practitioners are encouraged to think in terms of a solution before the problem at hand is well understood, thus anticipating perhaps bad design decisions.An appropriate analysis task requires models that are independent of any implementation issues. In concrete, models should support developers to understand the problem and its constraints before any solution is identified. This paper proposes such an alternative approach to conceptual modelling, called "problem-oriented analysis method".
Colour picking: the pecking prder of form and function
Authors: Frank Nack, Amit Manniesing, Lynda Hardman
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Multimedia presentation generation has to be able to balance the functional aspects of a presentation that address the information needs of the user and its aesthetic form. We demonstrate our approach using automatic colour design for which we integrate relevant aspects of colour theory. We do not provide a definition of the relative importance of form versus function, but seek to explore the roles of subjective elements in the generation process.
Graphs determined by polynomial invariants
Authors: Marc Noy
Venue: Theoretical Computer Science (2003)

Many polynomials have been defined associated to graphs, like the characteristic, matchings, chromatic and Tutte polynomials. Besides their intrinsic interest, they encode useful combinatorial information about the given graph. It is natural then to ask to what extent any of these polynomials determines a graph and, in particular, whether one can find graphs that can be uniquely determined by a given polynomial. In this paper we survey known results in this area and, at the same time, we present some new results.
Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels
Authors: Salil S. Kanhere, Harish Sethu
Venue: Journal of Parallel and Distributed Computing (2003)

Many wormhole interconnection networks for parallel systems, and more recently system area networks, implement virtual channels to provide a number of services including improved link utilization and lower latencies. The forwarding of flits from the virtual channels on to the physical channel is typically accomplished using flit-based round-robin (FBRR) scheduling. This paper presents a novel scheduling strategy, anchored opportunity queueing (AOQ), which preserves the throughput and fairness characteristics of FBRR while significantly reducing the average delay experienced by packets. The AOQ scheduler achieves lower average latencies by trying, as far as possible, to complete the transmission of a complete packet before beginning the transmission of flits from another packet. The AOQ scheduler achieves provable fairness in the number of opportunities it offers to each of the virtual channels for transmissions of flits over the physical channel. We prove this by showing that the relative fairness bound, a popular measure of fairness, is a small finite constant in the case of the AOQ scheduler. Finally, we present simulation results comparing the delay characteristics of AOQ with other schedulers for virtual channels. The AOQ scheduler is simple to implement in hardware, and also offers a practical solution in other contexts such as in scheduling ATM cells in Internet backbone switches.
An Open Interface for Parallelization of Traffic Simulation
Authors: Damian Igbe, Nasser Kalantery, Stephen Ijaha, Stephen Winter
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

In this paper, we present the implementation of a parallel road traffic simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers inserted into lane data structures at the road network partition edges. Vehicles enter a partition at the edges from an LCP and exit a partition edge into an LCP at the end of everysimulation step. Spider, a parallel programming environment, which runs on PVM, coordinates the execution of the parallel traffic simulation.
SES Americom maximizes satellite revenues by optimally configuring transponders
Authors: Rajesh Tyagi, Srinivas Bollapragada
Venue: Interfaces (2003)

SES Americom Inc. will launch AMC-12, the first of its new generation of communication satellites, in early 2004. This satellite has 24 highly sophisticated transponders, each of which can serve up to three markets simultaneously. By changing the configuration of the transponders, we can alter the markets they serve, thereby adjusting the capacity available by market. We developed a pricing- and contract-management system to maximize the revenues that AMC-12 generates. The system tracks signed contracts and projected demands over the life of the satellite, and recommends optimal configurations for the satellite's 24 transponders each month to maximize revenues. We modeled the transponder-configuration problem as a mixed-integer program and developed efficient heuristics for solving the problem. We implemented our algorithms in a Microsoft Excel-based system with a Visual Basic user interface. SES Americom is using the system to manage over $2 billion in revenues. We plan to adapt the system for use in other satellites with similar technology to be launched in the future.
Fault Recovery Based on Checkpointing for Hard Real-Time Embedded Systems
Authors: Ying Zhang, Krishnendu Chakrabarty
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Safety-critical embedded systems often operate in harsh environmental conditions that necessitate fault-tolerant computing techniques. Many safety-critical systems also execute real-time applications. The correctness of these systems depends not only on the logical result of computation, but also on the time at which the results are produced. The missing of taskdeadlines can therefore be viewed as a temporal fault. In this paper, we examine fault recovery based on checkpointing for real-time systems. We present schedulability tests for checkpointing in real-time systems. These feasibility-of-scheduling tests provide the criteria under which checkpointing can provide fault tolerance and real-time guarantees for hard real-time embedded systems under two different fault arrival models.
Techniques for mechanical strain analysis in sub-micrometer structures: TEM/CBED, micro-Raman spectroscopy, X-ray micro-diffraction and modeling
Authors: I. De Wolf, V. Senez, R. Balboni, A. Armigliato, S. Frabboni, A. Cedola, S. Lagomarsiono
Venue: Microelectronic Engineering (2003)

In this paper, three techniques are discussed that provide information on process-induced local mechanical stress in silicon: the convergent beam electron diffraction technique of transmission electron microscopy, X-ray micro-diffraction and micro-Raman spectroscopy. We discuss the principles of these techniques, their spatial resolution, the ease-of-use, the information that can be obtained, the required sample preparation, the measurement time, and the complementarities of these techniques. We demonstrate this for stress induced by shallow trench isolation and correlate the results to finite element analysis results.
Question answering from the web using knowledge annotation and knowledge mining techniques
Authors: Jimmy Lin, Boris Katz
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

We present a strategy for answering fact-based natural language questions that is guided by a characterization of real-world user queries. Our approach, implemented in a system called Aranea, extracts answers from the Web using two different techniques: knowledge annotation and knowledge mining. Knowledge annotation is an approach to answering large classes of frequently occurring questions by utilizing semi\-structured and structured Web sources. Knowledge mining is a statistical approach that leverages massive amounts of Web data to overcome many natural language processing challenges. We have integrated these two different paradigms into a question answering system capable of providing users with concise answers that directly address their information needs.
On the Genericity of the Observability of Uncontrolled Discrete Nonlinear Systems
Authors: J.-C. Vivalda
Venue: SIAM Journal on Control and Optimization (2003)

In this paper, it is proven that, generically, a nonlinear discrete system given on a compact manifold X is observable.
ProGrid: A Proxy-Based Architecture for Grid Operation and Management
Authors: Paulo Vicente Capellotto Costa, Sérgio Donizetti Zorzo, Hélio Crestana Guardia
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

This paper introduces the ProGrid system, an architecture for computational Grids, whose communication and resource management infrastructure is used transparently by the applications. Unlike other grid approaches, either application-centric or system-centric, the model relies on the use of proxy servers to perform additional communications and authentication procedures on behalf of client applications. The purpose of this mechanism is to enable parallel applications to be executed in geographically distributed environments interlinked by an open communication network, such as the Internet, meeting the security requisites desirable for computational grids. Among the common services of a Grid, this workfocuses on safe communication and the controlled sharing of available resources.To identify the resources, standards under development are considered for the specification of objects in Grids. This paper also discusses an extension of the functionality of proxy servers to includesupport for the standardizedmanagement of the Grid and of the available objects.
Web-based supply chain integration model
Authors: Latif Al-Hakim
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter discusses various business process supply-chain models and emphasizes the need for organizations to apply CRM concepts and to integrate the Internet within the functions of the supply chain in order to be able to gain good customer expectations in the era of e-commerce. This chapter outlines a framework for developing a Web-based supply chain integrating model based on SCOR and key features of CPFR, and attempts to link this model with Business Process Reengineering, and with traditional productivity improvement programs. The development of a Web site at two levels is suggested. The first level is within the public domain and the other is limited to supply chain partners. The chapter incorporates fuzzy set theory into the dynamic of production scheduling to allow the integrating model to deal with vague constraints, and to enable conflicting multi-criteria objectives to be managed effectively in the production environment.
On some log-cosine integrals related to &#x03B6;(3), &#x03B6;(4), and &#x03B6;(6)
Authors: Mark W. Coffey
Venue: Journal of Computational and Applied Mathematics (2003)

We evaluate a variety of log-cosine integrals, one of which has value a rational multiple of πζ(4), while others evaluate to the form π[aζ(6) + b(3/4)ζ2(3)], where a > 0 is rational and b is 1 or 2, and ζ is the Riemann zeta function. We show that these results may be obtained starting from a known tabulated result. The derivation yields results for certain classes of logarithm-trigonometric integrals, and indicates how further analytic results on digamma series may be obtained.
Coloring uniform hypergraphs with few colors
Authors: Alexandr Kostochka
Venue: Random Structures Algorithms (2004)

Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k ≥ 2n, then m(r, k) ≥ ∈(k)kr(r/ln r)n/(n+1).
Authoring-in-the-large: software engineering techniques for hypertext application design
Authors: Franca Garzotto, Paolo Paolini, Daniel Schwabe
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

This paper discusses a structured approach to hypertext application design which we have called "authoring-in-the-large". This approach is based on the belief that in order to get a consistent, expressive, usable hypertext, the application should be first designed at conceptual level in a system independent manner. The author should try to describe global properties of an application - its representation structures, navigational patterns, operational semantics, overall visualization and display aspects, before actually creating and filling in the nodes' content. In addition, this paper presents HDM - <u>H</u>ypertext <u>D</u>esign <u>M</u>odel, a first attempt toward developing high level design primitives for describing static and dynamic aspects of hypertext applications from the authoring-in-the-large point of view.
A Condition Number for Point Matching with Application to Registration and Postregistration Error Estimation
Authors: Charles S. Kenney, B. S. Manjunath, Marco Zuliani, Gary A. Hewer, Alan Van Nevel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Selecting salient points from two or more images for computing correspondence is a well-studied problem in image analysis. This paper describes a new and effective technique for selecting these tiepoints using condition numbers, with application to image registration and mosaicking. Condition numbers are derived for point-matching methods based on minimizing windowed objective functions for 1) translation, 2) rotation-scaling-translation (RST), and 3) affine transformations. Our principal result is that the condition numbers satisfy K_Trans \leq K_RST \leq K_Affine. That is, if a point is ill-conditioned with respect to point-matching via translation, then it is also unsuited for matching with respect to RST and affine transforms. This is fortunate since K_Trans is easily computed whereas K_RST and K_Affine are not. The second half of the paper applies the condition estimation results to the problem of identifying tiepoints in pairs of images for the purpose of registration. Once these points have been matched (after culling outliers using a RANSAC-like procedure), the registration parameters are computed. The postregistration error between the reference image and the stabilized image is then estimated by evaluating the translation between these images at points exhibiting good conditioning with respect to translation. The proposed method of tiepoint selection and matching using condition number provides a reliable basis for registration. The method has been tested on a large number of diverse collection of images¿multidate Landsat images, aerial images, aerial videos, and infrared images. A Web site where the users can try our registration software is available and is being actively used by researchers around the world.
Local reasoning about a copying garbage collector
Authors: Lars Birkedal, Noah Torp-Smith, John C. Reynolds
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

We present a programming language, model, and logic appropriate for implementing and reasoning about a memory management system. We then state what is meant by correctness of a copying garbage collector, and employ a variant of the novel separation logics [18, 23] to formally specify partial correctness of Cheney's copying garbage collector [8]. Finally, we prove that our implementation of Cheney's algorithm meets its specification, using the logic we have given, and auxiliary variables [19].
Attribute space visualization of demographic change
Authors: André Skupin, Ron Hagelman
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

This paper introduces an approach for closer integration of self-organizing maps into the visualization of spatio-temporal phenomena in GIS. It is proposed to provide a more explicit representation of changes occurring inside socio-economic units by representing their attribute space trajectories as line features traversing a two-dimensional display space. A self-organizing map consisting of several thousand neurons is first used to create a high-resolution representation of attribute space in two dimensions. Then, multi-year observations are mapped onto the neural network and linked to form trajectories. This method is implemented for a data set containing 254 counties and 34 demographic variables. Various visual results are presented and discussed in the paper, from the visualizations of individual component planes to the mapping of voting behavior onto temporal trajectories.
Category cluster discovery from distributed WWW directories
Authors: Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching Chen
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Due to the inherently distributed nature of many networks, including the Internet, information and knowledge are generated and organized independently by different groups of people. To discover and exploit all the knowledge from different sources, a method of knowledge integration is usually required. Considering the document category sets as information sources, we define a problem of information integration called category merging. The purpose of category merging is to automatically construct a unified category set which represents and exploits document information from several different sources. This merging process is based on the clustering concept where categories with similar characteristics are merged into the same cluster under certain distributed constraints. To evaluate the quality of the merged category set, we measure the precision and recall values under three classification methods, Naive Bayes, Vector Space Model, and K-Nearest Neighbor. In addition, we propose a performance measure called cluster entropy, which determines how well the categories from different sources are distributed over the resulting clusters. We perform the merging process by using the real data sets collected from three different Web directories. The results show that our merging process improves the classification performance over the non-merged approach and also provides a better representation for all categories from distributed directories.
Parsing and empty nodes
Authors: Mark Johnson, Martin Kay
Venue: Computational Linguistics (1994)

This paper describes a method for ensuring the termination of parsers using grammars that freely posit empty nodes. The basic idea is that each empty node must be associated with a lexical item appearing in the input string, called its sponsor. A lexical item, as well as labeling the node for the corresponding word, provides labels for a fixed number, possibly zero, of empty nodes. The number of nodes appearing in the parse tree is thus bounded before parsing begins. Termination follows trivially. The technique is applicable to any standard parsing algorithm.