ppxscal/embedding_network huggingface dataset:
POSAML: A Visual Modeling Framework for Middleware Provisioning
Authors: Dimple Kaul, Arundhati Kogekar, Aniruddha Gokhale, Jeff Gray, Swapna Gokhale
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Effective provisioning of next generation distributed applications hosted on diverse middleware platforms incurs significant challenges due to the applications' growing complexity and quality of service (QoS) requirements. An effective provisioning of the middleware platform includes a composition and configuration of the middleware services thatmeets the applicationQoS requirements under expected workloads. Traditional techniques for middleware provisioning tend to use non-intuitive, low-level and technologyspecific approaches, which are tedious, error prone, nonreusable and not amenable to ease of QoS validation. Additionally, most often the configuration activities of the middleware platform tend to be decoupled from the QoS validation stages resulting in an iterative trial-and-error process between the two phases. This paper describes the design of a visual modeling language called POSAML (Patterns Oriented Software Architecture Modeling Language) and associated tools that provide an intuitive, higher level and unified framework for provisioning middleware platforms. POSAML provides visual modeling capabilities for middleware-independent provisioning while allowing automated middleware-specific QoS validation.
Retrieving sinusoids in colored Rayleigh noise by a cumulant-based FBLP approach
Authors: R. R. Ghauieb
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

It is known that sinusoids generate lines in their spectra but false lines may appear due to additive colored noise. Employing the fourth-order cumulant of the noisy sinusoids for retrieving the sinusoids has become an approach to handling Gaussian noise either white or colored. But the assumption that the noise is Gaussian does not exist in some applications. This paper presents a new investigation of employing cumulants for retrieving sinusoids in colored non-Gaussian noise. It is concerned with estimating the frequencies and spectrum of the sinusoids and no attention is given to the amplitudes. It is shown theoretically and experimentally that employing cumulants is an attractive approach to handling colored Rayleigh noise. Results of a presented cumulant-based forward-backward linear prediction (CBFBLP) approach are compared with that of a correlation-based counterpart.
The bgn public-key cryptosystem and its application to authentication, oblivious transfers, and proof-of-visit
Authors: Victor K. Wei
Venue:  (2006)

In The Second Theory of Cryptography Conference (TCC 2005), Boneh, Goh, and Nissim proposed a new structure of bilinear groups that have a composite order and a new cryptosystem which is intractable on a decisional problem over the subgroup in such structure [BGN05]. Their proposal, which referred to as the BGN cryptosystem by researchers, receive much attention and is quickly followed by two publications in CRYPTO'05 [BI05, OI05]. The BGN cryptosystem is a dual homomorphic public-key cryptosystem that enables the evaluation of 2-DNF (disjunctive normal form) formulas on ciphertexts. In their work, Boneh et. al. also presented three applications, namely private information retrieval with reduced computational complexity, an e-voting system without non-interactive zero knowledge proofs, and a protocol for universally verifiable computation. Few number of works also produced from the BGN public-key system, include non-interactive zero-knowledge proof (NIZK), obfuscated ciphertext mixing, and signature. In this thesis, the author performs in-depth study of the BGN public-key cryptosystem and existing literatures on its applications. The author observes two properties of BGN, namely the indistinguishability of the BGN ciphertexts of sum and product of two messages, and the verifiability of elements from composite prime subgroups in BGN settings. The author further proposes three new applications of BGN, namely the protocols for authentication, oblivious transfer, and proof-of-visit respectively.
Evaluation of a wireless enterprise backbone network architecture
Authors: A. Raniwala, Tzi-cker Chiueh
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

IEEE 802.11 wireless LAN technology is mainly used as an access network within corporate enterprises. All the WLAN access points are eventually connected to a wired backbone to reach the Internet or enterprise computing resources. We aim to expand WLAN into an enterprise-scale backbone network technology by developing a multichannel wireless mesh network architecture called Hyacinth. Hyacinth equips each node with multiple IEEE 802.11a/b NICs and supports distributed channel assignment/routing to increase the overall network throughput. We present the results of a detailed performance evaluation study on the multichannel mesh networking aspect of Hyacinth, based on both NS-2 simulations and empirical measurements collected from a 9-node Hyacinth prototype testbed. A key result of this study is that equipping each node of a Hyacinth network with just 3 NICs can increase the total network bandwidth by a factor of 6 to 7, as compared with single-channel wireless mesh network architecture.
Autoregressive decomposition and pole tracking applied to vocal fold nodule signals
Authors: Paulo Rogério Scalassara, Carlos Dias Maciel, Rodrigo Capobianco Guido, José Carlos Pereira, Everthon Silva Fonseca, Arlindo Neto Montagnoli, Sylvio Barbon Júnior, Lucimar Sasso Vieira, Fabrício Lopes Sanchez
Venue: Pattern Recognition Letters (2007)

