ppxscal/embedding_network huggingface dataset:
US-Japan collaboration on engineering education reform and evaluation
Authors: G. Kalonji
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

A collaboration between engineering educators in the US and Japan has been launched, focused on sharing information and strategies on the process of reform in the two countries. From the US side, most of the participants are active players in the NSF-sponsored Engineering Education Coalitions; from the Japan side, participants include faculty from both national universities and private universities, and representatives of government. The collaboration was initiated in July, 1995 with a bi-national workshop held at Semi-ah-moo, Washington. The second working meeting took place in November, 1995 in Osaka. Because of its central role in the process of change, evaluation methodologies have been a major focus of our effort, spanning evaluation of student learning, evaluation of teaching, and evaluation of reform at the institutional level. At our second working meeting in Osaka, several bi-national working groups were formed.
Design closure driven delay relaxation based on convex cost network flow
Authors: Chuan Lin, Aiguo Xie, Hai Zhou
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in high level synthesis. Delay relaxation that assigns extra clock latencies to functional resources at RTL (Register Transfer Level) can be leveraged. In this paper we propose a general formulation for design closure driven delay relaxation problem. We show that the general formulation can be transformed into a convex cost integer dual network flow problem and solved in polynomial time using the convex cost-scaling algorithm in [1]. Experimental results validate the efficiency of the approach.
Hardware-efficient pattern matching algorithms and architectures for fast intrusion detection
Authors: Paul Franzon
Venue:  (2006)

Intrusion detection processors are becoming a predominant feature in the field of network hardware. As demand on more network speed increases and new network protocols emerge, network intrusion detection systems are increasing in importance and are being integrated in network processors. Currently, most intrusion detection systems are software running on a general purpose processor. Unfortunately, it is becoming increasingly difficult for software based intrusion detection systems to keep up with increasing network speeds (OC192 and 10Gbps at backbone networks). Signature-based intrusion detection systems monitor network traffic for security threats by scanning packet payloads for attack signatures. Intrusion detection systems have to run at wire speed and need to be configurable to protect against emerging attacks. This dissertation describes the concept, structure and algorithms for a special purpose hardware accelerator designed to meet those demands. We consider the problem of string matching which is the most computationally intensive task in intrusion detection. A configurable string matching accelerator is developed with the focus on increasing throughput while maintaining the configurability provided by the software intrusion detection systems. A hardware algorithm for efficient data storage and fast retrieval is used to compress, store and retrieve attack signatures. Our algorithms reduce the size of the rules to fit on chip and enables intrusion detection to run at line rates and faster.
Goodearl and Aldred versus Hughes aircraft: a whistle-blowing case study
Authors: K. W. Bowyer
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Whistle-blowing is a core topic for any "ethics" or "professionalism" course offered for IS/CS/CE/EE majors. This paper documents a real whistle-blowing case that is ideal for use in teaching. The incident is set in the computing industry, specifically in the supply of micro-electronic chips for use in safety-critical systems. The incident is well documented, with decisions in both a criminal case and a civil case. It touches on all the major issues involved in whistle-blowing.
Accessibility tools
Authors: Guy Barker, Jane Prey
Venue: ACM SIGCSE Bulletin (2007)

