ppxscal/embedding_network huggingface dataset:
Visual Firewall: Real-time Network Security Monito
Authors: Chris P. Lee, Jason Trost, Nicholas Gibbs, Raheem Beyah, John A. Copeland
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

Networked systems still suffer from poor firewall configuration and monitoring. VisualFirewall seeks to aid in the configuration of firewalls and monitoring of networks by providing four simultaneous views that display varying levels of detail and time-scales as well as correctly visualizing firewall reactions to individual packets. The four implemented views: Real-Time Traffic, Visual Signature, Statistics, and IDS Alarm, provide the levels of detail and temporality that system administrators need to properly monitor their systems in a passive or an active manner. We have visualized several attacks, and we feel that even individuals unfamiliar with networking concepts can quickly distinguish between benign and malignant traffic patterns with a minimal amount of introduction.
Echo and soft VoIP PBX systems
Authors: David Mandelstam
Venue: Linux Journal (2005)

An old problem for long-distance lines is back for the Internet. Fortunately, today we have better tools to deal with it.
Analytical study of an error envelope feedback linearizer: Research Articles
Authors: Giuseppe Macchiarella, Norman Carpenzano, Andrea Meazza
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2006)

An error envelope feedback linearizer (EEFL) employs the complex envelope of the distortion generated by the power amplifier (PA) as a feedback to control the envelope of the PA input signal; in this way, a sort of predistortion is realized, allowing the reduction of the intermodulation distortion (IMD) produced by the PA. A recently introduced EEFL architecture is investigated in this article from a mathematical point of view; starting from the functional scheme of the linearizer, its response to one- and two-tone excitations is evaluated, allowing a simple estimation of the achievable performances (IMD reduction). The stability issue may constitute a severe limitation for this class of linearizers; by using both the introduced mathematical model and numerical simulations, the stability is investigated in order to obtain better insight into the working mechanism of the EEFL. &copy; 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.
A VR platform for field-scale phenomena: an application to fire spread experiments
Authors: Alexandre Muzy, Nicolas Fauvet, Patrick Bourdot, Frédéric Bosseur, Christophe Gouinaud
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Digital computers are powerful tools for studying natural phenomena at large-scales. Nevertheless, custom-made methods have to be developed to digitalize, simulate and finally visualize these phenomena. First, the numerous data of the real-world have to be digitalized to be stored into a computer. Then, as dynamics of large-scale natural phenomena are usually not obvious to understand, computation-based simulation models have to be developed. Finally, Virtual Reality (VR) techniques are better than 3D visualization on conventional computer graphic displays to observe and manipulate real and large-scale data, to compare them with simulation ones. Consequently, in a first interdisciplinary effort, we present some new solutions to design a VR platform for the analysis and simulation of large-scale phenomena. Original digitalization and visualization techniques (in an immersive environment) constitute the main contribution of this paper.
A Novel Method for Off-line Handwriting-based Writer Identification
Authors: Zhenyu He, Yuan Yan Tang, Bin Fang, Jianwei Du, Xinge You
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Handwriting-based writer identification is a hot research topic in the pattern recognition field. Nowadays, on-line handwriting-based writer identification is steadily growing toward its maturity. On the contrary, off-line handwritingbased writer identification still remains as a challenging problem because writing features only can be extracted from the handwriting image in this situation. As a result, plenty of dynamic writing information, which is very valuable for writer identification, is lost. At present, 2-D Gabor filter method is widely acknowledged as a good method for off-line handwriting identification, however it still suffers from some inherent disadvantages, such as the high computational cost. In this paper, we present a novel waveletbased GGD method to replace the traditional 2-D Gabor filters. Shown in our experiments, this novel method not only achieves better experiment results but also greatly reduces the elapsed time on calculation.
Functional Test Generation Remote Tool
Authors: E. Bareisa, V. Jusas, K. Motiejunas, R. Seinauskas
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The same circuit may be described at algorithmic, behavioral or gate level. Test generation is usually performed for every level separately. We introduce a test generation approach based on test selection by means of simulation at algorithmic level of circuit description. The generated test could be applied to VHDL behavioral level as test bench. This test shows high fault coverage at equivalent gate level. The test selection procedure relies on the model of input stuck-at faults transmissions to output. The application of test frames allows sequential circuits to consider like combinational ones. The proposed method is implemented in the test generation program that is available on the Internet as freeware. The experiment shows efficiency of the proposed method.
Some speculation on simulation and information systems
Authors: Henry C. Lucas,  Jr.
Venue: ACM SIGSIM Simulation Digest (1979)