This letter describes a novel algorithm that is based on autoregressive decomposition and pole tracking used to recognize two patterns of speech data: normal voice and disphonic voice caused by nodules. The presented method relates the poles and the peaks of the signal spectrum which represent the periodic components of the voice. The results show that the perturbation contained in the signal is clearly depicted by pole's positions. Their variability is related to jitter and shimmer. The pole dispersion for pathological voices is about 20% higher than for normal voices, therefore, the proposed approach is a more trustworthy measure than the classical ones.
Host Identity Specific Multicast
Authors: Zsolt Kovacshazi, Rolland Vida
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Multicasting is a key technology for both users and service providers as it enables important bandwidth savings, and thus lower costs, for content distribution and group communication. The current network level multicast solutions have several weaknesses. These issues are partly related to a problem embedded in the use of the IP addresses themselves. Currently an IP address is both an identifier of who I am and where I am. The Host Identity concept tries to solve this problem by introducing a new, unique identifier, the Host Identity Tag. This concept was used, up until now, mainly for unicast communications. In this paper we propose thus the Host Identity Specific Multicast (HISM) model; we present the architectural elements of the model, and show how it handles access control, mobility, and how it provides native network layer multicast support in mixed, IPv4-IPv6 environments.
Context-Based Multimedia Ontology Model
Authors: Tanko Ishaya, Emmanuel Eze
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Advances in computing, communications and storage technology have seen a proliferation of multimedia resources on a wide range of online services. The rich content of multimedia data has called for innovative annotation technique and advanced IR methods for retrieving multimedia information. Great efforts have been made through MPEG-7 standards for multimedia metadata description, but difficult to manage and integrate due to lack of its formal semantics. While, complex retrieval techniques can enhance metadata search ability, fundamental to efficient searching and retrieval systems are based on how annotated data are organized and managed. Our research approach aims to provide a compressive context-based mapping of multimedia semantic organization and management based on a concept of a semantic space. This paper presents a formalized core context-based multimedia ontology model (a semantic Concept) that facilitates multimedia semantic organization and management. The formalized model has been used to generate RDF-OWL context-based multimedia semantics.
Capturing network traffic with a MAGNeT
Authors: Jeffrey R. Hay, Wu-chun Feng, Mark K. Gardner
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

Current monitoring tools capture network traffic as it appears on the network but are incapable of capturing traffic as it progresses through a running protocol stack. Thus, the current generation of tools cannot record true application-traffic demands and cannot capture protocol-state information at run-time in order to help fine-tune network performance. They also lend no insight into the modulating behavior of protocols (e.g., TCP) that have been shown to impact network performance. In this paper, we introduce MAGNeT -- Monitor for Application-Generated Network Traffic. MAGNeT consists of both Linux kernel modifications and user-application programs. In addition to describing the implementation of MAGNeT, we evaluate its performance and its potential use in applications such as network security, protocol tuning and troubleshooting, and traffic characterization.
Antecedents and consequences of the adolescent's internet consumer competency
Authors: Sharon E. Beatty
Venue:  (2006)

This dissertation explored the dynamics of why adolescents use the Internet, how they develop competency as consumers online, and how this competency seemingly provides them with a greater influence as consumers in purchase decisions involving the Internet. Specifically, this research examined the concept of Internet consumer competency---defined as "the adolescent's perceived ability to function as a consumer in the online context." Based on interviews with adolescents age 11-15 who consume the Internet at home and interviews with parents of this group, we proposed that Internet consumption, Internet shopping frequency, and age are key influences to an adolescent's perceived Internet consumer competency. We further submitted that Internet consumption and Internet shopping frequency are influenced by a child's motivations, gender, perceived parental attitude towards the Internet, and technology accessibility.Finally, we contended that Internet consumer competency influences all stages of purchase decisions for both self-use and family-use purchases when the Internet is involved. Ultimately, the results provided support for many of the hypothesized relationships. Most importantly, these findings suggest that adolescent's perceived Internet consumer competency is a resource (Blood and Wolfe, 1960) that serves to provide adolescents with greater influence on Internet-related purchase decisions.
Modeling next generation configuration management tools
Authors: Mark Burgess, Alva Couch
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

