ppxscal/embedding_network huggingface dataset:
Scalable defense against internet bandwidth flooding attacks
Authors: David R. Cheriton
Venue:  (2007)

During a distributed bandwidth-flooding attack, a large number of attack sources coordinate to send a high volume of undesired traffic to the victim with the purpose of exhausting its bandwidth. These attacks have proved difficult (sometimes impossible) to combat, as they require that action be taken before the victim's tail circuit. Current practice is typically restricted to the victim's administrator asking their ISP to manually install filters to block the attack, an approach increasingly insufficient as attacks become more sophisticated. The intuitive response is to automate this process, i.e., enable the victim to automatically compute undesired-traffic signatures and send filtering requests to its ISP. Yet, this approach faces significant challenges: Given the magnitude of currently witnessed attacks, it is unlikely that an ISP alone has enough resources to protect multiple attacked clients. Moreover, asking for help from other ISPs is complicated, in that it requires special inter-ISP relationships that do not exist today and raises security issues. This dissertation presents Active Internet Traffic Filtering (AITF), an IP-layer defense mechanism against distributed bandwidth-flooding attacks that addresses these challenges. Three key points guide AITF design: An "attack source" is defined as an entity that has been asked to stop sending certain traffic and has been caught disobeying; this definition simplifies the task of the network and prevents misclassification of innocent hosts. Second, attack traffic is blocked at routers located close to the attack sources; this is key for the mechanism's scalability, as each network becomes responsible for blocking its own misbehaving clients. Finally, a network that hosts attack sources either cooperates and helps block attack traffic, or risks losing its access to the victim, which provides an incentive to cooperate. We show that AITF preserves a significant percentage of the victim's bandwidth, while the per-client cost for each participating ISP is already affordable by today's ISPs and not expected to increase as the Internet grows. We also show that AITF can be incrementally deployed in the Internet without any special inter-ISP relationships. We conclude that the IP-layer of the Internet can provide an effective, scalable and deployable solution against distributed bandwidth-flooding attacks.
Ethical responsibility and societal context: integrating ethics and public policy considerations in the engineering curriculum
Authors: J. R. Herkert
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

ABET's Engineering Criteria 2000 requires that graduates of engineering programs "have...an understanding of professional and ethical responsibility and "the impact of engineering solutions in a global and societal context". Curriculum models aimed at simultaneously addressing professional and ethical responsibility and the societal context of engineering have been successfully implemented at a number of institutions. A useful teaching method for addressing these two criteria in an integrated manner involves broadening discussions of engineering ethics so as to include the ethical implications of public policy issues in such areas as risk and product liability, sustainable development, and healthcare.
High performance I/O architectures and systems
Authors: Steve C. Chiu
Venue: The Journal of Supercomputing (2007)

I/O- and data-intensive workloads, as represented by the Grand Challenge problems, multimedia applications, cosmology simulations, climate modeling, and large collaborative visualizations, to name a few, entail innovative approaches to alleviate the I/O (both bandwidth and data access) performance bottlenecks. The advent of low-cost hardware platforms, such as the Beowulf clusters, has opened up numerous possibilities in mass data storage, scalable architectures, and large-scale simulations. The objective of this Special Issue is to discuss problems and solutions, to identify new issues, and to help shape future research and development directions in these areas. From these perspectives, the Special Issue addresses the problems encountered at the hardware, middleware, and application levels, providing conceptual as well as empirical treatments.
Efficient placement and routing algorithms for maximizing the lifetimes of wireless sensor networks
Authors: Subbarayan Venkatesan
Venue:  (2006)

