ppxscal/embedding_network huggingface dataset:
A Concept for Flexible Event-Driven Invocation of Distributed Service Compositions
Authors: Karen Walzer, Jurgen Anke, Alexander Loser, Huaigu Wu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Currently, flexible service compositions are invoked in a centralised manner by process execution engines. Although this approach is widely used for orchestrating web services, it lacks scalability and incurs considerable overhead in network communication. This is especially disadvantageous in scenarios with embedded systems and other resource-constrained devices, mainly due to restrictions in network bandwidth or power supply. We present an application scenario to illustrate the drawbacks of centralised service invocation in these cases. Decentralised invocation mechanisms are a promising approach to overcome these problems. Based on the identification of service composition characteristics in distributed environments, we propose a decentralised mechanism using events and subscriptions. This mechanism can be employed for invoking distributed service compositions while offering improved scalability and efficiency. We conclude with discussing the advantages and restrictions of our solution compared to the centralised approach.
Tree-structured models of parameter dependence for rapid adaptation in large vocabulary conversational speech recognition
Authors: A. Kannan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Two models of statistical dependence between the acoustic model parameters of a large vocabulary conversational speech recognition (LVCSR) system are investigated for the purpose of rapid speaker- and environment-adaptation from a very small amount of speech: (i) a Gaussian multiscale process governed by a stochastic linear dynamical system on a tree, and (ii) a simple hierarchical tree-structured prior. Both methods permit Bayesian (MAP) estimation of acoustic model parameters without parameter-tying even when no samples are available to independently estimate some parameters due to the limited amount of adaptation data. Modeling methodologies are contrasted, and comparative performance of the two on the Switchboard task is presented under identical test conditions for supervised and unsupervised adaptation with controlled amounts of adaptation speech. Both methods provide significant (1% absolute) gain in accuracy over adaptation methods that do not exploit the dependence between acoustic model parameters.
Using Social Networking and Semantic Web Technology in Software Engineering--Use Cases, Patterns, and a Case Study
Authors: Jens Dietrich, Nathan Jones
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

We present an approach that uses social net- working and semantic web technology to share knowledge within the software engineering community. We propose to use existing Web 2.0 services such as social bookmarking and blogs as the infrastructure to share knowledge arte- facts. Due to the openness of these services, it is crucial to provide support in order to establish the trustworthiness of knowledge artefacts. The solution proposed is designed fol- lowing the original semantic web stack architecture[1] and uses existing and emerging W3C semantic web standards such as RDF [16], OWL[14], and SWRL[19]. The WebOf- Patterns [22] project is presented in a case study. This includes an Eclipse based WebOfPatterns client that can be used to discover design pattern definitions in social net- works, to define and publish patterns, to rate patterns, to establish the trustworthiness of patterns found, and finally to x-ray Java projects for instances of discovered patterns.
Controllability and observability of discrete models of continuous plants with higher-order holds and delay
Authors: B. P. Lampe, E. N. Rosenwasser
Venue: Automation and Remote Control (2007)

The problem of constructing minimal state-space realizations for discrete models of continuous plants with higher-order holds and multiple delays is considered.
WAN-hacking with autohack: auditing security behind the firewall
Authors: Alec Muffett
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

This paper is a review of an ongoing project to simplify security auditing of the world-wide TCP/IP network of some thirty thousand hosts, internal to Sun Microsystems. The paper also examines the issues which this project raises; it details the conception, design, development of, and one year's results gathered from, Auto-Hack, a tool specially created to probe, audit, and produce security reports for, a TCP/IP network of this size.
A new collaborative evolutionary-swarm optimization technique
Authors: Rodica Ioana Lung, D. Dumitrescu
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