There is great interest in Microsoft in developing applications and tools that enable better accessibility to technology to non-traditional users. We will demonstrate a set of tools [http://herbi.org/default.htm] that have been developed by various people in MS who are passionate about accessibility. These tools are in developmental form, but we are anxious to have the computing community look at them, use them and provide us with feedback on how to make them better.
Reduction-of-quality attacks on adaptation mechanisms
Authors: Azer Bestavros
Venue:  (2007)

One important consideration in realizing dependable computing systems and networks is to uncover vulnerabilities in their designs to adversarial attacks. Currently, the designs of these systems employ different forms of adaptation mechanisms in order to optimize their performance by ensuring that desirable properties, such as stability, efficiency and fairness, are not compromised. This thesis discovers and studies a new type of adversarial attacks that target such adaptation mechanisms by exploiting their dynamics of operation--- i.e., the characteristics of their transient behavior. We coin this new breed of adversarial attacks, Reduction of Quality (RoQ) attacks. The premise of RoQ attacks is to keep an adaptive mechanism constantly in a transient state, effectively depriving the system from much of its capacity and significantly reducing its service quality. In this thesis we develop a general control-theoretic framework that provides a unified approach to modeling and vulnerability assessment of the dynamics underlying RoQ exploits. Within this framework, we introduce and formalize the notion of an attack "Potency" that capitalizes on the attacker's best incentive: maximizing the marginal utility of its attack traffic. Unlike traditional brute-force Denial of Service attacks that aim to take down a system at any cost, RoQ attacks aim to maximize the damage inflicted on a system through consuming an innocuous, small fraction of that system's hijacked capacity. We instantiate our framework using detailed analytical models and associated metrics on a series of adaptation mechanisms that are commonly used in networking protocols, endsystem admission controllers and load balancers. We assess the impact of RoQ attacks using analysis, simulations, and Internet experiments. We identify key factors that expose the tradeoffs between resilience and susceptibility to RoQ attacks. These factors could be used to harden adaptation mechanisms against RoQ exploits, in addition to developing new forms of countermeasures and defense mechanisms.
Probabilistic mapping networks for speaker recognition
Authors: Haizhou Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The expectation-maximization (EM) algorithm is a general technique for maximum likelihood estimation (MLE). In this paper, we present two important theoretical issues concerning Gaussian mixture modeling (GMM) within the EM framework. First, we propose an EM algorithm for estimating the parameters of a GMM structure dedicated to speaker recognition, the probabilistic mapping network (PMN), where the Gaussian probability density function is realized as an internal node. Hence, the EM algorithm is extended to deal with the supervised learning of a multicategory classification problem and serves as a parameter estimator of the neural network classifier. Then, a generalized EM (GEM) algorithm is developed as an alternative to the MLE problem of PMN. The effectiveness of the proposed PMN architecture and developed EM algorithms are assessed by conducting a set of speaker recognition experiments. It is shown that GEM converges faster than EM to the same solution space.
Minitrack: E-Policy, Law, and Governance
Authors: Robert Krimmer, Keith A. Schildt, Pirkko Walden
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Policy issues and their analysis pertain to the digital divide, infrastructure development, open source, standards and educational uses of ICT. In addition, E-policies related to national development are covered in this minitrack. Governance refers to the system of directing and controlling the actions, affairs, policies and functions of a political unit, organization, or nation. E-governance is getting more attention, as it should ensure that the spending of public money to information and communication technology development, control and maintenance activities is done in a transparent, effective and efficient way. This should create a dynamic, creative public sector capable of anticipating on and being open, responsive, democratic and accountable.
On the capacity of linear time-varying channels
Authors: S. Barbarossa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Linear time-varying (LTV) channels are often encountered in mobile communications but, as opposed to the linear time-invariant (LTI) channels case, there is no a well established theory for computing the channel capacity, or providing simple bounds to the maximum information rate based only on the channel impulse response, or predicting the structure of the channel eigenfunctions. We provide: (i) a method for computing the mutual information between blocks of transmitted and received sequences, for any finite block length; (ii) the optimal precoding (decoding) strategy to achieve the maximum information rate; (iii) an upper bound for the channel capacity based only on the channel time-varying transfer function; and (iv) a time frequency representation of the channel eigenfunctions, revealing a rather intriguing, but nonetheless intuitively justifiable, bubble structure.
Dynamic hand gesture understanding-a new approach
Authors: M. Yeasin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The analysis of a dynamic hand gesture requires processing a spatio-temporal image sequence. The actual length of the sequence varies with each instantiation of the gesture. We propose a novel, vision based system for automatic interpretation of a limited set of dynamic hand gestures. This involves extracting the temporal signature of the hand motion from the performed gesture and is subsequently analyzed by a finite-state machine to automatically interpret the performed gesture.
Failure Resilience for Device Drivers
Authors: Jorrit N. Herder, Herbert Bos, Ben Gras, Philip Homburg, Andrew S. Tanenbaum
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Studies have shown that device drivers and extensions contain 3-7 times more bugs than other operating system code and thus are more likely to fail. Therefore, we present a failure-resilient operating system design that can recover from dead drivers and other critical components--primarily through monitoring and replacing malfunctioning components on the fly--transparent to applications and without user intervention. This paper focuses on the post-mortem recovery procedure. We explain the working of our defect detection mechanism, the policy-driven recovery procedure, and post-restart reintegration of the components. Furthermore, we discuss the concrete steps taken to recover from network, block device, and character device driver failures. Finally, we evaluate our design using performance measurements, software fault-injection experiments, and an analysis of the reengineering effort.
MIMO capacity performance for both narrowband and wideband systems
Authors: B. Kannan, F. Chin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Recent study in information-theory has demonstrated the enormous capacity potential of wireless communication system with multiple transmit and receive antennas. As a result, a number of layered space-time (BLAST) architectures have been proposed. In this paper, the capacity of narrowband and wideband (OFDM) systems in scattering channel models are analysed via Monte-Carlo simulations. In particular, we show that OFDM based MIMO system can combat pin-hole effect which degrades capacity.
Why Trust is not Proportional to Risk
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Trust is inherently related to risk, but for trust assessment to be integrated with the management of the risks involved in trust based cooperation, the exact relation must be well understood. Existing literature on trust management is neither clear nor unambiguous on this issue. This paper discusses notions of trust as presented within the disciplines of sociology and economics for the purpose of motivating trust management. A critical survey of state of the art literature on trust management is provided, where weaknesses and ambiguities with respect to clarifying the notion of trust are discussed. An analysis and explanation of the exact relationship between risk and trust is presented, and implications of the subjectivity of trust relations are accounted for.
Application of the synergetic control theory for training hidden markov models with biased neighborhood-simulated annealing algorithm
Authors: Juan E. Vargas
Venue:  (2006)

The dissertation focuses on problems related to training hidden Markov models (HMMs) and estimating their optimal dimensionality. Finding optimal solutions of these problems is crucial for the efficient application of HMMs in areas of science such as molecular biology, time series analysis, speech recognition, and other scientific endeavors that suffer from the 'data-deluge' phenomenon, which is likely to characterize most scientific pursuits in the 21st century. Most conventional algorithms that train HMMs from data are local search methods that can only find sub-optimal models and cannot guarantee global optimality. The difference in accuracy between locally and globally optimal HMMs can be quite significant and gets worse with the growth of complexity. This dissertation proposes an algorithm for optimal training HMMs that attempts to deal with the 'dimensionality curse'. The algorithm draws concepts from Simulated Annealing (SA), which is a widely known stochastic global optimization framework. Unfortunately, the global optimality of the SA framework does not come without a penalty. To guarantee global optimality SA requires a large number of iterations, which become intractable as the complexity of the training grows. This dissertation offers a solution based on a theory conceived to control non-linear dynamical processes; called Synergetic Control Theory (SCT). The connection between that theory and the problem at hand, is that SA is similar to a dynamical process which is to be controlled by an artifact that follows the principles of the SCT. In doing so, the SA process is coupled to a synergetic controller, which maintains the optimal operation mode of the training algorithm and significantly improves its convergence rate for multidimensional problems. The superior performance of the training algorithm with the synergetic controller is discussed in Chapters 3 and 4. The performance of the training algorithm---Biased Neighborhood-Simulated Annealing (BN-SA)---is demonstrated in Chapter 4, with an example related to the alignment of protein sequences. The BN-SA algorithm was used to train profile HMMs, which were compared to profile models produced by other training algorithms, such as the Baum-Welch and the Viterbi approximation to Baum-Welch. This comparison demonstrated that BN-SA produces significantly more accurate models than the conventional training algorithms. At the same time, due to the dimensionality reduction technique applied, BN-SA achieves its better accuracy at a significantly faster rate.
Intelligent fusion of evidence from multiple sources for text classification
Authors: Edward A. Fox
Venue:  (2006)

Automatic text classification using current approaches is known to perform poorly when documents are noisy or when limited amounts of textual content is available. Yet, many users need access to such documents, which are found in large numbers in digital libraries and in the WWW. If documents are not classified, they are difficult to find when browsing. Further, searching precision suffers when categories cannot be checked, since many documents may be retrieved that would fail to meet category constraints. In this work, we study how different types of evidence from multiple sources can be intelligently fused to improve classification of text documents into predefined categories. We present a classification framework based on an inductive learning method---Genetic Programming (GP)---to fuse evidence from multiple sources. We show that good classification is possible with documents which are noisy or which have small amounts of text (e.g., short metadata records)---if multiple sources of evidence are fused in an intelligent way. The framework is validated through experiments performed on documents in two testbeds. One is the ACM Digital Library (using a subset available in connection with CITIDEL, part of NSF's National Science Digital Library). The other is Web data, in particular that portion associated with the Cad&ecirc; Web directory. Our studies have shown that improvement can be achieved relative to other machine learning approaches if genetic programming methods are combined with classifiers such as kNN. Extensive analysis was performed to study the results generated through the GP-based fusion approach and to understand key factors that promote good classification.
Applications ported to the EELA e-Infrastructure
Authors: B. Marechal, P. H. Rausch Bello, D. Carvalho, Rafael Mayo
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The EELA Project (E-Infrastructure shared between Europe and Latin America) is a collaboration between Latin American and European institutions that has developed a potent e-Infrastructure for e-Science applications. Nowadays, several groups have ported their applications to the EELA Grid framework and are obtaining their first results thanks to the e-Infrastructure that has been created. This paper describes the applications already ported and the progress achieved so far.
Predicting QoS Characteristics on Wireless Networks
Authors: Paulo Salvador, Antonio Nogueira, Rui Valadas
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Nowadays, wireless network traffic exhibits peculiar and unpredictable behaviors that can be attributed to the combination of different factors: the varying number of users, the capacity of the network access points, network traffic matrices, users' mobility, background traffic, diversity of applications, services and user behaviors. This scenario creates an increasing need for tools that can cope with the continuous appearance of new applications and QoS requirements and is able to aid in the global management tasks of wireless IP networks. This paper proposes a novel modeling approach for wireless networks that is able to predict network Quality of Service (QoS) parameters, based only on measured or synthetically generated traffic, without requiring any information on the network structure or on the mobility patterns of network users. The solution to a specific modeling problem, using the proposed framework, is a two-step procedure: in the first step, the network model is constructed from a set of (past) values of the inbound/outbound traffic at the various network access points and a set of values of corresponding network QoS metrics; in the second step, the previously constructed model is used to predict (future) values of the QoS metrics based only on new inbound/outbound traffic values. This framework does not impose any restrictions to the type of metrics that are selected to characterize QoS. The results obtained show that this approach is able to achieve excellent performance for QoS prediction at multiple wireless access points, even when there are significant changes in the number of network users.
Modeling of data center airflow and heat transfer: State of the art and future trends
Authors: Jeffrey Rambo, Yogendra Joshi
Venue: Distributed and Parallel Databases (2007)

An assessment of the current thermal modeling methodologies for data centers is presented, with focus on the use of computational fluid dynamics and heat transfer as analysis tools, and model validation. Future trends in reduced or compact modeling of data center airflow and heat transfer are presented to serve as an overview of integrating rack-level compact models into full-scale facility level numerical computations. Compact models can be used to efficiently model data centers through varying model fidelity across length scales. Dynamic effects can be included to develop next-generation control schemes to maximize data center energy efficiency.
Recognize a Special Structure in Palmprint for Palm Medicine
Authors: Kuanquan Wang, Jing Liao, Xiangqian Wu, Henggui Zhang
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Palm medicine is an important part of Tradition Chinese Medicine (TCM), which has been widely practiced in China and southeast country of Asia. Palmprint is composed of many lines and some special structures which imply a number of diseases. In this paper a fuzzy approach is proposed to recognize one of special structures in palmprint which is a key process in automated palm diagnosis system. Firstly, a palm image is preprocessed and all palmprint lines are extracted. Secondly, the extracted palm-lines are transformed to an undirected graph according to the connection of the points on the palm-lines. Thirdly, three features are extracted from this graph and their membership functions are defined. Finally, these three features are utilized to recognize one special structure which is called mi structure. Applying our approach to 200 palmprint images, the experimental results are encouraging.
Developing applications with a UIMS
Authors: Daniel Klein
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

A User Interface Management System (UIMS) is a collection of programs and libraries that enables an application to be partitioned into functionally distinct component parts. This partitioning recognizes that any application is comprised of three types of components, each encompassing a separate domain of expertise. These are the application domain, the display technology domain, and the user interface domain. By separating the application into dialogue utilizing a collection of agents, development time is reduced and maintainability is enhanced. Because the dialogue views the agents as black boxes, the benefits of parallel development and independent maintenance and upgrade are realized. Display technology agents can be easily reused, enabling a corporate look-and-feel. Further, an application agent can be reused with different user interfaces, creating systems tailored to different classes of users. We describe the general features of the Alpha UIMS, and show how a complete application can be developed using such a User Interface Management System.