ppxscal/embedding_network huggingface dataset:
High-Speed Discrete Content Sensitive Pattern Match Algorithm for Deep Packet Filtering
Authors: Bo Jiang, Bin Liu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Network security has long been a spotlight that draws increasing attention from all sides of society. Against this backdrop, deep processing of network packets has become an important subject for researchers. Since malicious packets often disguise their sensitive information in one way or another in order to bypass the packet filter, this paper proposes a high-speed discrete content sensitive pattern match algorithm for imperceptible deep packet filtering. The filter sets up and manages (including lookup and update) a sensitive information database, monitors both packet header and payload at line speed with hardware-based discrete content sensitive pattern match, and then executes the corresponding action. The paper mainly discusses a TCAM-based pattern match algorithm as well as the architecture and performance analysis of a packet filtering system based on this algorithm. We present a totally new idea of hardware-based discrete content sensitive pattern match. Based on the result of algorithm evaluation and performance analysis, such a packet filtering system can achieve optimal functionality and efficiency that makes network monitoring much easier to work.
Combining the Min-Conflicts and Look-Forward Heuristics to E.ectively Solve a Set of Hard University Timetabling Problems
Authors: Vincent Tam, David Ting
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

University timetabling problems (UTPs) represent a class of challenging, high-dimensional and multi-objectives combinatorial optimization problems that are commonly solved by constructive search, local search methods or their hybrids. In this paper, we proposed to combine the min-conflicts and look-forward heuristics used in local search methods to effectively solve general university timetabling problems. Our combined heuristics when augmented with the k-reset operator, and appropriate heuristic variable ordering strategy achieved impressive results on a set of challenging UTPs obtained from an international timetabling competition. A preliminary analysis of the results was given. More importantly, our search proposal shed light on effectively solving other complex or large-scale scheduling problems.
Review of "Spinning the semantic web: Bringing the world wide web to its full potential" edited by Dieter Fensel, James Hendler, Henry Lieberman, and Wolfgang Wahlster, The MIT press
Venue: Ubiquity (2003)

Are you looking for a method for managing Web data in a useful and orderly format? Your search is over. This handbook is both a good introduction for the metadata neophyte and a useful reference for the semantically hip.
Matroid Automorphisms and Symmetry Groups
Authors: Lori Fern, Gary Gordon, Jason Leasure, Sharon Pronchik
Venue: Combinatorics, Probability and Computing (2000)

For a subgroup W of the hyperoctahedral group On which is generated by reflections, we consider the linear dependence matroid MW on the column vectors corresponding to the reflections in W. We determine all possible automorphism groups of MW and determine when W &cong; = Aut(MW). This allows us to connect combinatorial and geometric symmetry. Applications to zonotopes are also considered. Signed graphs are used as a tool for constructing the automorphisms.
Active Vulnerability Assessment of Computer Networks by Simulation of Complex Remote Attacks
Authors: Igor Kotenko
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

The paper describes the formal approach and software tool "Attack Simulator" intended for active vulnerability assessment of computer network security policy at the stages of design and deployment of network security systems. The suggested approach is based on stochasticgrammar-based models of attacks and is realized via automatic imitation of remote computer network attacks of different complexity. The paper characterizes the Attack Simulator architecture and the processes of generating malicious actions against computer networkmodel and real-life computer networks. The results of experiments that demonstrate the Attack Simulator efficiency are described in detail.
Transparent Java standard extensions with native libraries on multiple platforms
Authors: Pierre A. I. Wijkman, Mitra Wijkman, Suru Dissanaike
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Java programs that utilize standard extensions with native libraries are problematic since the extensions are platform dependent. We present general methods that make such programs runnable on multiple platforms in a way that is transparent to the user. We show a detailed example for standalone applications, Web Start programs, and applets with a specific such standard extension.
A fast implementation for GMRES method
Authors: E. H. Ayachour
Venue: Journal of Computational and Applied Mathematics (2003)

For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.
Improved algorithms for several network location problems with equality measures
Authors: Juan A. Mesa, Justo Puerto, Arie Tamir
Venue: Discrete Applied Mathematics (2003)