A new hybrid approach to optimization in dynamical environments called Collaborative Evolutionary-Swarm Optimization (CESO) is presented. CESO tracks moving optima in a dynamical environment by combining the search abilities of an evolutionary algorithm for multimodal optimization and a particle swarm optimization algorithm. A collaborative mechanism between the two methods is proposed by which the diversity provided by the multimodal technique is transmitted to the particle swarm in order to prevent its premature convergence. Numerical experiments indicate CESO as an efficient method compared with other evolutionary approaches.
Analysis of the influence of processor hidden registers on the accuracy of fault injection techniques
Authors: D. Gil, J. Gracia, J. C. Baraza, P. J. Gil
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Modern processors tend to increase the number of registers, being part of them not accessible by the instruction set. Traditionally, the effect of faults in these hidden registers has not been considered during system validation using fault injection. In this paper, a study of the importance of faults in hidden registers is performed. Firstly, we have analysed the sensitivity of hidden registers to faults in combinational logic. In a second phase, we have analysed the impact of the faults occurred in hidden registers on system behaviour. A broad set of permanent and transient faults have been injected into the models of two typical commercial microcontrollers, using a VHDL-based fault injection tool developed by our research group. The results obtained indicate that the incidence of hidden registers is not negligible, and in some cases is even notable. This fact suggests that widely used fault injection techniques such as SWIFI could not be enough to perform a full and representative validation of modern processors, and it would be necessary to complement with other fault injection techniques that have a higher degree of accessibility.
A kurtosis-driven variable step-size LMS algorithm
Authors: D. I. Pazaitis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A new technique for adjusting the step-size of the LMS algorithm is introduced. The proposed method adjusts the step-size sequence utilising the kurtosis of the estimation error, reducing therefore performance degradation due to the existence of significant Gaussian-distributed noise. The algorithm's behaviour is analysed and equations regarding the evolution of the weight-error correlation matrix and stability of the algorithm are established. The obtained theoretical results are shown to agree well with the experimental ones. Furthermore, the performance of the proposed algorithm compared to that of LMS and other existing time-varying step-size algorithms is found superior in terms of tracking speed and steady-state error.
Averaging Techniques for the A Posteriori BEM Error Control for a Hypersingular Integral Equation in Two Dimensions
Authors: Carsten Carstensen, Dirk Praetorius
Venue: SIAM Journal on Scientific Computing (2007)

Averaging techniques or gradient recovery techniques are frequently employed tools for the a posteriori finite element error analysis. Their very recent mathematical justification for partial differential equations allows unstructured meshes and nonsmooth exact solutions. This paper establishes an averaging technique for the hypersingular integral equation on a one-dimensional boundary and presents numerical examples that show averaging techniques can be employed for an effective mesh-refining algorithm. For the discussed test examples, the provided estimator estimates the (in general unknown) error very accurately in the sense that the quotient error/estimator stays bounded with a value close to $1$.
Architectural Interoperability Checking in Visual Coordination Networks
Authors: David Šafránek
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper, the approach [Alessandro Aldini and Marco Bernardo. On the usability of process algebra: An architectural view. Theor. Comput. Sci. 335 (2-3) (2005) 281-329] of architectural interoperability checking is revisited and utilized for interoperability checking of architectures with connectors and components treated as behaviorally and expressively different elements of architecture description. By that way, the framework of architectural interoperability checking for a diagrammatic language Visual Coordination Networks is established.
A novel packaging approach for RF MEMS switching functions on alumina substrate
Authors: Mohamad El Khatib, Arnaud Pothier, Aurelian Crunteanu, Pierre Blondy
Venue: Microsystem Technologies (2007)