We investigate the problem of placing sensor nodes, relay nodes and base stations in the sensor field such that (i) each point of interest in the field is covered by a subset of sensors; (ii) resulting sensor network is connected; (iii) the sensor network has sufficient bandwidth; (iv) the network is optimal with respect to the chosen objective. We analyzed several different objectives such as minimizing the number of sensor nodes deployed, minimizing the total cost, minimizing the energy consumption, maximizing the network lifetime and maximizing the network utilization. The placement problems for reliable as well as unreliable/probabilistic detection models are formulated as Integer Linear Programs. The practicality, effectiveness and performance of proposed strategies have been studied through simulations. We propose Minimum Cost Capacity-constrained Routing (MCCR) which minimizes the total energy consumed in routing without overloading nodes and links. We study the Maximum Lifetime Capacity-constrained Routing (MLCR) which balances the rate of energy consumption among sensor nodes such that the time until the first node drains-out its battery energy (among all the sensor nodes) is maximized. These protocols are derived from polynomial time network flow algorithms. Therefore, protocols are simple, scalable and efficient. We study the Lexicographic Maximum Lifetime (Lex-max-life) routing scheme where the objective is to maximize the time until the first set of sensor nodes deplete their battery energies, then maximize the depletion time for the second set of sensor nodes, and so on. We develop a fast approximation algorithm for Lex-max-life routing using Linear Programming (LP) solution technique. We also propose an LP based iterative algorithm which finds the optimal solution in polynomial time. When sensor nodes are equipped with non-adaptive transmitters, we show that Lax-max-life routing problem can be reduced to a convex-cost flow problem using a novel cost scaling technique. Since the convex-cost flow algorithms have polynomial time complexity and integrality property, the proposed algorithm is computationally very efficient and (practically) easy to implement. To the best of our knowledge, the proposed algorithm is the first algorithm that can find an integral optimal solution to Lex-max-life routing problem in polynomial time. In the cost scaling technique the cost numbers grow very fast. To overcome this limitation, we propose a novel vectorial representation of the link costs which (i) Improves running time complexity and (ii) Circumvents the number explosion phenomenon.
Accelerating Diagnosis via Dominance Relations between Sets of Faults
Authors: Rajsekhar Adapa, Spyros Tragoudas, Maria K. Michael
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

A new way of fault collapsing for effect-cause diagnosis is presented. In contrast to existing dominance-based-methods which operate on a pair of faults, the proposed method operates on pairs of sets of faults. The impact of the proposed method is evaluated with respect to effect-cause diagnosis. Experimental results show that the proposed collapsing methods can reduce the diagnostic simulation time on an average of 31% when compared to the existing techniques.
Articulatory copy synthesis using a nine-parameter vocal tract model
Authors: C. C. Goodyear, Dongbing Wei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The parameters of a nine-parameter vocal tract model, in conjunction with a time-domain articulatory synthesiser, have been optimised to fit, for nine English vowels, the measured vocal tract shapes and the first three formant frequencies for a particular speaker. Techniques have also been developed for interpolating each of the parameters among these nine vowel points in the f1,f2 plane. The method effectively defines a two-dimensional subspace of the parameter space, which is accessed by f1 and f2. Segments of speech consisting of vowels or vowel-vowel diphones may then be synthesised using formant tracks to determine the selection of the parameters of the model. Parameter values for selected consonants have also been obtained, based on magnetic resonance images. A three-formant interpolation technique allows transitions for the corresponding VC and CV diphones to be copied from natural speech.
Enterprise Information Architecture (EIA): Assessment of Current Practices in Malaysian Organizations
Authors: Rafidah Abd. Razak, Zulkhairi Md. Dahalin, Rohaya Dahari, Siti Sakira Kamaruddin, Sahadah Abdullah
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper we described the findings based on a research study on current Enterprise Information Architecture (EIA) practices in Malaysian organizations. Ten organizations from public and private sectors were chosen for case study analysis. The Zachman Framework was chosen as a guideline to assess the current practice of EIA in these organizations. This study had successfully investigated the current practice and conditions of EIA in selected public and private organizations in Malaysia. The study found that majority of the organizations do practice some kind of enterprise information architecture either in-house or outsource to third parties. The study also found that certain aspects of the framework were not addressed at all, whilst other aspects that were addressed vary in terms of the different perspectives. This gives a general outlook of EIA implementation in the selected organizations, which could be incomplete or not adequately addressed. The study revealed a poor knowledge and understanding of EIA among the organizations though there had been efforts at implementing EIA focusing on the Data, Function and Network architectures. The study discovered gaps in the current practice and provides suggestions for organizations to consciously embark on the EIA paradigm in order to better align the whole organization to its goals. Results of this study can be used by the government and private sectors to formulate new policies and guidelines on enterprise architecture so that the enterprise's IT adoption and information requirements fit nicely into its business strategy.
Children's cognitive processing of internet advertising
Authors: Dale Kunkel
Venue:  (2006)