There are several current theoretical models used to discuss configuration management, including aspects, closures, and promises. We examine how these models relate to one another, and develop a overall theoretical framework within which to discuss configuration management solutions. We apply this framework to classify the capabilities of current tools, and develop requirements for the next generation of configuration management tools.
Transparent fault tolerance for parallel applications on networks of workstations
Authors: Daniel J. Scales, Monica S. Lam
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

This paper describes a new method for providing transparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of shared object system called SAM, a portable run-time system which provides a global name space and automatic caching of shared data. SAM incorporates a novel design intended to address the problem of the high communication overheads in distributed memory environments and is implemented on a variety of distributed memory platforms. Our fundamental approach to providing fault tolerance is to ensure the replication of all data on more than one workstation using the dynamic caching already providedby SAM. The replicated data is accessible to the local processor like other cached data, making access to shared data faster and potentially offsetting some of the fault tolerance overhead. In addition, our method uses information available in SAM applications on how processes access shared data to enable several optimizations which reduce the fault-tolerance overhead. We have built an implementation of our fault-tolerance method in SAM for heterogeneous networks of workstations running PVM3. In this paper, we present our fault-tolerance method and describe its implementation in detail. We give performance results and overhead numbers for several large SAM applications running on a cluster of Alpha workstations connected by an ATM network. Our method is successful in providing transparent fault tolerance for parallel applications running on a network of workstations and is unique in requiring no global synchronizations and no disk operations to a reliable file server.
On-line team project communication tool set
Authors: H. E. Nystrom
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Team projects offer a valuable mechanism for effective learning. However, communication within the team, with the instructor and between different teams is a challenging task that can greatly limit the effectiveness of the learning experience. Some of the tools and concepts that are being developed for distance learning applications can be used to enhance team project communication within teams that are geographically separated as well as for in-campus teams. This article documents a set of on-line tools that allow for asynchronous team participation and timely monitoring and feedback by the instructor.
Checking automatically the output of concurrent threads
Authors: Rainer Oechsle, Kay Barzen
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Assessing automatically students' solutions to concurrent programming assignments by looking at the produced output is a crucial and error-prone task. On the one hand a student's program may coincidentally produce a correct output although the program is faulty; the program could also produce invalid output which does not happen to be observed even when the program is run several times. On the other hand the synchronization in a student's program may be too strong, leading to a situation where certain correct outputs can never be generated. This paper presents an approach for checking automatically the output of concurrent threads for correctness. The basic idea is that we provide special implementations of synchronization primitives like semaphores that use vector timestamps. Every output action of a thread is tagged by its vector timestamp. Therefore it can be decided whether two output actions are causally related (they can occur only in the order which was actually observed because of an underlying synchronization), or whether two output actions are not causally related, i.e. concurrent (they may happen in any order). The output of a student's program is represented as a graph. The correctness check consists of a comparison between the expected graph and the observed graph.
Teaching invention, innovation, and entrepreneurship to Northern Nevada high school science and math teachers
Authors: J. A. Kleppe
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The economic history of the United States is replete with examples of inventors and small business innovators making major contributions. From the late 18/sup th/ Century to the present time, major technical advancements have been made as a result of individual inventors, innovators and entrepreneurs working independently of large industrial corporations and government laboratories. It is alarming to note however, just how little is being taught in this country about subjects relating to inventing, innovating and being an entrepreneur. This paper describes a special class that was designed and taught to a group of Northern Nevada high school math and science teachers. The class time was spread over a three day period and the topics covered were all related to invention, innovation and entrepreneurship. The final afternoon was devoted to developing methods, techniques and curriculum for the high school teachers to consider for use in their own classes. 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
Parallel computations and committee constructions
Authors: V. D. Mazurov, M. Yu. Khachai
Venue: Automation and Remote Control (2007)

The paper reviewed the results bearing out the deep-seated relation between the parallel computations and learning procedures for the laminated neural networks one of whose formalizations is represented by the theory of committee constructions. Additionally, consideration was given to two combinatorial problems concerned with learning pattern recognition in the class of affine committees--the problem of verifying existence of a three-element affine separating committee and that of element-minimal affine separating committee. The first problem was shown to be N P-complete, whereas the second problem is N P-hard and does not belong to the Apx class.
Security Analysis of SIP Signalling during NASS-IMS bundled Authentication
Authors: Giorgos Kostopoulos, Odysseas Koufopavlou
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper deals with issues related to the way in which clients authenticate to NASS and simultaneously also gain service layer authentication using the single sign-on NASS bundled authentication. A security analysis of SIP sequence messages during NASS-IMS bundled authentication is presented. Through this analysis we aim to identify the SIP vulnerabilities during the NASS-IMS bundled authentication. To demonstrate the signaling we will use emulation software and we will design specific test cases. From this we will identify vulnerability issues during SIP signaling in the NASS-IMS bundled Authentication as well as interesting conclusions regarding NASS functionalities.
Maximum likelihood from spatial random effects models via the stochastic approximation expectation maximization algorithm
Authors: Hongtu Zhu, Minggao Gu, Bradley Peterson
Venue: Statistics and Computing (2007)

