ppxscal/embedding_network huggingface dataset:
Detection and Honeypot Based Redirection to Counter DDoS Attacks in ISP Domain
Authors: Anjali Sardana, Krishan Kumar, R. C. Joshi
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

The inherent vulnerabilities in TCP/IP architecture give dearth of opportunities to DDoS attackers. The array of schemes proposed for detection of these attacks in real time is either targeted towards low rate attacks or high bandwidth attacks. Presence of low rate attacks leads to graceful degradation of QoS in the network thus making them further undetectable. In this paper, we propose a scheme that uses three lines of defense. The first line of defense is towards detecting the presence of low rate as well as high bandwidth attacks based on entropy variations in small time windows. The second line of defense identifies and tags attack flows in real time. The last line of defense is redirecting the attack flows to honeypot server that responds in contained manner to the attack flows, thus providing deterrence and maintaining QoS at ISP level. We validate the effectiveness of the approach with simulation in ns-2 on a Linux platform.
The Proposed IEEE 1000 Microcomputer System Bus Standard
Authors: Tim Elsmore, William Shields
Venue: IEEE Micro (1984)

P1000 specifies a simple, 8-bit, Eurocard-based backplane. Designed to be processor-independent, it can be used in stand-alone configurations or as a high-performance I/O channel in distributed systems.
Colorama: Architectural Support for Data-Centric Synchronization
Authors: Luis Ceze, Pablo Montesinos, Christoph von Praun, Josep Torrellas
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

With the advent of ubiquitous multi-core architectures, a major challenge is to simplify parallel programming. One way to tame one of the main sources of programming complexity, namely synchronization, is transactional memory (TM). However, we argue that TM does not go far enough, since the programmer still needs nonlocal reasoning to decide where to place transactions in the code. A significant improvement to the art is Data-Centric Synchronization (DCS), where the programmer uses local reasoning to assign synchronization constraints to data. Based on these, the system automatically infers critical sections and inserts synchronization operations. This paper proposes novel architectural support to make DCS feasible, and describes its programming model and interface. The proposal, called Colorama, needs only modest hardware extensions, supports general-purpose, pointer-based languages such as C/C++ and, in our opinion, can substantially simplify the task of writing new parallel programs.
An Improved Threshold Selection Algorithm Based on Particle Swarm Optimization for Image Segmentation
Authors: Kaiping Wei, Tao Zhang, Xianjun Shen, Jingnan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper proposes an effective threshold selection method of image segmentation based on particle swarm optimization (PSO), which is embedded into two-dimensional Otsu algorithm. Traditional image segmentation methods are time consuming computation and become an obstacle in real time application systems. In this paper, the threshold selection approach based on PSO is proposed to deal with threshold selection of image segmentation. The threshold is obtained through PSO. PSO is realized successfully in the process of solving the threshold selection problem. The experiments of segmenting images are illustrated to show that the proposed method can get ideal segmentation result with less computation cost.
Coupled hydrological-economic modelling for optimised irrigated cultivation in a semi-arid catchment of West Africa
Authors: H. Ahrends, M. Mast, Ch. Rodgers, H. Kunstmann
Venue: Environmental Modelling Software (2008)

A coupled model system, consisting of a distributed hydrological model and an economic optimisation model, communicating via model interfaces, is developed and applied to investigate regional interdependencies between irrigated agriculture and regional water balance and to identify optimised cultivation strategies. The coupled model is employed in the context of a case study in the Atankwidi catchment in the northern Guinea Sudan zone of West Africa. The physically based hydrologic model WaSiM [Schulla, J., Jasper, K., 2001] is used to simulate the water balance of this catchment including a small reservoir-irrigation system complex. The economics of irrigated crop cultivation are optimized under hydrological constraints using the non-linear optimisation model GAMS-ECIM, encoded in GAMS (General Algebraic Modelling System). The coupled model system is utilized for empirical model testing under fictitious scenarios involving variable water availability for irrigation. Interdependencies between irrigation water application quantities and the water balance were identified and maximum agricultural profit was calculated using the coupled model system. The coupled model system is designed as decision-support tool for local authorities and agricultural stakeholders in the Ghanaian Upper East Region (UER).
Computation of bases of free modules over the Weyl algebras
Authors: Alban Quadrat, Daniel Robertz
Venue: Journal of Symbolic Computation (2007)