An information systems as a set of procedures which process data used to support decision making. Robert Anthony (1965) has suggested a taxonomy of decision types which provides information useful in thinking about systems. Strategic planning decisions involve setting the objectives of the organization. Managerial control decisions deal with the task of determining that resources are employed to achieve the goals set in strategic planning. Operational control decisions deal with the day-to-day operations of the firm.
Determining user privacy preferences by asking the right questions: an automated approach
Authors: Keith Irwin, Ting Yu
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

One fundamental aspect of user privacy is to respect the privacy preferences that users have. A clear prerequisite to doing this is accurately gauging what user's privacy preferences are. Current approaches either offer limited privacy options or have so many choices that users are likely to be overwhelmed. We present a framework for modeling user privacy preferences in terms of a hierarchy of questions which can be asked. We describe two means of dynamically choosing which questions should be asked to efficiently determine what a user's privacy preferences are.
Evaluating biological data using rank correlation methods
Authors: Douglas J. Slotta
Venue:  (2005)

Analyses based upon rank correlation methods, such as Spearman's &rho; and Kendall's &tau;, can provide quick insights into large biological data sets. Comparing expression levels between different technologies and models is problematic due to the different units of measure. Here again, rank correlation provides an effective means of comparison between the two techniques. Massively Parallel Signature Sequencing (MPSS) transcript abundance levels to microarray signal intensities for Arabidopsis thaliana are compared. Rank correlations can be applied to subsets as well as the entire set. Results of subset comparisons can be used to improve the capabilities of predictive models, such as Predicted Highly Expressed (PHX). This is done for Escherichia coli. Methods are given to combine predictive models based upon feedback from experimental data. The problem of feature selection in supervised learning situations is also considered, where all features are drawn from a common domain and are best interpreted via ordinal comparisons with other features, rather than as numerical values. This is done for synthetic data as well as for microarray experiments examining the life cycle of Drosophila melanogaster and human leukemia cells. Two novel methods are presented based upon &rho; and &tau;, and their efficacy is tested with synthetic and real world data. The method based upon Spearman's &rho; is shown to be more effective.
An Intelligent Guiding and Controlling System for Transportation Network Based on Wireless Sensor Network Technology
Authors: CHEN Wenjie, GAO Liqiang, CHAI Zhilei, CHEN Zhanglong, TU Shiliang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper proposes architecture based on Wireless Sensor Network (WSN) technology for Intelligent Transportation System (ITS) of a transportation network. With the help of WSN technology, the traffic info of the network can be accurately measured in real time. Based on this architecture, an optimization algorithm is proposed to minimize the average travel time for the vehicles in the network. Compared to randomly-chosen algorithm, simulation results show that the average speed of the road network is significantly improved by our algorithm, and thus improve the efficiency of the road network. Some extended applications of the proposed WSN system are discussed as well.
Texture for volume character animation
Authors: Peiyi Shen, Philip Willis
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present an approach to texture mapping volume datasets based on multiple semantic constraints. The approach is based on continuous space mappings to ensure good image quality. It requires only one intervention by the user, to determine key points where the texture must match an intermediate image of the original data. This can also be used to avoid the problem of texture being smeared over too large an area. The method uses three passes. In the first pass the texture is warped to an intermediate surface which is itself a projection of the volume object. This is used to ensure that the texture correctly aligns with user-supplied key points of the object. The use of key points to pin the texture in place ensures that the volume object can be animated. When rendering the object two further passes are used, first inversely mapping each point being rendered to a plenoptic surface and then inversely mapping to the intermediate surface. This three-part aspect additionally allows the texture image to be independent of the volume data. A data-dependent triangulation method is used to retain edge quality in texture images. We demonstrate an extension to 2.5D textures, extruded through the volume, using an approach consistent with 2D texture. This supports interactive sculpting of the volume model. Our overall goal is animated characters using textured volume data.
Radial basis functions in scientific computing
Authors: Leevan Ling
Venue:  (2003)