We introduce a class of spatial random effects models that have Markov random fields (MRF) as latent processes. Calculating the maximum likelihood estimates of unknown parameters in SREs is extremely difficult, because the normalizing factors of MRFs and additional integrations from unobserved random effects are computationally prohibitive. We propose a stochastic approximation expectation-maximization (SAEM) algorithm to maximize the likelihood functions of spatial random effects models. The SAEM algorithm integrates recent improvements in stochastic approximation algorithms; it also includes components of the Newton-Raphson algorithm and the expectation-maximization (EM) gradient algorithm. The convergence of the SAEM algorithm is guaranteed under some mild conditions. We apply the SAEM algorithm to three examples that are representative of real-world applications: a state space model, a noisy Ising model, and segmenting magnetic resonance images (MRI) of the human brain. The SAEM algorithm gives satisfactory results in finding the maximum likelihood estimate of spatial random effects models in each of these instances.
A CSP Search Algorithm with Responsibility Sets and Kernels
Authors: Igor Razgon, Amnon Meisels
Venue: Constraints (2007)

A CSP search algorithm, like FC or MAC, explores a search tree during its run. Every node of the search tree can be associated with a CSP created by the refined domains of unassigned variables. If the algorithm detects that the CSP associated with a node is insoluble, the node becomes a dead-end. A strategy of pruning "by analogy" states that the current node of the search tree can be discarded if the CSP associated with it is "more constrained" than a CSP associated with some dead-end node. In this paper we present a method of pruning based on the above strategy. The information about the CSPs associated with dead-end nodes is kept in the structures called responsibility sets and kernels. We term the method that uses these structures for pruning RKP, which is abbreviation of Responsibility set, Kernel, Propagation. We combine the pruning method with algorithms FC and MAC. We call the resulting solvers FC-RKP and MAC-RKP, respectively. Experimental evaluation shows that MAC-RKP outperforms MAC-CBJ on random CSPs and on random graph coloring problems. The RKP-method also has theoretical interest. We show that under certain restrictions FC-RKP simulates FC-CBJ. It follows from the fact that intelligent backtracking implicitly uses the strategy of pruning "by analogy."
Targeting Prediction: Engineering a Distributed Event Processor for an Autonomic Biometric System
Authors: Roy Sterritt, Edward Hanna, Patricia O'Hagan
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

This paper reports on the latest developments in a deployed Survivable Secure System in relation to enabling the longer term aim of moving from a reactive to a predictive system. At this stage it has been decided to redevelop the event/rule processor into a distributed system to facilitate the future requirements of a predictive system.
Multilingual lexical database generation from parallel texts in 20 European languages with endogenous resources
Authors: Giguet Emmanuel, LUQUET Pierre-Sylvain
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper deals with multilingual database generation from parallel corpora. The idea is to contribute to the enrichment of lexical databases for languages with few linguistic resources. Our approach is endogenous: it relies on the raw texts only, it does not require external linguistic resources such as stemmers or taggers. The system produces alignments for the 20 European languages of the 'Acquis Communautaire' Corpus.
Reusable SW Requirements Development Process: Embedded SW Industry Experiences
Authors: Seungyun Lee, Hyunmin Ko, Myungjin Han, Dongcho Jo, Junho Jeong, Kangtae Kim
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Embedded system development confronts to the needs of guaranteeing both short time release and the product's high quality. Emphasizing proactive SW reuse, it is necessary to identify reusable SW requirements for the product families. Once the standard features of product family are defined as reusable requirements, a derived model reuses most of them and adds little efforts on specifying new requirements. Its reuse can also smoothly make design models, implementation code, and corresponding test cases be reusable. This paper focuses on the systematic management process of developing reusable SW requirements for the embedded product families; we define the feature as the requirement unit; propose Reusable Requirements Development Process (RRDP); finally evaluate our process applying to industrial practices.