ppxscal/embedding_network huggingface dataset:
Dynamic Protocol Aggregation and Adaptation for Service-Oriented Computing
Authors: Linh Duy Pham, Alan Colman, Jean-Guy Schneider
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Service Oriented Computing (SOC) is a paradigm for building new software applications from existing loosely-coupled services. During service composition, services available to play different roles in a composition may have variations in their business-level protocols. These protocols may involve communication between two services in a point-to-point relationship, or communication among more than two services. Furthermore, as the business processes change, those protocols need to be modified to reflect the changes. In this paper, we propose a method to describe protocols between roles that services will play in the composition by specifying the temporal constraints. An automated aggregation of those protocols is then carried out to produce role-centric views. Protocol compatibility of available services can then be checked against these views. We will show how our approach supports the incremental specification of protocols and the flexibility of changing protocols.
An efficient coding of LSP parameters using multiple type frame segmentation
Authors: Y. K. Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The transmission of spectral information consumes a large portion of total bit rate in medium-to-low bit rate speech coding. The conventional coding methods of LSP parameters generate redundant spectral information or spectral distortion by the fixed update rate of LSP parameters independent of the order of coefficients and phonetic context. We propose a multiple type frame segmentation (MTFS) method which allows various types of two-dimensional segmentation of speech frames to save the transmission rate of the LSP parameters without increasing the spectral distortion. The intra-frame spectral distortion (IFSD) is defined to measure the spectral distortion of the reconstructed spectrum. The proposed method generates a less distorted spectrum with fewer bits compared with the conventional single type frame segmentation (STFS) method.
Organizational Metacognition: The Importance of Knowing the Knowledge Network
Authors: John P. Looney, Mark E. Nissen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Knowledge networking is important to most competitive enterprises today. Enterprise knowledge is becoming ever more specialized in nature, so no single person or organization can know everything in detail. Hence addressing complex, multidisciplinary problems requires developing and accessing a network of knowledgeable people and organizations. The problem is, many otherwise knowledgeable people and organizations are not fully aware of their knowledge networks, and even more problematic, they are not aware that they are not aware. This focuses our attention toward organizational metacognition. The research described in this article involves fieldwork to investigate the metacognition phenomenon, at the organizational level, and to understand its effects in terms of knowledge networks and dynamics. Findings reveal insightful dynamic patterns and differential performance capabilities of various organizations, and highlight the importance of knowing the knowledge network. This work suggests immediate results amenable to practical application, and it suggests also an exciting agenda for continued research along the lines of this investigation.
Economic Aspects of Memory Built-in Self-Repair
Authors: Rei-Fu Huang, Chao-Hsun Chen, Cheng-Wen Wu
Venue: IEEE Design Test (2007)

The demand for built-in self-repair (BISR) methodologies that improve the yield of embedded memories is growing. A typical BISR scheme requires circuit modules that perform built-in self-test (BIST), built-in redundancy analysis (BIRA), real-time address remapping, and so on. The objective of BISR design is to maximize the final yield while keeping a reasonably low hardware overhead. In this work, the authors propose cost and benefit models, and evaluate the economic effectiveness of typical memory BISR implementations. They also present a simulator for that purpose based on the proposed cost models. The results are useful for evaluating the BISR schemes and implementations. Experimental results show that memory size impacts the cost-effectiveness of BISR more than production volume does.
Code composition as an implementation language for compilers
Authors: James M. Stichnoth, Thomas Gross
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Code composition is an effective technique for a compiler to implement complex high-level operations. The developer (i.e., the language designer or compiler writer) provides building blocks consisting of sequences of code written in, e.g., C, that are combined by a composition system to generate the code for such a high-level operation. The composition system can include optimizations not commonly found in compilers; e.g., it can specialize the code sequences based on loop nesting depth or procedure parameters. We describe a composition system, Catacomb, and illustrate its use for mapping array operations onto a parallel system.
Exploiting design patterns for improved efficiency in the testing of object-oriented software
Authors: John Bowles
Venue:  (2006)