We consider single facility location problems with equity measures, defined on networks. The models discussed are, the variance, the sum of weighted absolute deviations, the maximum weighted absolute deviation, the sum of absolute weighted differences, the range, and the Lorenz measure. We review the known algorithmic results and present improved algorithms for some of these models.
Metadata's Role in a Scientific Archive
Authors: Judi Thomson, Dan Adams, Paula J. Cowley, Kevin Walker
Venue: Computer (2003)

Computational and laboratory experiments generate masses of data that must be stored reliably,with minimal effort on each researcher's part, and must be retrievable for decades. The storage environmentmust also work seamlessly across scientific disciplines and capture all of a file system'sfeatures in a semantically-based catalog that provides Boolean, keyword, and tree-based data access.The authors describe a metadatabased archive for scientific data that provides flexible archive storage for very large data sets. The system uses metadata to organize and manage the data without imposing predefined metadata formats on scientists.
Theoretical models in IS research and the technology acceptance model (TAM)
Authors: Leslie Leong
Venue: Technologies & methodologies for evaluating information technology in business (2003)

In this chapter, attempts are made to describe the theories associated with information technology and to provide an overview of the theories of and research on IT, including the technology acceptance model, the theory of innovation diffusion, the theory of task-technology fit model the theory of planned behavior, and the theory of reasoned action. Furthermore, empirical research was conducted utilizing the widely accepted technology acceptance model (TAM) developed by Davis et al. (1989) to predict system usage. In this study, attempts were made to see if the earlier results of TAM are still valid after the recent advances in systems and technology affecting systems usage. Data were collected from a company in the Pacific Northwest of the United States. From the 250 employees who received the questionnaire via e-mail, 118 returned usable responses. The results indicated that management support and system quality does not affect usage, and TAM was supported substantially well.
CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms
Authors: Daniel A. Keim, Stephen C. North, Christian Panse
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract- Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the map recognizable. In this study, we formally define a family of cartogram drawing problems. We show that even simple variants are unsolvable in the general case. Because the feasible variants are NP-complete, heuristics are needed to solve the problem. Previously proposed solutions suffer from problems with the quality of the generated drawings. For a cartogram to be recognizable, it is important to preserve the global shape or outline of the input map, a requirement that has been overlooked in the past. To address this, our objective function for cartogram drawing includes both global and local shape preservation. To measure the degree of shape preservation, we propose a shape similarity function, which is based on a Fourier transformation of the polygons' curvatures. Also, our application is visualization of dynamic data, for which we need an algorithm that recalculates a cartogram in a few seconds. None of the previous algorithms provides adequate performance with an acceptable level of quality for this application. In this paper, we therefore propose an efficient iterative scanline algorithm to reposition edges while preserving local and global shapes. Scanlines may be generated automatically or entered interactively to guide the optimization process more closely. We apply our algorithm to several example data sets and provide a detailed comparison of the two variants of our algorithm and previous approaches.
Agent Action: Business Cases with Individualised Information Services in a Business Intelligence Context
Authors: Fredric Landqvist, Kalevi Pessi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Information services for Business Intelligence are becoming more integrated in day-to-day operations. This paper describes how the use of intelligent agent-enabled decision support in conjunction with the organisational trends of more dispersed and decentralised organic organised enterprises, enables new practice in the field of Business Intelligence (BI). The two business cases, illustrate the evolving area of Business Intelligence information services for large global enterprises. The information services in the cases aim to provide different levels of personalisation features through the use of intelligent agents. Traditional ideas of how to provide the organisation with right information at the right time and place according to the corporate communications top-down strategy and editorial process, or through Business Intelligence professionals who produce high-end reports, are undergoing change shown in the cases. Employees and managers start to get the information needed directly from the Internet, and are becoming more self-sufficient when it comes to Business Intelligence.
Defining a Market: Market Mitigation by Theory versus Convenience
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The events of the California energy crisis of 2000 quickly led to complaints being filed at the Federal Energy Regulatory Commission (FERC) and subsequent prolonged litigation over prices and profits. The simplicity (perhaps excessively so) of the Commission's procedure for determining mitigated market prices rapidly fell prey to the litigation proceedings and quickly lost any connection it might initially have had to either power engineering or economic reality.This paper examines selected aspects of the California market mitigation process, comparing theoretically desired outcomes of market mitigation with the actual process in California. Results are presented that demonstrate the distortion of such basic steps as market definition and the identification of full incremental costs. The mitigation results and the lessons learned by the various groups involved are analyzed both with respect to engineering andeconomic realities and with respect to political exigencies. The results in California are then placed in the broader context of a likely end phase of electric industry restructuring.
QuizRDF: Search Technology for the Semantic Web
Authors: John Davies, Richard Weeks
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