This study employs a developmental perspective to test and link children's ability to discriminate between commercial and noncommercial content on the Internet, their ability to attribute persuasive intent to online commercial content, and the effects of exposure to Internet advertising. Hypotheses test a Developmental Model of Children's Cognitive Processing of Internet Advertising by predicting relationships between fundamental developmental abilities, children's applied cognitive defenses against Internet advertising, and effects outcomes. Finally, research questions explore the predictive value of fundamental cognitive processing variables versus age. Conceptual differentiation and perspective-taking are measured for 185 elementary school students ages 5-7 and ages 9-12. Participants are randomly assigned to a banner, a pop-up, or advergame condition, and exposed to commercial content and noncommercial content on a novel website. Commercial/noncommercial discrimination, attribution of persuasive intent, and effects outcomes are assessed. All children ages 5 to 12 have only modest ability to discriminate commercial from noncommercial content online. Older children have no advantage over younger children in identifying commercial content, but older children perform significantly better at identifying noncommercial content. For both age groups, advergames are significantly more difficult to identify than pop-up or banner advertisements. Children have low overall ability to attribute persuasive intent to an Internet advertisement. Older children perform significantly better than younger children, with no significant differences between treatment conditions. Conceptual differentiation and prior Internet exposure predict commercial/noncommercial discrimination ability for Internet advertising. Visual perspective-taking and social perspective-taking interact with commercial/noncommercial discrimination to predict attribution of persuasive intent to an Internet advertisement. Age is a stronger predictor than fundamental developmental skills of commercial/noncommercial discrimination and attribution of persuasive intent. Attribution of persuasive intent and product memory do not predict effects outcomes as expected. Nonetheless, children in any treatment group are significantly more likely to select the advertised product versus children in a baseline group. Overall, this study provides elaborate assessment of age-related differences in children's understanding of basic types of Internet advertising. It also provides partial support for the theoretical assertions underlying the Developmental Model of Children's Cognitive Processing of Internet Advertising.
Adaptive insertion policies for high performance caching
Authors: Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, Simon C. Steely, Joel Emer
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applications, the majority of lines traverse from the MRU position to the LRU position without receiving any cache hits, resulting in inefficient use of cache space. Cache performance can be improved if some fraction of the working set is retained in the cache so that at least that fraction of the working set can contribute to cache hits. We show that simple changes to the insertion policy can significantly reduce cache misses for memory-intensive workloads. We propose the LRU Insertion Policy (LIP) which places the incoming line in the LRU position instead of the MRU position. LIP protects the cache from thrashing and results in close to optimal hitrate for applications that have a cyclic reference pattern. We also propose the Bimodal Insertion Policy (BIP) as an enhancement of LIP that adapts to changes in the working set while maintaining the thrashing protection of LIP. We finally propose a Dynamic Insertion Policy (DIP) to choose between BIP and the traditional LRU policy depending on which policy incurs fewer misses. The proposed insertion policies do not require any change to the existing cache structure, are trivial to implement, and have a storage requirement of less than two bytes. We show that DIP reduces the average MPKI of the baseline 1MB 16-way L2 cache by 21%, bridging two-thirds of the gap between LRU and OPT.
A 2D extended HMM for speech recognition
Authors: Jiayu Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A two-dimensional extension of hidden Markov models (HMM) is introduced, aiming at improving the modeling of speech signals. The extended model (a) focuses on the conditional joint distribution of state durations given the length of utterances, rather than on state transition probabilities; (b) extends the dependency of observation densities to current, as well as neighboring states; and (c) introduces a local averaging procedure to smooth the outcome associated to transitions from successive states. A set of efficient iterative algorithms, based on segmental K-means and iterative conditional modes, for the implementation of the extended model, is also presented. In applications to the recognition of segmented digits spoken over the telephone, the extended model achieved about 23% reduction in the recognition error rate, when compared to the performance of HMMs.
On the Feasibility of Specialization within Software Engineering Degree Programs
Authors: Nancy R. Mead, Thomas B. Hilburn, James McDonald, Michael Ryan, Dan Shoemaker
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