The use of design patterns in software development has become more attractive given the rise in popularity of development tools utilizing a model driven architecture (MDA) philosophy. If a given piece of software is designed from a collection of standard design patterns, we should be able to test that software based on the designer's intent as captured by those patterns. In testing object oriented software, we must be aware that the state of an object at any time depends on the sequence of messages received by the object up to that point in time. As these messages are passed by method calls, the number of methods calls and the order in which they occur must be given consideration. A metric based on method coverage is suitable in this context. This dissertation examines the utility of design patterns in the practice of software testing. We employ a metric of method coverage to gauge the efficiency obtained by the inclusion of design patterns in two traditional test procedures, statistical design of experiments and reliability block diagrams. In the process, a new type of software system diagram, the Pattern Block Diagram, is developed.
Secure Software Development through Coding Conventions and Frameworks
Authors: Takao Okubo, Hidehiko Tanaka
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

It is difficult to apply existing software development methods to security concerns. Using software for security testing purposes, in particular, is hard to do. The fact that there is a restriction on the implementation of software affects the ease with which security can be tested. In this paper we propose a decision process of coding conventions for security, mindful of testing security. Then, we apply our method to preventing injection attacks on Web application programs, and establish some coding conventions that can be used against injection attacks and cross site scripting. We also discuss security frameworks, which are also useful as conventions.
SuperPin: Parallelizing Dynamic Instrumentation for Real-Time Performance
Authors: Steven Wallace, Kim Hazelwood
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Dynamic instrumentation systems have proven to be extremely valuable for program introspection, architectural simulation, and bug detection. Yet a major drawback of modern instrumentation systems is that the instrumented applications often execute several orders of magnitude slower than native application performance. In this paper, we present a novel approach to dynamic instrumentation where several non-overlapping slices of an application are launched as separate instrumentation threads and executed in parallel in order to approach real-time performance. A direct implementation of our technique in the Pin dynamic instrumentation system results in dramatic speedups for various instrumentation tasks - often resulting in orderof- magnitude performance improvements. Our implementation is available as part of the Pin distribution, which has been downloaded over 10,000 times since its release.
Simulation platform for UHF RFID
Authors: Vojtech Derbek, Christian Steger, Reinhold Weiß, Daniel Wischounig, Josef Preishuber-Pfluegl, Markus Pistauer
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Developing modern integrated and embedded systems require well-designed processes to ensure flexibility and independency. These features are related to exchangeability of hardware targets and to the ability of choosing the target at a very late stage in the implementation process. Especially in the field of ultra high frequency radio frequency identification (UHF RFID) the model-based design approach leads to expected results. Beside a clear design process, which is applied in this work to build the required system architecture, the scope for UHF RFID simulations is defined and an extendable platform based on The MathWorks Matlab Simulink&reg; is developed. This simulation platform, based on a multi-processor hardware target, using a Texas Instruments TMS320C6416 digital signal processor is able to run UHF RFID tag simulations of very high complexity. The highest effort is made to ensure flexibility to handle future simulation models on the same hardware target, realized by the continuous design and implementation flow of this platform based on model-based design.
Predicting Emergent Properties of Component Based Systems
Authors: Sutirtha Bhattacharya, Dewayne E. Perry
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Software Product Lines (SPL), Component Based Software Engineering (CBSE) and Commercial Off the Shelf (COTS) components provide a rich supporting base for creating software architectures. Further, they promise significant improvements in the quality of software configurations that can be composed from prebuilt components. Software architectural styles provide a way for achieving a desired coherence for such component-based architectures. This is because the different architectural styles enforce different quality attributes for a system. If the architectural style of an emergent system could be predicted in advance, the System Architect could make necessary changes to ensure that the quality attributes dictated by the system requirements were satisfied before the actual system was deployed. In this paper we propose a model for predicting architectural styles, and hence the quality attributes, based on use cases that need to be satisfied by a system configuration. Our technique can be used to determine stylistic conformance and hence indicate the presence or absence of architectural drift.
Multiuser detection with antenna arrays in the presence of multipath fading
Authors: T. A. Brown
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Multiuser detection has been shown to be an attractive alternative to conventional matched filter detection of CDMA signals. Most of the detection schemes studied however assume perfect channel knowledge. We study two multiuser detection schemes which operate over diversity channels and have access to only noisy channel estimates. The first is an optimum approach and the second is based on decorrelation detection. These detectors must combat not only multiuser interference but also channel estimation noise. Performance measures which separately gauge a multiuser detectors susceptibility to both of these impairments are introduced and evaluated for the proposed detectors. The decorrelation approach, while inferior in terms of rejecting multiuser interference, has the advantage of reduced sensitivity to channel estimation noise. This is illustrated in a simple two user, two diversity branch example.
Design of a system for real-time worm detection
Authors: B. Madhusudan, J. Lockwood
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Recent well publicized attacks have made it clear that worms constitute a threat to Internet security. Systems that secure networks against malicious code are expected to be a part of the critical Internet infrastructure in the future. Intrusion detection and prevention systems (IDPS) currently have limited use because they can filter only known worms. We present the design and implementation of a system that automatically detects new worms in real-time by monitoring traffic on a network. The system uses field programmable gate arrays (FPGAs) to scan packets for patterns of similar content. Given that a new worm hits the network and the rate of infection is high, the system is automatically able to detect an outbreak. Frequently occurring strings in packet payloads are instantly reported as likely worm signatures.
Ontology Driven CPG Authoring and Execution via a Semantic Web Framework
Authors: Sajjad Hussain, Syed Sibte Raza Abidi
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Clinical Practice Guidelines (CPG) are used by healthcare practitioners to standardize clinical practice and to provide evidence mediated health-care. Currently, there have been considerable efforts to computerize CPG so as to operationalize them within Clinical Decision Support Systems (CDSS) and to deploy them at the point of care. In our work, we take a semantic web approach - employing a domain ontology, a patient ontology, decision rules and a rule execution engine - towards the computerization and execution of CPG for CDSS. We present an ontology-driven approach for computerizing CPG and executing them based on individual patient instances. In our work we extend the Guideline Element Model (GEM) for computerizing CPG. We have (i) defined a CPG ontology based on the Document Type Definition (DTD) of GEM for ontologically representing a GEM encoded CPG; (ii) developed CPG decision logic definition tool and defined CPG rule syntax that allows practitioners to abstract and define decision logic rules based on the CPGs decision-variables inherent within the CPG; (iii) developed a forward-chaining CPG execution engine that executes the set of CPG execution logic rules using the JENA reasoning system; and (iv) implemented an automated justification tree generation module that provides the inference trace for the solution in order to assist practitioners in understanding the rationale for the proposed recommendations. In practice, given a patient instance our CDSS is able to derive CPG based clinical recommendations. We will present a working prototype of our CPG-based CDSS for the EU Radiation Protection 118 Referral Guideline for Imaging (RPG).
WinResMon: a tool for discovering software dependencies, configuration and requirements in microsoft windows
Authors: Rajiv Ramnath, Sufatrio Sufatrio, Roland H. C. Yap, Wu Yongzheng
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