This paper reports the design of a hermetic-compatible wafer-scale package for RF MEMS based components. The presented packaging concept consists in encapsulating the whole RF device or subsystem instead of encapsulating each MEMS component separately, which will reduce the device size and cost. This approach is based on the MEMS fabrication technology on ceramic substrate and the use of laser drilled vias hole techniques to realize full metallized vias in alumina substrates. These vias holes will allow a low loss RF signal transmission inside the package without breaking its hermeticity. Hence, several packaged switching networks prototypes, based on ohmic contact MEMS switches, have been designed following this approach and the packaging electromagnetic impact on these components has been especially studied to result on good performance devices.
Fine structure features for speaker identification
Authors: M. J. Carey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The performance of speaker identification (SID) systems can be improved by the addition of the rapidly varying "fine structure" features of formant amplitude and/or frequency modulation and multiple excitation pulses. This paper shows how the estimation of such fine structure features can be improved further by obtaining better estimates of formant frequency locations and uncovering various sources of error in the feature extraction systems. Most female telephone speech showed "spurious" formants, due to distortion in the telephone network. Nevertheless, SID performance was greatest with these spurious formants as formant estimates. A new feature has also been identified which can increase SID performance: cepstral coefficients from noise in the estimated excitation waveform. Finally, statistical tools have been developed to explore the relative importance of features used for SID, with the ultimate goal of uncovering the source of the features that provide SID performance improvement.
Engineering the future: an integrated engineering design experience
Authors: P. Rullkoetter
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Engineering Integration is a two-quarter course sequence with EE, ME, and CpE students experiencing the engineering design process through a mechatronics design project. A previous "work-in-progress", this course is currently being delivered for the second year. Interdisciplinary student teams of 4 members each receive a "request for proposals" describing the autonomous-vehicle project with constraints and requirements. The project requires the development of an autonomous surface vehicle capable of navigation using the Global Positioning Satellite system. The vehicle is required to deliver a series of "tags" to specific locations and return to the original position. Obstacle avoidance throughout the test course is necessary. The teams gain experience in the essential skills of the design process and engineering project management, including teamwork, scheduling, resource allocation, cost analysis, reporting, and documentation. The course conforms well to new ABET considerations, including the emphasis on multi-disciplinary team design and technical communication skills.
A new shape-adaptive DCT for coding of arbitrarily shaped image segments
Authors: T. D. Tran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper presents a new coding scheme for arbitrarily shaped image segments using a boundary block grouping and merging (BBGM) technique and a modified shape-adaptive discrete cosine transform (SA-DCT). The BBGM technique merges pairs or groups of neighboring blocks satisfying some properties into larger single blocks. The modified SA-DCT is then applied to these blocks as well as to other boundary blocks. The number of transformed coefficients is the same as the number of foreground pixels in the boundary segment. Simulation results show that the proposed algorithm performs better than the conventional SA-DCT first suggested in 1995 and the pseudo-orthonormal SA-DCT published in 1998.
Poisson convergence in the restricted k-partitioning problem
Authors: Anton Bovier, Irina Kurkova
Venue: Random Structures Algorithms (2007)

The randomized k-number partitioning problem is the task to distribute N i.i.d. random variables into k groups in such a way that the sums of the variables in each group are as similar as possible. The restricted k-partitioning problem refers to the case where the number of elements in each group is fixed to N&#x002F;k. In the case k = 2 it has been shown that the properly rescaled differences of the two sums in the close to optimal partitions converge to a Poisson point process, as if they were independent random variables. We generalize this result to the case k > 2 in the restricted problem and show that the vector of differences between the k sums converges to a k - 1-dimensional Poisson point process. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Can the conventional models apply? The microeconomics of the information revolution
Authors: Bruce Don, Dave Frelinger
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

Operating with incorrect assumptions concerning information firms and how they conduct commerce has significant public policy implications. One possible consequence is inappropriate anti-trust action (or inaction) by government regulators. Because the decision to enforce is essentially Boolean in nature and can have long-term impacts on the industry, it is important to base regulatory and other public policy decisions on appropriate models. This paper argues that there are importantly different microeconomic paradigms applicable to information-based commerce. These differences should be investigated in some depth to inform future policy decisions affecting information-based enterprises and economies based on their commerce. Such research may lead to significant improvements in our ability to make good public policy decisions on issues that will challenge us as our society adapts to the changes in commerce brought about by information technology.
A Distributed Data Gathering Algorithm for Wireless Sensor Networks with Uniform Architecture
Authors: M. Goyeneche, J. Villadangos, J. J. Astrain, M. Prieto, A. Cordoba
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Wireless sensor networks (WSNs) are commonly used for continuously monitoring applications. Data gathering and in-network processing are techniques to efficiently gather the information from sensor nodes. Usually, these techniques have been analyzed taking into account a global knowledge of the system in order to select the best path to gather the information or to establish a routing function. In this paper we propose a novel distributed data gathering algorithm for wireless networks and evaluate the effect of having a different number of cluster heads transmitting to the base station. We focus the attention on uniformly distributed nodes in a given area to evaluate the effects on the energy consumption. Our proposal distributes uniformly the energy consumption between the complete set of sensors in the system resulting in a similar longevity for all sensors in the system.
Curricular resources from the acm two-year college education committee
Authors: Elizabeth K. Hawthorne, Robert D. Campbell, Karl J. Klee
Venue: ACM SIGCSE Bulletin (2007)