A well-known result due to J.T. Stafford asserts that a stably free left module M over the Weyl algebras D=A"n(k) or B"n(k)-where k is a field of characteristic 0-with rank"D(M)>=2 is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the computation of bases of M. This algorithm, based on the new constructive proofs [Hillebrand, A., Schmale, W., 2001. Towards an effective version of a theorem of Stafford. J. Symbolic Comput. 32, 699-716; Leykin, A., 2004. Algorithmic proofs of two theorems of Stafford. J. Symbolic Comput. 38, 1535-1550] of J.T. Stafford's result on the number of generators of left ideals of D, performs Gaussian elimination on the formal adjoint of the presentation matrix of M. We show that J.T. Stafford's result is a particular case of a more general one asserting that a stably free left D-module M with rank"D(M)>=sr(D) is free, where sr(D) denotes the stable rank of a ring D. This result is constructive if the stability of unimodular vectors with entries in D can be tested. Finally, an algorithm which computes the left projective dimension of a general left D-module M defined by means of a finite free resolution is presented. It allows us to check whether or not the left D-module M is stably free.
The Multistage Cube: A Versatile Interconnection Network
Authors: H. J. Siegel
Venue: Computer (1981)

The cube network can support both MIMD and SIMD processing in distributed systems. It allows flexible communications in systems like PASM, PUMPS, and the BMD test bed.
REHIST: relative error histogram construction algorithms
Authors: Sudipto Guha, Kyuseok Shim, Jungchul Woo
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optimize absolute error measures for which the error in estimating a true value of 10 by 20 has the same effect of estimating a true value of 1000 by 1010. However, several researchers have recently pointed out the drawbacks of such schemes and proposed wavelet based schemes to minimize relative error measures. None of these schemes provide satisfactory guarantees - and we provide evidence that the difficulty may lie in the choice of wavelets as the representation scheme. In this paper, we consider histogram construction for the known relative error measures. We develop optimal as well as fast approximation algorithms. We provide a comprehensive theoretical analysis and demonstrate the effectiveness of these algorithms in providing significantly more accurate answers through synthetic and real life data sets.
Multimodal Recognition Based on Fusion of Ear and Profile Face
Authors: Xiaona Xu, Zhichun Mu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Ear recognition is proved to be a new and promising authentication technique. Because of ear's special physiological structure and location, it is reasonable to combine ear with profile face for recognition in such scenarios as frontal face images are not available. In this paper, a novel non-intrusive multimodal recognition technology based on ear and profile face is proposed. First, only the face profile-view images are captured for recognition. Then ear classifier and profile face classifier based on Full- Space Linear Discriminant Analysis (FSLDA) are set up. Finally decision fusion of ear and profile face is carried out using the combination methods of Product, Sum and Median rules according to the Bayesian theory and a modified Vote rule for two classifiers is presented. The results of experiment show that the recognition rate is higher than that of the recognition adopting the single feature, and that the recognition range is larger than that of both uni-modality.
Community-Based Scaffolding to Promote End-User Learning
Authors: Brian Dorn
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

End-user programming provides a unique opportunity to study informal computer science education and knowledge acquisition in the real world. We seek to explore the use of community-based scaffolding to deliver computing content knowledge to an audience of graphic design professionals who engage in scripting. We propose an online community that leverages prepared, instructional case studies alongside tools that promote collaborative development and code review activities.
Implementation of a virtual environment for traffic accident simulation
Authors: Fabian C. Hadipriono, Josann W. Duane, Zoltan A. Nemeth, Seungwon Won
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

A proper assessment of traffic accident site and prompt clearance actions with response emergency vehicles are crucial to reduce related congestion on freeways. Training novice officers in accident site management will reduce inappropriate assessment that delays rapid clearance response. The INtelligent TRaffic Evaluator for Prompt Incident Diagnosis using a Reality Engine (INTREPID-RE) simulates traffic accidents using the virtual reality technique. The system allows users to evaluate accidents as if they were present at a real accident site. The simulated traffic accidents generated by INTREPID-RE are based on a combination of vehicle types, highway conditions, visibility, and final position of the involved vehicles. In this first of a two-part paper, the research results in major features, such as the creation of an interactive user interface panel, seven highway configurations, five types of traffic vehicles, overturning condition of the vehicles, traffic cones, nighttime visibility, foggy weather conditions, animation of moving vehicles, and dynamic text display. These features are the essential ingredients for developing the virtual world discussed in the second part of the paper.
Adjusted R2-type measures for Tweedie models
Authors: Lila Ricci, Raúl Martínez
Venue: Computational Statistics Data Analysis (2008)