An information-seeking system is described which combines traditional keyword querying of WWW resources with the ability to browse and query against RDF annotations of those resources. RDF(S) and RDF are used to specify and populate an ontology and the resultant RDF annotations are then indexed along with the full text of the annotated resources. Theresultant index allows both keyword querying against the full text of the document and the literal values occurring in the RDF annotations, along with the ability to browse and query the ontology. We motivate our approach as a key enabler for fully exploiting the Semantic Web in the area of knowledge management and argue that the ability to combine searching and browsing behaviours more fully supports a typical information-seeking task. The approach ischaracterised as "low threshold, high ceiling" in the sense that where RDF annotations exist they are exploited for an improved information-seeking experience but where they do not yet exist, a search capability is still available.
Information Loss in Riffle Shuffling
Authors: Dudley Stark, A. Ganesh, Neil O’connell
Venue: Combinatorics, Probability and Computing (2002)

We study the asymptotic behaviour of the relative entropy (to stationarity) for a commonly used model for riffle shuffling a deck of n cards m times. Our results establish and were motivated by a prediction in a recent numerical study of Trefethen and Trefethen. Loosely speaking, the relative entropy decays approximately linearly (in m) for m < log2 n, and approximately exponentially for m > log2 n. The deck becomes random in this information-theoretic sense after m = 3&#x002F;2 log2 n shuffles.
Diffserv network control using a behavioral multi-agent system
Authors: Nada Meskaoui, Leila Merghem, Dominique Gaiti, Karim Y. Kablan
Venue: Network control and engineering for Qos, security and mobility II (2003)

For many years, telecommunication networks have steadily grown in size and complexity due to the continually growing of users requirements for dynamicity, adaptability and security. The Internet will so support service convergence for this next network's generation. It also has to provide and guarantee Quality of Services to different types of services, where each service may get its own requirements. Providing and managing such networks is not an easy task. These different features may require more intelligent and dynamic behavior from network management. Existing approaches in network management do not support such a dynamic behavior. This paper presents a behavior-based multi-agent solution to manage dynamic telecommunication networks. The proposed solution is based on a Diffserv network by implementing a multi-agent system within Diffserv networks. The impact of an intelligent network management within Diffserv is also analyzed.
LEZI: a video based tool for distance learning
Authors: Mario A. Bochicchio, Nicola Fiore
Venue: Information management: support systems & multimedia technology (2003)

In this chapter we present LEZI, an experimental software tool oriented to the production of indexed videos enriched with hypertextual and multimedia elements for distance learning applications.LEZI is based on the assumption that in particular types of educational hypermedia productions, the quality of educational content may easily compensate for a user interface limited to the essentials or a reduced set of multimedia features. Production of this kind of hypermedia application can be high quality, even with short production cycles at very low cost.The purpose of the chapter is to show how a traditional lesson or a conference can be effectively transformed into a powerful multimedia product based on a very simple and regular structure.
The Clairvoyant Demon Has a Hard Task
Authors: Peter Gács
Venue: Combinatorics, Probability and Computing (2000)

Consider the integer lattice L = &Zopf;2. For some m &ge; 4, let us colour each column of this lattice independently and uniformly with one of m colours. We do the same for the rows, independently of the columns. A point of L will be called blocked if its row and column have the same colour. We say that this random configuration percolates if there is a path in L starting at the origin, consisting of rightward and upward unit steps, avoiding the blocked points. As a problem arising in distributed computing, it has been conjectured that for m &ge; 4 the configuration percolates with positive probability. This question remains open, but we prove that the probability that there is percolation to distance n but not to infinity is not exponentially small in n. This narrows the range of methods available for proving the conjecture.
Making a Case for Efficient Supercomputing
Authors: Wu-chun Feng
Venue: Queue (2003)

A supercomputer evokes images of “big iron” and speed; it is the Formula 1 racecar of computing. As we venture forth into the new millennium, however, I argue that efficiency, reliability, and availability will become the dominant issues by the end of this decade, not only for supercomputing, but also for computing in general.
The Impact of the Secondary Market on the Supply Chain
Authors: Hau Lee, Seungjin Whang
Venue: Management Science (2002)