Radial basis functions (RBFs) have originally been used as an effective tool to interpolate data. The basis functions (all translations of one radial symmetric function) can be centered at arbitrary points in the domain of interest, hence providing a truly meshfree approximation, i.e., a wireframe parametric surfaces is not required. For certain types of RBFs exponential convergence has been shown. This thesis deals with various aspects of using RBFs in scientific computing problems. The first part treats the interpolation problem: instead of solving the interpolation equations, however, a quasi-interpolation procedure provides an approximate interpolation formula without solving any matrix system. We propose a multilevel scheme for achieving better smoothness of an existing univariate quasi-interpolation scheme for RBF, and prove its convergence. Then we extend the results to higher dimensions, and study a boundary padding technique that improves accuracy. Over the last decade or so, researchers have investigated the use of RBFs in the numerical solutions of ordinary (ODES) and partial differential equations (PDEs). In the second part of this thesis we introduce a new RBF collocation method for singularly perturbed boundary value problems (we implement this method for two-point boundary value problems). Our method can achieve high accuracy even for extremely thin layers, &epsi; = O (10&minus;12). We then modify our scheme to become adaptive, which results in a very robust method without the need for fine tuning parameters. In general, when using RBFs to solve PDEs, the resulting matrices are full and severely ill-conditioned. Therefore, applications of RBF-PDE were once restricted to problems of moderate size solved with direct methods. The third part of this thesis addresses this problem with a preconditioning technique based on approximate cardinal basis functions (ACBFs). We then couple the ACBF preconditioning technique with the domain decomposition method (DDM) which allows one to solve large-scale PDE problems in parallel.
A study of the model and algorithms for handling location-dependent continuous queries
Authors: Manish Gupta, Manghui Tu, Latifur Khan, Farokh Bastani, I-Ling Yen
Venue: Knowledge and Information Systems (2005)

Advances in wireless and mobile computing environments allow a mobile user to access a wide range of applications. For example, mobile users may want to retrieve data about unfamiliar places or local life styles related to their location. These queries are called location-dependent queries. Furthermore, a mobile user may be interested in getting the query results repeatedly, which is called location-dependent continuous querying. This continuous query emanating from a mobile user may retrieve information from a single-zone (single-ZQ) or from multiple neighbouring zones (multiple-ZQ). We consider the problem of handling location-dependent continuous queries with the main emphasis on reducing communication costs and making sure that the user gets correct current-query result. The key contributions of this paper include: (1) Proposing a hierarchical database framework (tree architecture and supporting continuous query algorithm) for handling location-dependent continuous queries. (2) Analysing the flexibility of this framework for handling queries related to single-ZQ or multiple-ZQ and propose intelligent selective placement of location-dependent databases. (3) Proposing an intelligent selective replication algorithm to facilitate time- and space-efficient processing of location-dependent continuous queries retrieving single-ZQ information. (4) Demonstrating, using simulation, the significance of our intelligent selective placement and selective replication model in terms of communication cost and storage constraints, considering various types of queries.
QoS provisioning in wireless networks: Research Articles
Authors: Dapeng Wu
Venue: Wireless Communications Mobile Computing (2005)