The question that this panel will explore is the feasibility of specialization within software engineering degree programs, particularly at the undergraduate level. Over the years of software engineering curriculum development, we have seen good success in implementation of both undergraduate and graduate degree programs. We have also seen that some universities and students have shown an interest in specialization within these degree programs.
The impact of commercial computer software on undergraduate engineering education
Authors: C. N. Obiozor
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Personal computers running with Intel 80286, 80386, 80486 and Pentium microprocessors, and those based on the Motorola 68000 line of microprocessors enjoy the lion's share of the home computer market. These are respectively IBM and compatible PCs, and the Apple computers. The dominance of these PCs in homes and in educational institutions-from as early as kindergarten through high school to college-is a direct result of the falling cost of the microprocessor chips and the competition among PC manufacturers. Commercial computer software packages addressing specific applications are sold by various vendors and are used by undergraduate engineering students, educators and engineers alike, often with no knowledge of the model limitations and the algorithms employed in developing and writing the software. This trend, if unchecked, will naturally produce future engineers and scientists who see computer results as infallible truth, rather than those who should rightly view the results as subject to the limitations of the models employed in building the software. This paper advocates increased computer literacy at the classroom level in the form of getting more involved in software analysis, development and algorithms than is currently practiced. Suggestions are provided to enhance engineering education. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Historic data access in publish/subscribe
Authors: G. Li, A. Cheung, Sh. Hou, S. Hu, V. Muthusamy, R. Sherafat, A. Wun, H.-A. Jacobsen, S. Manovski
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

We develop a content-based publish/subscribe platform, called PADRES, which is a distributed middleware platform with features inspired by the requirements of workflow management and business process execution. These features constitute original additions to publish/subscribe systems and include an expressive subscription language, historic, query-based data access, composite subscription processing, a rule-based matching and routing mechanism, and the support for the decentralized execution of service-oriented applications.
A Galerkin Boundary Element Method for High Frequency Scattering by Convex Polygons
Authors: S. N. Chandler-Wilde, S. Langdon
Venue: SIAM Journal on Numerical Analysis (2007)

In this paper we consider the problem of time-harmonic acoustic scattering in two dimensions by convex polygons. Standard boundary or finite element methods for acoustic scattering problems have a computational cost that grows at least linearly as a function of the frequency of the incident wave. Here we present a novel Galerkin boundary element method, which uses an approximation space consisting of the products of plane waves with piecewise polynomials supported on a graded mesh, with smaller elements closer to the corners of the polygon. We prove that the best approximation from the approximation space requires a number of degrees of freedom to achieve a prescribed level of accuracy that grows only logarithmically as a function of the frequency. Numerical results demonstrate the same logarithmic dependence on the frequency for the Galerkin method solution. Our boundary element method is a discretization of a well-known second kind combined-layer-potential integral equation. We provide a proof that this equation and its adjoint are well-posed and equivalent to the boundary value problem in a Sobolev space setting for general Lipschitz domains.
Reducing the disk I/O of web proxy server caches
Authors: Carlos Maltzahn, Kathy J. Richardson, Dirk Grunwald
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

The dramatic increase of HTTP traffic on the Internet has resulted in wide-spread use of large caching proxy servers as critical Internet infrastructure components. With continued growth the demand for larger caches and higher performance proxies grows as well. The common bottleneck of large caching proxy servers is disk I/O. In this paper we evaluate ways to reduce the amount of required disk I/O. First we compare the file system interactions of two existing web proxy servers, CERN and SQUID. Then we show how design adjustments to the current SQUID cache architecture can dramatically reduce disk I/O. Our findings suggest two that strategies can significantly reduce disk I/O: (1) preserve locality of the HTTP reference stream while translating these references into cache references, and (2) use virtual memory instead of the file system for objects smaller than the system page size. The evaluated techniques reduced disk I/O by 50% to 70%.
Output-sensitive modular algorithms for polynomial matrix normal forms
Authors: Howard Cheng, George Labahn
Venue: Journal of Symbolic Computation (2007)

We give modular algorithms to compute row-reduced forms, weak Popov forms, and Popov forms of polynomial matrices, as well as the corresponding unimodular transformation matrices. Our algorithms improve on existing fraction-free algorithms. In each case, we define lucky homomorphisms, determine the appropriate normalization, as well as bound the number of homomorphic images required. The algorithms have the advantage that they are output-sensitive; that is, the number of homomorphic images required depends on the size of the output. Furthermore, there is no need to verify the result by trial division or multiplication. Our algorithms can be used to compute normalized one-sided greatest common divisors and least common multiples of polynomial matrices, along with irreducible matrix-fraction descriptions of matrix rational functions. When our algorithm is used to compute polynomial greatest common divisors, we obtain a new output-sensitive modular algorithm.