R^2-type measures are commonly used tools for assessing the predictive power of linear regression models; for generalized linear models this measure is based on deviances. For small samples, it is necessary to adjust R^2 for the number of covariates. This article shows that some of the adjustments that have been proposed for logistic, Poisson, gamma and inverse Gaussian models, can be expressed in a general form that covers all exponential dispersion models with power variance function (also called Tweedie models). The adjusted measure is asymptotically unbiased. Numerical results of a simulation study are presented to explore the estimator behavior under different sample sizes, different number of covariates and different population values of the adjusted deviance based measure. The performances of the adjusted measures are also investigated on a data set used by Box and Cox.
Automatic Segmentation of Brain Structures Based on Anatomic Atlas
Authors: Flavio Luiz Seixas, Jean Damasceno, Marcelo Pereira da Silva, Andrea Silveira de Souza, Debora C. Muchaluat Saade
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The non-invasive in vivo nature of magnetic resonance imaging (MRI) makes it the modality of choice of many neuroanatomical imaging studies. This paper discusses automatic brain structure segmentation based on anatomic atlas. Our goal is to use image-processing algorithms and previous knowledge statistical models for segmentation and labeling of brain regions in order to support radiologists to make clinical diagnosis. Practical experiments show the results of brain tissue classification process and automatic region labeling in order to segment accurately the hippocampus and measure its volume. Hippocampus volumetric information can be useful to evaluate patients with Alzheimer's disease. The final goal of this work is computer-aided diagnosis for brain diseases.
Adaptive Service Level Management
Authors: Mei-Chen Hsueh
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In the Aerospace industry, it is not unusual for an IT infrastructure, which consists of hundreds of applications, thousands of computers, and massive data storage, to serve only a single program. The quality requirement of services varies from time to time and ensuring the quality of services becomes extremely challenging. The difficulty is compounded if a cutting-edge new technology needs to be integrated with the existing services. From the IT service management standpoint, forecasting changes and adapting to changes are necessary to deliver high quality and cost-effective services. As a quality management system, there are two key elements, processes and techniques. This paper describes a practical experience of managing a large IT services and support. An adaptive service level management approach was used to deliver just-in-time quality services. Techniques, such as the reliability block diagram and scalability weight factor, were used to assist for determining the quality level of a large complex system.
A fast and elastic fingerprint matching algorithm using minutiae-centered circular regions
Authors: Haiyong Chen, Hongwei Sun, Kwok-Yan Lam
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Reliably and fast matching fingerprints is still a challenging problem in a fingerprint verification system. This paper proposes a minutiae matching algorithm that uses minutiae-centered circular regions to help ensure the speed of matching and the robustness to non-linear distortion. In our method, a circular region is constructed around each minutia, which can be regarded as a secondary feature. Using the constructed regions, the proposed algorithm can find matched minutiae more rapidly via regional matching. Since each minutia's region is formed from only a small area of the fingerprint, our algorithm is more tolerant to non-linear distortion when compared to global matching approaches. On the other hand, the area of the constructed region is much larger than that of local neighborhood in local matching approaches, which means that circular region, including a larger subnet of minutiae, is more reliable and distinct feature. Experiment results show our algorithm's good performance on processing speed and accuracy.
Intrusion Detection Using Ensemble of SVM Classifiers
Authors: Haijun Xiao, Fan Hong, Zhaoli Zhang, Junguo Liao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The Current researches show that different classifiers provide different results about the patterns to be classified. These different results combined together yields better performance than individual classifiers. An ideal classifier, which is popularly known as the ensemble approach, is combined to take the final decision instead rely on a single classifier for decision on our intrusion detection system. Weight voting rule, unlike majority voting rule, is a highlight of our ensemble performance. The remarkable highlight is choosing the optimal weights strategy. In the performance of our intrusion detection system, the weight values are based on the accuracy of a given data class actually classified by each classifier respectively. In fact, our experiments show that Intrusion Detection performances can be improved by combining an ensemble of SVM classifiers.
A Paradigm for the Design of Parallel Algorithms with Applications
Authors: I. V. Ramakrishnan
Venue: IEEE Transactions on Software Engineering (1983)

This paper proposes a model or paradigm for the development of parallel algorithms, gives an example of the proposed paradigm, and displays algorithms developed by application of the technique. The algorithm for the merge of two ordered lists developed through application of this technique is thought to be original. The paradigm proposed is to create composite unit operations which combine data movement between data structures with a conventional operation such as compare or add. The composite operation constructed for this study is based upon partitioning the data elements into two linear lists. Exchange of data between adjacent elements in each list are then combined with compares and adds to complete the composite operations. This composite operation can be implemented on at least the following computational architectures.
Photoluminescence studies from micropillars fabricated on IV-VI multiple quantum-well semiconductor structure
Authors: S. Mukherjee, S. Jain, F. Zhao, J. P. Kar, Z. Shi
Venue: Microelectronics Journal (2007)