The next-generation wireless networks such as the fourth generation (4G) cellular systems are targeted at supporting various applications such as voice, data, and multimedia over packet-switched networks. Providing quality of service (QoS) guarantees for these applications is an important objective in the design of the next-generation wireless networks. In this paper, we overview the issues and techniques in QoS provisioning for wireless networks, and present some of our recent results in this area. Specifically, we survey the results in five sub-areas, namely, network services models, traffic specification, packet scheduling for wireless transmission, call admission control in wireless networks, and wireless channel characterization. For each sub-area, we address the particular issues, review major approaches and mechanisms, and discuss the trade-offs of the approaches. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Using scenarios to support traceability
Authors: Leila Naslavsky, Thomas A. Alspaugh, Debra J. Richardson, Hadar Ziv
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Software traceability is a recognized challenge in software development that can be ameliorated with requirements management tools. Traceability information can be used in a number of different software engineering activities such as software change impact analysis and testing One main challenge in the automation of software testing is mapping modeling concepts to code concepts. The level of granularity and the semantics supported by available requirements management tools do not, however, fully support such mapping, or more sophisticated requirement change impact analysis. Scenarios have been used as an alternative (and sometimes complementary) way to express requirements and system behavior throughout the phases of software development. Scenarios are used with different representation and semantics across software phases, and these can be related. This paper argues for exploring scenarios as one means for tracing requirements to code, and using this information to leverage automation of activities that benefit from traceability such as change impact analysis and software testing.
Testing High-Speed IO Links Using On-Die Circuitry
Authors: Priya Iyer, Shailendra Jain, Bryan Casper, Jason Howard
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper describes a novel technique to enable characterization of high-speed IO links and transceivers without the use of special external test equipment. The test circuit has been implemented in 7-metal90nm CMOS technology. A register file has been used to characterize a high-speed IO link by recording information such as the number of errors, the time of the error and to calibrate the transceiver circuit parameters. The testing approach uses the IEEE 1149.1 JTAG protocol to feed the control signals and to capture the status of key nodes in the transceivers. The high-speed register file operating at 625 MHz has been made seamlessly readable through the JTAG scan chain operating at a maximum of 80 MHz. The simulation results show that we can successfully test the system and capture the behavior of the transceiver and link.
GOMIT: A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distributions
Authors: In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate terms used to infer the target's property is collected and forms a unique distribution on the GO directed acyclic graph (DAG). We propose a generic and adaptive algorithm — GOMIT, which bases on term distributions and GO hierarchical characteristics to assign correct annotations for a target. We establish a quantitative model with parameters that can be trained for optimal performance for different applications. We propose several criteria for evaluating GOMIT's performance, and conducted three experiments involving a) automated functional annotations, b) biological annotations of microarray data clusters and c) protein family GO assignments. In these experiments, we used our proposed criteria to compare GOMIT with other algorithms. Results not only reflect GOMIT's generality and adaptability, but also suggest that GOMIT is better or comparable to other works for assigning correct annotations.
Training Support Vector Machines Using Gilbert's Algorithm
Authors: Shawn Martin
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Support Vector Machines are classifiers designed around the computation of an optimal separating hyperplane. This hyperplane is typically obtained by solving a constrained quadratic programming problem, but may also be located by solving a nearest point problem. Gilbert's Algorithm can be used to solve this nearest point problem but is unreasonably slow. In this paper we present a modified version of Gilbert's Algorithm for the fast computation of the Support Vector Machine hyperplane. We then compare our algorithm with the Nearest Point Algorithm and with Sequential Minimal Optimization.
Gesture spotting using wrist worn microphone and 3-axis accelerometer
Authors: Jamie A. Ward, Paul Lukowicz, Gerhard Tröster
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

We perform continuous activity recognition using only two wrist-worn sensors - a 3-axis accelerometer and a microphone. We build on the intuitive notion that two very different sensors are unlikely to agree in classification of a false activity. By comparing imperfect, jumping window classifications from each of these sensors, we are able discern activities of interest from null or uninteresting activities. Where one sensor alone is unable to perform such partitioning, using comparison we are able to report good overall system performance of up to 70% accuracy. In presenting these results, we attempt to give a more-in depth visualization of the errors than can be gathered from confusion matrices alone.
A Proposal of the Effective Recognition Method for Low-Resolution Characters from Motion Images
Authors: Makoto Nomura, Kazuhiko Yamamoto, Hirotaka Ohta, Kunihito Kato
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a new effective method for low-resolution character recognition from motion images. This method extracts the feature directly from low-resolution images first, and reconstructs the high-resolution feature. Since low-resolution characters of motion images are recognized, a general idea is to reconstruct a high-resolution image first by using these low-resolution images, and it is extracted the feature from that high-resolution image. Feature extraction process of our proposed method has different view of the general idea. Our proposed method has higher accuracy than the general idea in low-resolution characters recognition. We show advantages of it by comparative recognition experiments under the database images and motion images.
The View From Elsewhere: Perspectives on ALife Modeling
Authors: Michael Wheeler, Seth Bullock, Ezequiel Di Paolo, Jason Noble, Mark Bedau, Philip Husbands, Simon Kirby, Anil Seth
Venue: Artificial Life (2002)

Many artificial life researchers stress the interdisciplinary character of the field. Against such a backdrop, this report reviews and discusses artificial life, as it is depicted in, and as it interfaces with, adjacent disciplines (in particular, philosophy, biology, and linguistics), and in the light of a specific historical example of interdisciplinary research (namely cybernetics) with which artificial life shares many features. This report grew out of a workshop held at the Sixth European Conference on Artificial Life in Prague and features individual contributions from the workshop's eight speakers, plus a section designed to reflect the debates that took place during the workshop's discussion sessions. The major theme that emerged during these sessions was the identity and status of artificial life as a scientific endeavor.