This paper investigates the impacts of a secondary market where resellers can buy and sell excess inventories. We develop a two-period model with a single manufacturer and many resellers. At the beginning of the first period resellers order and receive products from the manufacturer, but at the beginning of the second period, they can trade inventories among themselves in the secondary market. We endogenously derive the optimal decisions for the resellers, along with the equilibrium market price of the secondary market. The secondary market creates two interdependent effects--a quantity effect (sales by the manufacturer) and an allocation effect (supply chain performance). The former is indeterminate; i.e., the total sales volume for the manufacturer may increase or decrease, depending on the critical fractile. The latter is always positive; i.e., the secondary market always improves allocative efficiency. The sum of the effects is also unclear--the welfare of the supply chain may or may not increase as a result of the secondary market. Lastly, we study potential strategies for the manufacturer to increase sales in the presence of the secondary market.
A stochastic approach to automated design improvement
Authors: Mark O'Keeffe, Mel Ó Cinnéide
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The object-oriented approach to software development facilitates and encourages programming practices that increase reusability, correctness and maintainability in code. This is achieved in Java by providing mechanisms for inheritance, abstraction and encapsulation. By measuring properties that indicate to what extent these mechanisms are utilised we can determine to a large extent how good a design is. However, because these properties often conflict with other goals such as high cohesion and low coupling it can be difficult for a programmer to recognise the best compromise.We propose the novel approach of treating object-oriented design as a combinatorial optimisation problem, where the goal is maximisation of a set of design metrics. With a view to developing a fully automated design improvement tool we have developed a prototype that uses a small metrics suite combined with automated refactorings to move methods to their optimum positions in the class hierarchy. The action of this simulated annealing system produces a new design that is superior in terms of the metrics used and when judged on object-oriented principles.
An Efficient and Robust Conference Key Distribution Protocol
Authors: Yuan-bo Guo, Jian-feng Ma
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

A computationally secure and robust conference key distribution scheme is presented, which requires only the authenticated and encrypted point-to-point channels between each server and each user. By using it, every honest user of a conference can get a common key after the running of the protocol, even if some minority of the servers malfunction or misbehave. Analysis shows that a passive adversary gets zero knowledge about the conference key, and the active adversary cannot impersonate successfully. Because this scheme is noninteractive,both operation and communication overhead are reduced, this make it very efficient.
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
Authors: Onur G. Guleryuz
Venue: Proceedings of the Conference on Data Compression (2004)

It is well-known that wavelet transforms provide sparse decompositions overmany types of image regions but not over image singularities/edges that manifest themselves along curves. It is now widely accepted that, on 2D piecewisesmooth signals, wavelet compression performance is dominated by coefficientsover edges. Research in this area has focused on two tracks, each suffering fromissues related to translation invariance. Methods that directly model high order coefficient dependencies over edges have to combat aliasing issues, and newtransforms that have been designed lose their full strength if they are not usedin a translation invariant fashion. In this paper we combine these approachesand use translation invariant, overcomplete representations to predict waveletedge coefficients. By starting with the lowest frequency band of an l level waveletdecomposition, we reliably estimate missing higher frequency coefficients overpiecewise smooth signals. Unlike existing techniques, our approach does notmodel edges directly but implicitly obtains boundaries by aggressively determining regions where the utilized translation invariant decomposition is sparse.
Formal hardware specification languages for protocol compliance verification
Authors: Annette Bunker, Ganesh Gopalakrishnan, Sally A. Mckee
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2004)

The advent of the system-on-chip and intellectual property hardware design paradigms makes protocol compliance verification increasingly important to the success of a project. One of the central tools in any verification project is the modeling language, and we survey the field of candidate languages for protocol compliance verification, limiting our discussion to languages originally intended for hardware and software design and verification activities. We frame our comparison by first constructing a taxonomy of these languages, and then by discussing the applicability of each approach to the compliance verification problem. Each discussion includes a summary of the development of the language, an evaluation of the language's utility for our problem domain, and, where feasible, an example of how the language might be used to specify hardware protocols. Finally, we make some general observations regarding the languages considered.