Micropillars were fabricated on multiple quantum-well structure of PbSe/PbSrSe grown on top of BaF"2 substrate in molecular beam epitaxy (MBE). The photoluminescence spectra from the pillar structure, having a diameter of 5@mm and inter-pillar distance of 8@mm, was studied at various temperature starting from 77 to 300K. There had been an approximately consistent red-shift of photoluminescence peak of ~3.62cm^-^1 for unit K change in ambient temperature. The prominent and repeatable emission from the micropillars at various temperatures signified high crystalline nature of the fabricated micro-objects. This type of micropillar structure is one of the magnificent contenders of future opto-electronic micro-features.
Integrating Bayesian Theory and Fuzzy Logics with Case-Based Reasoning for Car-Diagnosing Problems
Authors: Chui-Yu Chiu, Chih-Chung Lo, Yan-Xin Hsu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper integrates fuzzy Bayesian classifier with case-based reasoning (CBR) for improving case retrieval performance. In traditional retrieval process, CBR uses similarity metric to calculate similarity degree between all former cases and new case. Then, it retrieves the highest one. However, it would cause computation complexity and waste time. Our proposed approach uses Bayesian classifier to classify case base, then retrieve similar cases. In the real world problems, attributes may not always be discrete; they might be continuous as well. When users encounter continuous attributes, they must define an appropriate conditional likelihood density function. In fact, defining an appropriate conditional likelihood function is difficult. The issue of defining conditional likelihood density function of continuous or attributes is critical. Besides, the choice of likelihood density function would affect the accuracy of Bayesian network. Therefore, we apply fuzzy set theory to Bayesian network to define an appropriate conditional likelihood density function. An efficient fuzzy Bayesian case-based reasoning (FB-CBR) was built to solve car-diagnosing problems. The result shows that our proposed model is better than conventional models both in case matching accuracy and computational efficiency.
On Legality Assertions in Euclid
Authors: D. B. Wortman
Venue: IEEE Transactions on Software Engineering (1979)

The design of the programming language Euclid requires that a compiler for the language produce legality assertions to aid in verification of programs written in the language. This paper analyzes the legality assertions that must be produced and discusses the impact that this requirement has on the implementation of the language.
A strategy for allowing meaningful and comparable scores in approximate matching
Authors: Carina F. Dorneles, Carlos A. Heuser, Viviane Moreira Orengo, Altigran S. da Silva, Edleno S. de Moura
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

The goal of approximate data matching is to assess whether two distinct data instances represent the same real world object. This is usually achieved through the use of a similarity function, which returns a score that defines how similar two data instances are. If this score surpasses a given threshold, both data instances are considered as representing the same real world object. The score values returned by a similarity function depend on the algorithm that implements the function and have no meaning to the user (apart from the fact that a higher similarity value means that two data instances are more similar). In this paper, we propose that instead of defining the threshold in terms of the scores returned by a similarity function, the user specifies the precision that is expected from the matching process. Precision is a well known quality measure and has a clear interpretation from the user's point of view. Our approach relies on mapping between similarity scores and precision values based on a training data set. Experimental results show the training may be executed against a representative data set, and reused for other databases from the same domain.
On-Chip Interconnection Architecture of the Tile Processor
Authors: David Wentzlaff, Patrick Griffin, Henry Hoffmann, Liewei Bao, Bruce Edwards, Carl Ramey, Matthew Mattina, Chyi-Chang Miao, John F. Brown III, Anant Agarwal
Venue: IEEE Micro (2007)

iMesh, the Tile Processor Architecture's on-chip interconnection network, connects the multicore processor's tiles with five 2D mesh networks, each specialized for a different use. Taking advantage of the five networks, the c-based iLib interconnection library efficiently maps program communication across the on-chip interconnect. The Tile Processor's first implementation, the TILE64, contains 64 cores and can execute 192 billion 32-bit operations per second at 1 GHz.
On the Performance of Interleaved Memories with Multiple-Word Bandwidths
Authors: E. G. Coffman, G. J. Burnett, R. A. Snowdon
Venue: IEEE Transactions on Computers (1971)

Past studies of the performance of interleaved memory systems are extended in this note by adopting a more general model. The model assumes a system of N memory modules, each of which is made up of b submodules. Successive memory addresses are assigned to sequential submodules, modulo Nb. For increased effective memory bandwidth a so-called conflict buffer of size L + 1 is assumed to exist for storing address conflicts.