This poster presentation highlights the curricular resources available from the Two-Year College Education Committee (TYCEC), a standing committee of the ACM Education Board. This Committee is charged with developing computing curricula for associate-degree granting institutions. To this end, the TYCEC has published curriculum guidelines in each of the computing sub-disciplines: Computer Science, Information Technology, Computer Engineering, Information Systems, and Software Engineering.
Real-time DSP for sophomores
Authors: K. H. Chiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We are developing a sophomore course to serve as a first course in electrical engineering. The course focuses on discrete-time systems. Its goal is to give students an intuitive understanding of concepts such as sinusoids, frequency domain, sampling, aliasing, and quantization. In the laboratory, students build simulations and real-time systems to test these ideas. By using a combination of high-level and DSP assembly languages, the students experiment with a variety of views into the representation, design, and implementation of systems. The students are exposed to a digital style of implementation based on programming both desktop and embedded processors.
Browser-based distributed evolutionary computation: performance and scaling behavior
Authors: J. J. Merelo, Antonio Mora García, Juan Luis Jiménez Laredo, Juan Lupión, Fernando Tricas
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

The challenge of ad-hoc computing is to find the way of taking advantage of spare cycles in an efficient way that takes into account all capabilities of the devices and inter connections available to them. In this paper we explore distributed evolutionary computation based on the Ruby on Rails framework, which overlays a Model-View-Controller on evolutionary computation. It allows anybody with a web browser (that is, mostly everybody connected to the Internet) to participate in an evolutionary computation experiment. Using a straight forward farming model, we consider different factors, such as the size of the population used. We are mostly interested in how they impact on performance, but also the scaling behavior when a non-trivial number of computers is applied to the problem. Experiments show the impact of different packet sizes on performance, as well as a quite limited scaling behavior, due tothe characteristics of the server. Several solutions for that problem are proposed.
A Programming Model for Time-Synchronized Distributed Real-Time Systems
Authors: Yang Zhao, Jie Liu, Edward A. Lee
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via time-stamped events. DE models have primarily been used in performance modeling and simulation, where time stamps are a modeling property bearing no relationship to real time during execution of the model. In this paper, we extend DE models with the capability of relating certain events to physical time. We propose a programming model, called PTIDES (Programming Temporally Integrated Distributed Embedded Systems), which has DE semantics, but with carefully chosen relations between model time and real time. Key to making this model effective is to ensure that constraints that guarantee determinacy in the semantics are preserved at runtime. To accomplish this, we give a distributed execution strategy that obeys DE semantics without the penalty of totally ordered executions based on time stamps. Our technique relies on having a distributed common notion of time, known to some precision. Based on causality analysis of DE models, we define relevant dependency and relevant orders to enable out-of-order execution without compromising determinism and without requiring backtracking.
Identity Delegation in Policy Based Systems
Authors: Rajeev Gupta, Shourya Roy, Manish Bhide
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Policy based systems have received considerable attention in the recent past from academia as well as the industry. Research on policy based systems encompasses a gamut of areas such as: models and languages for policy based systems, policy standards, domain specific implementations, policy tools etc. However an important issue, which did not receive much attention from researchers, is that of access control for policy execution. In this paper we present the concept of "identity delegation" which involves finding the "correct' users/ identities, to whom task of policy execution can be delegated. Policies are generally defined by high level business executives (policy authors) and are implemented by policy enforcers who have sufficient access rights on the underlying systems. Given the increasing complexity of enterprise systems, we show in this paper that finding the right policy enforcers for a policy can be a fairly non-trivial task. We address this important problem by proposing a unique concept of "implicit identity delegation', whereby an autonomic system automatically figures out the correct policy enforcers and implicitly delegates the task of policy execution. We present the Implicit Identity Delegation architecture which boasts of an efficient technique for performing implicit identity delegation and uses a plugin based architecture ensuring its applicability and use in diverse domains.