ppxscal/embedding_network huggingface dataset:
Efficient multi-match packet classification with TCAM
Authors: Fang Yu, R. H. Katz
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Today's packet classification systems are designed to provide the highest priority matching result, e.g., the longest prefix match, even if a packet matches multiple classification rules. However, new network applications, such as intrusion detection systems, require information about all the matching results. We call this the multi-match classification problem. In several complex network applications, multi-match classification is immediately followed by other processing dependent on the classification results. Therefore, classification should be even faster than the line rate. Pure software solutions cannot be used due to their slow speeds. We present a solution based on ternary content addressable memory (TCAM), which produces multi-match classification results with only one TCAM lookup and one SRAM lookup per packet - about ten times fewer memory lookups than a pure software approach. In addition, we present a scheme to remove the negation format in rule sets, which can save up to 95% of TCAM space compared with the straight forward solution. We show that using our pre-processing scheme, header processing for the SNORT rule set can be done with one TCAM and one SRAM lookup using a 135 KB TCAM.
Virtual CGH: Prediction of Novel Regions of Chromosomal Alterations in Tumor from Gene Expression Profiling
Authors: Huimin Geng, Javeed Iqbal, Xutao Deng, Wing C. Chan, Hesham Ali
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The identification of genetic alterations using array Comparative Genomic Hybridization (CGH) would provide important insights into the mechanisms of tumorogenesis. High resolution array CGH are very expensive and the experiment require a separate sample, therefore, we developed a computational method for predicting gains and losses of genomic DNA segments based on mRNA expression profiles of tumor cell lines, and called this method a Virtual CGH (vCGH) predictor. VCGH is performed through a novel algorithm in which each chromosomal segment is evaluated by the gene transcriptional profiles. The calculation yields a log of odds (LOD) score for each chromosomal segment and this likelihood-based score is used to predict the correlation between mRNA expression patterns and DNA copy number alterations. By aligning all regions of gains and losses from multiple cell lines we can identify minimal common regions of gains and losses which may contain potential oncogenes or tumor suppressors. This method can be used to screen transcriptional profiles of other malignancies for the identification of DNA segmental loss or gain.
Speech recognition in a reverberant environment using matched filter array (MFA) processing and linguistic-tree maximum likelihood linear regression (LT-MLLR) adaptation
Authors: P. Raghavan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Performance of automatic speech recognition systems trained on close-talking data suffers when used in a distant-talking environment due to the mismatch in the training and testing conditions. Microphone array sound capture can reduce some mismatch by removing ambient noise and reverberation but offers insufficient improvement in performance. However, using array signal capture in conjunction with a hidden Markov model (HMM) adaptation on the clean-speech models can result in improved recognition accuracy. This paper describes an experiment in which the output of an 8-element microphone array system using MFA processing is used for speech recognition with LT-MLLR adaptation. The recognition is done in two passes. In the first pass, an HMM trained on clean data is used to recognize the speech. Using the results of this pass, the HMM model is adapted to the environment using the LT-MLLR algorithm. This adapted model, a product of MFA and LT-MLLR, results in improved recognition performance.
Semantic Integration of Heterogeneous Databases on the Web
Authors: Niladri Chatterjee, Madhav Krishna
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The Web is replete with databases, many of which are modeled on the relational paradigm. Currently, for the purpose of simultaneous querying data from multiple databases, the federated database technique is used extensively. However, the effectiveness of such a technique is suspect when it comes to querying heterogeneous databases. Therefore, it becomes imperative to develop an efficient methodology for the semantic integration of heterogeneous online databases. This may be realized by defining a mapping from a relational database to a description that utilises the Resource Description Framework (RDF). Such a representation would be machine processable and would make the semantics as expressed by databases more explicit and, thereby, facilitate their integration.
Synergies of Data Mining and Operations Research
Authors: Stephan Meisel, Dirk Chr. Mattfeld
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Operations Research and Data Mining are consistently described in terms of systems theory. Application targets and process models for both paradigms are compared. Three classes of synergies from the integration of the two are distinguished. This classification can serve as a framework for the assessment of approaches at the intersection of Operations Research and Data Mining.
Making the `MOST' out of RFID technology: a research agenda for the study of the adoption, usage and impact of RFID
Authors: John Curtin, Robert J. Kauffman, Frederick J. Riggins
Venue: Information Technology and Management (2007)

Radio frequency identification (RFID) technology dramatically increases the ability of the organization to acquire a vast array of data about the location and properties of any entity that can be physically tagged and wirelessly scanned within certain technical limitations. RFID can be applied to a variety of tasks, structures, work systems and contexts along the value chain, including business-to-business logistics, internal operations, business-to-consumer marketing, and after-sales service applications. As industry adoption of RFID increases there is an emerging interest by academic researchers to engage in scholarly investigation to understand how RFID relates to mobility, organizational and systems technologies (MOST). In this paper, we explore RFID and propose a research agenda to address a series of broad research questions related to how RFID technology: (1) is developed, adopted, and implemented by organizations; (2) is used, supported, and evolved within organizations and alliances; and (3) impacts individuals, business processes, organizations, and markets. As with many technological innovations, as the technical problems associated with implementing and using RFID are addressed and resolved, the managerial and organizational issues will emerge as critical areas for IS research.
Modeling Propagation Dynamics of Bluetooth Worms
Authors: Guanhua Yan, Stephan Eidenbenz
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

The growing popularity of mobile devices in the last few years has made them attractive to virus and worm writers. One communication channel exploited by mobile malware is the Bluetooth interface. In this paper, we present a detailed analytical model that characterizes the propagation dynamics of Bluetooth worms. Our model captures not only the behavior of the Bluetooth protocol but also the impact of mobility patterns on the Bluetooth worm propagation. Validation experiments against a detailed discrete-event Bluetooth worm simulator reveal that our model predicts the propagation dynamics of Bluetooth worms with high accuracy.
Forecasting user demand for wireless services
Authors: Colin Blackman, Simon Forge, Erik Bohlin, Bernard Clements
Venue: Telematics and Informatics (2007)

This article reports the findings of a study for the European Commission to forecast demand for mobile communications services up to 2020. The study used a socio-economic approach including scenarios to explore the future and an original methodology for estimating traffic volumes under different socio-economic conditions. This article describes the objectives, outlines the methodology and summarises the results of the study. The study's findings lay the foundation for a European consensus for calculating future spectrum requirements and are an important part of the process in the lead up to the World Radiocommunication Conference in 2007.
Multiclass multiple kernel learning
Authors: Alexander Zien, Cheng Soon Ong
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kernels. By enforcing sparse coefficients, it also generalizes feature selection to kernel selection. We propose MKL for joint feature maps. This provides a convenient and principled way for MKL with multiclass problems. In addition, we can exploit the joint feature map to learn kernels on output spaces. We show the equivalence of several different primal formulations including different regularizers. We present several optimization methods, and compare a convex quadratically constrained quadratic program (QCQP) and two semi-infinite linear programs (SILPs) on toy data, showing that the SILPs are faster than the QCQP. We then demonstrate the utility of our method by applying the SILP to three real world datasets.
What can Children Learn through Game-based Learning Systems?
Authors: Masanori Sugimoto
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

In this talk, I will present key ideas and underlying philosophies of our research projects. I will also describe about several systems for supporting children's collaborative learning, such as CarettaKids, T-RHYTHM, and so on. Lessons learned through the design and evaluation of these systems, and some thoughts for DIGITEL researches will be discussed.
User Assessment of E-negotiation Systems
Authors: Gregory E. Kersten, Jamshid Etezadi, Eva Chen, Rudolf Vetschera
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A study of over 2000 students and professionals who used the Inspire e-negotiation system led Vetschera, Kersten and Koeszegi [1] to the formulation of an assessment model for internet-based systems (AMIS). The model was used to determine factors leading to a high user acceptance of the technology exemplified by Inspire. This paper presents a follow up study that uses structured equation modeling to verify AMIS and its empirical results. The focus is on the examination of the users' assessment of the system and their intention to use it, while taking into consideration its key features. In addition, the impact of gender is tested on the model to relate important differences in perceptions.
The application of object-oriented design techniques to the evolution of the architecture of a large legacy software system
Authors: Jeff Mason, Emil S. Ochotta
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Object Oriented Analysis and Design (OOAD) is increasingly popular as a set of techniques that can be used to initially analyze and design software. Unfortunately, OOAD is a relatively new concept and many large legacy systems predate it. This paper presents the approach one company followed in applying OOAD techniques to an existing 2.5 million line code base. We present an iterative process that provides an avenue for the software to evolve while balancing the needs of business and software engineering. Our case study reveals the many pitfalls that can derail a software re-engineering effort, but also shows promising initial results from continued perseverance in this effort.
Collaborative Distributed Admission Control (CDAC) for Wireless Network
Authors: Thinh Nguyen, Kien Nguyen, Linhai He
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In this paper, we propose a framework for performing distributed admission control in a collaborative wireless environment. In particular, a wireless device will not inject a new flow into a wireless network if it determines that by doing so, there is not enough resources to support all the existing flows. Our contributions are three-fold. First, we propose a slight modification to 802.11x based network to improve the bandwidth efficiency. Specifically, doubling the contention window size after a collision is no longer necessary in the modified 802.11x based network. Second, we provide a performance analysis for the modified 802.11x based wireless networks with multiple flows having different throughput requirements. Third, using the theoretical analysis, we propose two distributed admission control algorithms based on the transmission opportunity (TXOP) and the contention window size. Simulation results confirm our theoretical predictions on the performance of the proposed admission control algorithms.
The communication complexity of uncoupled nash equilibrium procedures
Authors: Sergiu Hart, Yishay Mansour
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We study the question of how long it takes players to reach a Nashequilibrium in uncoupled setups, where each player initially knowsonly his own payoff function. We derive lower bounds on the communication complexity of reaching a Nash equilibrium, i.e., on thenumber of bits that need to be transmitted, and thus also on the requirednumber of steps. Specifically, we show lower bounds that are exponential inthe number of players in each one of the following cases: (1) reaching apure Nash equilibrium; (2) reaching a pure Nash equilibrium in a Bayesiansetting; and (3) reaching a mixed Nash equilibrium. We then show that, incontrast, the communication complexity of reaching a correlated equilibriumis polynomial in the number of players.
Analysis of Knee-Joint Vibroarthrographic Signals Using Statistical Measures
Authors: Rangaraj M. Rangayyan, Yunfeng Wu
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Vibrations emitted from a knee joint during flexion or extension are expected to be associated with pathological conditions in the joint. Externally detected vibroarthrographic (VAG) signals may be useful indicators of roughness, softening, breakdown, or the state of lubrication of the articular cartilage surfaces of the joint. Computer-aided analysis of VAG signals could provide quantitative indices for noninvasive diagnosis of articular cartilage breakdown and staging of osteoarthritis. We propose the use of statistical parameters of VAG signals, such as the form factor involving the variance of the signal and its derivatives, skewness, kurtosis, and entropy, to classify VAG signals as normal or abnormal, that is, perform screening. With 89 VAG signals, screening efficiency of up to 0.78 was achieved, in terms of the area under the receiver operating characteristics curve, using the parameters mentioned above with a neural network classifier based on radial basis functions.
Construction of the acoustic inventory for a Greek text-to-speech concatenative synthesis system
Authors: C. Christogiannis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The development of the Greek text-to-speech (TTS) system by NTUA is based on the method of concatenative synthesis and follows the Bell Labs approach to this technique. Concatenative synthesis is one of the simplest methods for speech synthesis and at the same time bypasses most of the problems encountered by articulatory and formant synthesis techniques. The method relies on designing and creating the acoustic inventory of the language by taking real recorded speech, cutting it into segments and concatenating these segments back together during synthesis. The design and implementation of the acoustic database is a key factor for the performance of the synthesizer, since all the possible phone-to-phone transitions must be considered in order to minimize abrupt discontinuities and thus maximize the naturalness of the synthesized utterances.
Skeleton-Based Surface Reconstruction for Visualizing Plant Roots
Authors: Xuhong Tian, Guoqiang Han, Maozi Chen, Zhiyuan Situ
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we present a skeleton-based triangular surface reconstruction method for visualizing plant roots. The proposed method models plant roots as generalized cylinders. A generalized cylinder is constructed by sweeping a two-dimensional cross section along an axis in three-dimensional space. In order to efficiently construct a generalized cylinder, all the cross sections are first generated and sampled in the xy plane, and then they are rotated and translated into three-dimensional space. This technique also simplifies triangular surface construction. The computational advantage of the proposed method is demonstrated by experimental results.
Secure coprocessor integration with kerberos V5
Authors: Naomaru Itoi
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

The nightmare of Trusted Third Party (T3P) based protocol users is compromise of the T3P. Because the compromised T3P can read and modify any user information, the entire user group becomes vulnerable to secret revelation and user impersonation. Kerberos, one of the most widely used network authentication protocols, is no exception. When the Kerberos Key Distribution Center (KDC) is compromised, all the user keys are exposed, thus revealing all the encrypted data and allowing an adversary to impersonate any user. If an adversary has physical access to the KDC host, or can obtain administrator rights, KDC compromise is possible, and catastrophic. To solve this problem, and to demonstrate the capabilities of secure hardware, we have integrated the IBM 4758 secure coprocessor into Kerberos V5 KDC. As a result of the integration, our implemented KDC preserves security even if the KDC host has been compromised.
The effect of tendons on foot skin deformation
Authors: Y. M. Tang, K. C. Hui
Venue: Computer-Aided Design (2007)

Anatomical human models are usually divided into layers including skin, muscle and skeleton. In spite of the realistic animation of the models that can be achieved, and the realistic appearance of the model determined by the underlying muscles and skeleton, the role of tendons in determining the deformation of skin surface has not been well addressed. This paper presents an approach for modeling human foot tendons and determines their influence on the skin layer deformation. Our goal is to model deformation of the tendons such that a realistic foot simulation can be obtained. An anatomical foot model including skin, muscle, tendon and skeleton layers is adopted. The appearance of the skin layer is determined based on the underlying layers. To allow interactive deformation of the tendon models, the axial deformation technique is adopted. Given the position of the foot and the basis function, the position of the data points that control the axial curve is updated. To allow more accurate computation of the data point positions, a method that estimates the basis function based on real data obtained from foot images is also presented. Experimental results showed that the axial deformation technique can model deformation of the foot tendons with satisfactory visual realism. With the tendon deformation, the visual realism on the skin deformation is also enhanced.
Two-Dimensional Bar-Code Decoding with Camera-Equipped Mobile Phones
Authors: Tasos Falas, Hossein Kashani
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Data entry for mobile phones has always been limited by the phone's numeric keypad. One way to overcome this is through two-dimensional bar-codes read by the phone's camera. This paper presents two-dimensional bar-code reading using camera phones. Bar-code reading applications use the phone's camera to capture an image of a bar-code, and then use the phone's processor for decoding. They have been mostly developed in native code for a limited number of phone platforms. In contrast, development for Java-enabled phones allows bar-code reading regardless of the phone manufacturer and/or platform. It is argued that Java is a viable alternative if software is carefully crafted. A review of attempts in the use of mobile phones as bar-code readers, and a novel implementation of this technology, with very promising results, are presented.
Performance aware secure code partitioning
Authors: S. H. K. Narayanan, M. Kandemir, R. Brooks
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized computing entities. In many scenarios, these entities do not rely on each other, yet they need to work on a secure application in parallel to complete application execution under the specified deadline. Our focus in this paper is on compiler-guided secure code partitioning among a set of hosts. The scenario targeted involves a set of hosts that want to execute a secure embedded application in parallel. The various hosts have different levels of access to the data structures manipulated in the application. Our approach partitions the application among the hosts such that the load imbalance across hosts is minimized to reduce execution time while ensuring that no security leak occurs.
Preparing Students for Software Engineering Research
Authors: Ita Richardson
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Discussions of software engineering education tend to focus on the needs of industry and the preparation of graduates for professional careers. This is understandable, and may even be appropriate, but what about those who hope to go on to do research in software engineering - how well are we catering for them?
Foreword
Authors: Lusheng Wang
Venue: Algorithmica (2007)

This special issue contains six selected papers that were presented at the 11th Annual International Computing and Combinatorics Conference (COCOON 2005), held in Kunming, Yunnan, China on August 16&#x2013;19, 2005. This year we obtained 353 submissions and 96 of them were accepted for presentation at the conference. These six selected papers represent several areas in theoretical computer science, including complexity, computational biology, computational finance, and network algorithms. We thank the authors for submitting and revising their work, and PC members and referees for their careful reviewing.
Avoider--Enforcer games
Authors: Dan Hefetz, Michael Krivelevich, Tibor Szabó
Venue: Journal of Combinatorial Theory Series A (2007)

Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K"2"n for every q=