This paper describes WinResMon, a system tool for determining resource usage and interactions among programs in Microsoft Windows environments. Think of WinResMon as a debugging tool to assist with software maintenance in a Microsoft Windows environment. It shows the current system state in terms of how resources are used and explains how the system arrived at that state. WinResMon can be used to determine how a program uses the registry and which files are needed by that program. WinResMon differs from other systems/tools in that it is integrated, designed to answer queries about resource usage and dependencies over time, and extensible, allowing the addition of new functions and tools.
Multi-agent learning via implicit opponent modeling
Authors: R. V. Bjarnason, T. S. Peterson
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We present a learning algorithm for two player stochastic games. The algorithm generates optimal deterministic finite automata (DFA) strategies against opponents who can be modeled by probabilistic action automata. The algorithm generates dynamic history trees based on statistical tests to eliminate state aliasing. Experiments are conducted in an iterated prisoner's dilemma environment.
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic
Authors: Abhishek Kashyap, Sudipta Sengupta, Randeep Bhatia, M. Kodialam
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

We consider the problem of joint routing, scheduling and transmission power assignment in multi-hop wireless mesh networks with unknown traffic. We assume the traffic is unknown, but the traffic matrix, which specifies the traffic load between every source-destination pair in the network, always lies inside a polytope defined by hose model constraints. The objective is to minimize the maximum of the total transmission power in the network over all traffic matrices in a given polytope. We propose efficient algorithms that compute a two-phase routing, schedule and power assignment, and prove the solution to be 3-approximation with respect to an optimal two-phase routing, scheduling and power assignment. We show via extensive simulations that the proposed algorithm has good performance at its worst operating traffic compared to an algorithm optimized for that traffic.
An any order generalization of JADE for complex source signals
Authors: E. Moreau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In this paper, considering the complex case, we extend some results leading to the popular JADE algorithm to cumulants of any order greater than or equal to three. We first exhibit a new contrast function which constitutes a generalization for the underlying contrast of JADE which thus appears as a particular case. Then we generalize the link between this new contrast and a joint-diagonalization criterion of a set of matrices. Moreover, in the two sources case, we show that the generalized contrast can be written as a simple quadratic form whatever the cumulant order. Finally, some computer simulations illustrate the potential advantage one can take of considering statistics of different orders for the joint-diagonalization of cumulant matrices. 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
Implementing parallelism and scheduling data flow graphs on Java virtual machine
Authors: J. Xu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present a scheme which explores the parallelism on a Java virtual machine (JVM). An algorithm, called dynamic-duplication scheduling is developed for solving the static scheduling and code generation for data flow graphs on the parallel JVM. Experimental results show that the schedule produced by the algorithm on the parallel JVM is significantly improved compared with the traditional JVM.
Face and palmprint pixel level fusion and Kernel DCV-RBF classifier for small sample biometric recognition
Authors: Xiao-Yuan Jing, Yong-Fang Yao, David Zhang, Jing-Yu Yang, Miao Li
Venue: Pattern Recognition (2007)

Recently, multi-modal biometric fusion techniques have attracted increasing atove the recognition performance in some difficult biometric problems. The small sample biometric recognition problem is such a research difficulty in real-world applications. So far, most research work on fusion techniques has been done at the highest fusion level, i.e. the decision level. In this paper, we propose a novel fusion approach at the lowest level, i.e. the image pixel level. We first combine two kinds of biometrics: the face feature, which is a representative of contactless biometric, and the palmprint feature, which is a typical contacting biometric. We perform the Gabor transform on face and palmprint images and combine them at the pixel level. The correlation analysis shows that there is very small correlation between their normalized Gabor-transformed images. This paper also presents a novel classifier, KDCV-RBF, to classify the fused biometric images. It extracts the image discriminative features using a Kernel discriminative common vectors (KDCV) approach and classifies the features by using the radial base function (RBF) network. As the test data, we take two largest public face databases (AR and FERET) and a large palmprint database. The experimental results demonstrate that the proposed biometric fusion recognition approach is a rather effective solution for the small sample recognition problem.
A new feedforward neural network hidden layer neuron pruning algorithm
Authors: F. Fnaiech
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper deals with a new approach to detect the structure (i.e. determination of the number of hidden units) of a feedforward neural network (FNN). This approach is based on the principle that any FNN could be represented by a Volterra series such as a nonlinear input-output model. The new proposed algorithm is based on the following three steps: first, we develop the nonlinear activation function of the hidden layer's neurons in a Taylor expansion, secondly we express the neural network output as a NARX (nonlinear autoregressive with exogenous input) model and finally, by appropriately using the nonlinear order selection algorithm proposed by Kortmann-Unbehauen (1988), we select the most relevant signals on the NARX model obtained. Starting from the output layer, this pruning procedure is performed on each node in each layer. Using this new algorithm with the standard backpropagation (SBP) and over various initial conditions, we perform Monte Carlo experiments leading to a drastic reduction in the nonsignificant network hidden layer neurons.
Panel: Lawyers, Judges and Digital Forensics: Evaluating Situational Awareness and Evidentiary Skills with Electronic Evidence, from Cybercrime to Civil Lawsuits.
Authors: Michael Losavio
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

This panel of attorneys, and others, will discuss situational awareness and skills of lawyers, judges and computing professionals relating to evidence law and rules of procedure for using electronic evidence and digital forensics. The panel may address the new Federal Rules of Civil Procedure for the discovery and handling of electronic evidence that are effective December 1, 2006, their impact in federal courts and their influence in state courts.
PLS classification of functional data
Authors: Cristian Preda, Gilbert Saporta, Caroline Lévéder
Venue: Computational Statistics (2007)

Partial least squares (PLS) approach is proposed for linear discriminant analysis (LDA) when predictors are data of functional type (curves). Based on the equivalence between LDA and the multiple linear regression (binary response) and LDA and the canonical correlation analysis (more than two groups), the PLS regression on functional data is used to estimate the discriminant coefficient functions. A simulation study as well as an application to kneading data compare the PLS model results with those given by other methods.