ppxscal/embedding_network huggingface dataset:
Neuro-fuzzy networks and their application to fault detection of dynamical systems
Authors: Józef Korbicz, Marek Kowal
Venue: Engineering Applications of Artificial Intelligence (2007)

The paper tackles the problem of robust fault detection using Takagi-Sugeno neuro-fuzzy (N-F) models. A model-based strategy is employed to generate residuals in order to make a decision about the state of the process. Unfortunately, such an approach is corrupted by model uncertainty due to the fact that in real applications there exists a model-reality mismatch. In order to ensure reliable fault detection, the adaptive threshold technique is used to deal with the problem. The paper focuses also on the N-F model design procedure. The bounded-error approach is applied to generate rules for the model using available data. The proposed algorithms are applied to fault detection in a valve that is a part of the technical installation at the Lublin sugar factory in Poland. Experimental results are presented in the final part of the paper to confirm the effectiveness of the method.
Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction
Authors: Takayuki Ito, Makoto Yokoo, Shigeo Matsubara, Atsushi Iwasaki
Venue: Systems and Computers in Japan (2007)

This paper proposes a new combinatorial auction protocol called Average-Max-Minimal-Bundle (AM-MB) protocol. The characteristics of the AM-MB protocol are as follows: (i) it is strategyproof, that is, truth-telling is a dominant strategy, (ii) the computational overhead is very low, since it allocates bundles greedily thereby avoiding an explicit combinatorial optimization problem, and (iii) it can obtain higher social surplus and revenue than can the Max-Minimal-Bundle (M-MB) protocol, which also satisfies (i) and (ii). Furthermore, this paper extends the AM-MB protocol to an open ascending-price protocol in which straightforward bidding is an ex-post Nash equilibrium. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 44&ndash;51, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20748
Predictive fractal interpolation mapping: differential speech coding at low bit rates
Authors: Zhicheng Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

In traditional linear prediction coding of speech, the vocal tract is represented by an AR model and the model is based on sample prediction. This paper proposes a new prediction model using iterated function systems (IFS) for vector modeling of arbitrary discrete sequence. The inverse algorithm for model parameter estimation is addressed, which is different from the inverse problem of the normal linear fractal interpolation. Furthermore, a new differential vector coding scheme using the new technique is presented, which also broadens the IFS implementation because of the backward prediction and differential vector usage. The model of predictive fractal mapping has very good potentials for low bit rate speech compression, for instance, vector prediction mode and less model parameters related to the waveform shapes. It is a new area of speech coding, particularly, at low bit rates. The coding scheme presented is novel and unique and has great potential applications. 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
Automating Language Evolution
Authors: Markus Pizka, Elmar Jurgens
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

The design and implementation of complex software systems inherently spans multiple levels of abstractions. The concepts of each level of abstractions and their interplay are represented by formal languages that are either implicitly known or explicitly defined. Achieving high productivity in software development and maintenance is thus strongly connected with ruling the complexity of multi-level language design and evolution. This paper explains the necessity for automating multi-level language evolution, discusses its challenges and proposes concepts as well as a prototypical tool that support the incremental co-evolution of a staged language and program generation architecture. This approach reduces the cost of language maintenance and paves the ground for an incremental and bottom-up oriented way of developing domain specific languages.
What is Itanium Memory Consistency from the Programmer's Point of View?
Authors: Lisa Higham, LillAnne Jackson, Jalal Kawash
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

A programmer-centric model describes the memory consistency rules of amultiprocessor as a collection, one for each processor, of 'views' of instructions and some agreements between these views. It also requires the natural notion of validity: the value read from a shared memory location is the one that was most recently stored, according to a given view. This allows reasoning about programs at a non-operational level in the natural way, not obscured by the implementation details of the underlying architecture. In this paper, we formulate a programmer-centric description of the memory consistency model provided by the Itanium architecture. However, our definition is not tight. We provide two very similar definitions and show that the specification of the Itanium memory model lies between the two. These two definitions are motivated by slightly different implementations of load-acquire instructions. A further entertainment of a handful of other load-acquire rules leads us to question whether the specification of the Itanium memory order [Intel Corporation. A formal specification of the intel itanium processor family memory ordering. http://www.intel.com/, Oct 2002] is indeed faithful to the Itanium architecture intentions.
Using Stealth Mixins to Achieve Modularity
Authors: Robert Strandh, John Hamer, Gilbert Baumann
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Organising a complex, interactive application into separate modules is a significant challenge. We would like to be able to evolve modules independently, and to add new modules into the system (or remove optional ones) without requiring major revisions to existing code. Solutions that rely on pre-planning when writing core modules are clumsy and error-prone, since programmers may omit to include all the required "hooks," unused hooks incur a runtime overhead, and any unanticipated extensions may still require significant code changes. Unfortunately, most languages do not provide adequate mechanisms for supporting the separation of modules. In this paper, we review partial solutions for typical object-oriented languages such as Java, and then present "stealth mixins", a much more satisfactory solution that can be built on top of Common Lisp. The Common Lisp solution was developed for Gsharp, a sophisticated graphical music score editor, and the technique has been used extensively throughout the program. We use Gsharp as a running example throughout this paper. However, the ideas are applicable to a wide range of applications.
Highly concurrent distributed knowledge objects
Authors: K. L. Clark, T. I. Wang
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

This paper introduces a distributed object oriented logic programming language, DK Parlog, in which each object, in addition to the normal procedural methods for accessing and updating state components, also has knowledge methods in the form of Prolog rules. The language is an OO extension of a distributed, multi-threaded, logic programming system. Encapsulation is by class definitions linked via single inheritance. Procedural method invocation is via asynchronous message send to the unique object identifier. Knowledge method invocation is via synchronous remote procedure call. Classes are also objects - they have their own state components and methods. An application in D Parlog consists of a collection of concurrently executing objects (classes and instances) distributed over a local area network. The knowledge methods can be public or private, and can be dynamically modified by the procedural methods of the object using Prolog style knowledge base manipulation primitives. The dynamic knowledge of an object can be used as a declarative representation of part of its state. This paper assumes some familiarity with concepts of concurrent object oriented programming and logic programming, ideally concurrent logic programming, but familiarity with Prolog will probably suffice.
Comparative convergence analysis of EM and SAGE algorithms in DOA estimation
Authors: Pei Jung Chung, Johann F. Böhme
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The convergence rates of direction of arrival (DOA) estimates using expectation-maximization (EM) and space alternating generalized EM (SAGE) algorithms are investigated. The EM algorithm is a well known recursive method for locating modes of a likelihood function which is characterized by simple implementation and stability. Unfortunately the slow convergence associated with EM makes it less attractive. The recently proposed SAGE algorithm, based on the same idea of data augmentation, preserves the advantage of simple implementation and has the potential to speed up convergence. Theoretical analysis shows that SAGE has faster convergence rate than EM under certain conditions. This conclusion is also supported by numerical experiments carried out over a wide range of SNRs and different numbers of snapshots.
Comments on "On the Nondomination of Cohorts Coteries"
Authors: Yu-Chen Kuo, Teng-Yi Chiu
Venue: IEEE Transactions on Computers (2007)

In [4], Jiang shows a result that a Cohorts coterie is nondominated (ND) under a Cohorts structure Coh(k, n)=(C_1, C_2,\ldots, C_n) if |C_1|=k. However, the result is incorrect. In this comment, we correct the result by deriving the necessary and sufficient conditions for the Cohorts coterie to be ND. As we will see, a Cohorts coterie under Coh(k, n) is ND if and only if k=1 or n=1.
An assumptions management framework for systems software
Authors: Lui Sha
Venue:  (2006)

Critical systems in areas ranging from avionics to consumer car control systems are being built by integrating commercial-off-the-shelf (COTS) components. Software components used in these systems need to satisfy many formally unexpressed, yet necessary conditions, termed as assumptions, for their correct functioning. Invalid assumptions have been determined to be the root cause of failures in many such systems; for example, in the Ariane 5 rocket failure. In the current software engineering practices, many of these assumptions are not recorded in a machine-checkable format, which makes validating the assumptions a manual and an error-prone task. This thesis examines this problem in detail and evolves a framework, called the assumptions management framework (AMF), which provides a vocabulary for discussing assumptions, a language for encoding assumptions in a machine-checkable format and facilities to manage the assumptions in terms of composition and setting policies on assumption validation. A relevant subset of assumptions can be validated or flagged as invalid automatically as the system evolves. AMF allows the assumption specification process to blend with the components' source-code and architecture specification. This enables AMF to be applied to existing systems with minor or no modifications in components' implementation and design. Performance and scalability tests show that the AMF implementation is scalable to be applied to large-scale systems. Case-studies were conducted on representative systems to study the nature and number of defects caused by invalid assumptions. It was found that a significant number of defects in the systems studied had invalid assumptions as the root-cause. It was found that AMF has the ability to encode and validate majority of the assumptions that caused defects in these systems. This can prevent such defects in the future or warn in advance of potential defects when assumptions are invalid. Analyzing and correcting one of the invalid assumptions in Iperf, an end-to-end bandwidth measurement tool, resulted in significantly better bandwidth estimates by Iperf across high-bandwidth networks. In most cases, it also resulted in savings of over 90% in terms of both network traffic generated and bandwidth measurement times.
Towards a theoretical model for software growth
Authors: Kent State University, Jesus M. Gonzalez-Barahona, Gregorio Robles
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Software growth (and more broadly, software evolution) is usually considered in terms of size or complexity of source code. However in different studies, usually different metrics are used, which make it difficult to compare approaches and results. In addition, not all metrics are equally easy to cal- culate for a given source code, which leads to the ques- tion of which one is the easiest to calculate without losing too much information. To address both issues, in this pa- per present a comprehensive study, based on the analysis of about 700,000 C source code files, calculating several size and complexity metrics for all of them. For this sample, we have found double Pareto statistical distributions for all metrics considered, and a high correlation between any two of them. This would imply that any model addressing soft- ware growth should produce this Pareto distributions, and that analysis based on any of the considered metrics should show a similar pattern, provided the sample of files consid- ered is large enough.
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
Authors: Pawe Garbacki, Vijay K. Naik
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We describe a hybrid linear programming (LP) and evo- lutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the iterative approach of the EA methods to per- form a goal oriented search over the solution space and, within each iteration, uses the LP method to solve a partial resource matching problem. By judiciously controlling the partial problem size and its complexity, the hybrid matcher balances the accuracy of the solution and the execution time. We describe a grid management architecture that in- corporates the hybrid resource matcher. Performance re- sults indicate that the execution time of the hybrid matcher, under a variety of conditions, is at least as good and often significantly better than the execution time of LP and EA based matchers. The hybrid matcher is found to scale well with the complexity of the problem and to maintain sensitiv- ity to the response time constraints of on-line environments.
The Ninja jukebox
Authors: Ian Goldberg, Steven D. Gribble, David Wagner, Eric A. Brewer
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

We present the design and implementation of the "Ninja Jukebox", an infrastructural service that allows a community of users to build a distributed, collaborative music repository that delivers digital music to Internet clients, and that performs simple collaborative filtering based on users' song preferences inferred by the service. The Jukebox, implemented in Java, was designed to allow rapid service evolution and reconfiguration, simplicity in participation, and extensibility. We demonstrate that our careful use of a distributed component architecture enabled rapid prototyping of the service, and that our use of carefully designed, strongly typed interfaces enabled the smooth evolution of the service from a simple prototype to a more complex, mature system.
Hybrid Dynamic Channel Assignment in Clustered Wireless Multihop CDMA/TDMA Ad Hoc Networks
Authors: Chien-Min Wu
Venue: Wireless Personal Communications: An International Journal (2007)

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions, but also enhance the channel spatial reuse to maximize the system throughput. It becomes very inefficient to use fixed channel assignment when the network size grows. Therefore, spatial reuse of channels become more important in a large multihop ad hoc network. In this paper, we consider an ad hoc network with an overlaid CDMA/TDMA structure. We divide each code into time slots to form the channels. A dynamic channel assignment (DCA) strategy called Hybrid-DCA is proposed in a clustered ad hoc network. This DCA strategy is designed to make the best use of available channels by taking advantage of the spatial reuse concept. In Hybrid-DCA, the increase in spatial reuse is achieved by adding certain control overhead. We show that the bandwidth saving due to channel spatial reuse is higher than the additional bandwidth spent on the control overhead.
Using SAML and XACML for Complex Resource Provisioning in Grid Based Applications
Authors: Yuri Demchenko, Leon Gommans, Cees de Laat
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

This paper presents ongoing research and current results on the development of flexible access control infrastructure for complex resource provisioning (CRP) in Grid-based applications. The paper proposes a general CRP model and specifies major requirements to the Authorisation (AuthZ) service infrastructure to support multidomain CRP, focusing on two main issues -- policy expression for complex resource models and AuthZ session support. The paper provides suggestions about using XACML and its special profiles to describe access control policies to complex resources and briefly describes proposed XML based AuthZ ticket format to support extended AuthZ session context. Additionally, the paper discusses what specific functionality can be added to the gLite Java Authorisation Framework (gJAF), to handle dynamic security context including AuthZ session support. The paper is based on experiences gained from major Grid based and Grid oriented projects such as EGEE, Phosphorus and GigaPort Research on Network.
Securing Medical Sensor Environments: The CodeBlue Framework Case
Authors: Georgios Kambourakis, Eleni Klaoudatou, Stefanos Gritzalis
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Recently, research on wireless sensor networks targeting to medical environments has gathered a great attention. In this context, the most recent and perhaps the most promising complete scheme is the CodeBlue hardware and software combined platform, developed in the context of the self-titled Harvard's University project. CodeBlue relies on miniature wearable sensors to monitor real-time patients' vital activities and collecting data for further processing. Apart from the essential query interface for medical monitoring, CodeBlue offers protocols for hardware discovery and multihop routing. This paper contributes to the CodeBlue security, which until now is considered as pending or left out for future work by its designers. We identify and describe several security issues and attack incidents that can be directly applied on CodeBlue compromising its trustworthiness. We also discuss possible solutions for both internal and external attacks and the key-management mechanisms that these solutions presume.
Minitrack: E-Government Information Security
Authors: Gregory B. White, Stephen Jones
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Governments employ information technology and increasingly e-Government to conduct daily operations and to interface with their citizens. Operations must be conducted securely and with an assurance that information is accurate and protected from unauthorized disclosure to protect the privacy of citizens. Governments must also ensure the safety and security of its citizens, and information technology can aid in this arena. This mini-track examines the security of information technology used by governments and critical infrastructures and explores ways that IT can enhance the ability of governments to ensure the safety and security of its citizens.
Fast Abstracts
Authors: Hiroshi Nakamura
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Fast Abstracts are brief two page presentations, either on new ideas, opinion pieces, or a project update. They cover wide variety of issues within the field of dependable systems and networks. They are also designed to offer an opportunity for late-breaking results, partial results, or work in progress to be reported in a timely fashion. As such, they are lightly reviewed by the Fast Abstracts Program Committee and are not subjected to the rigorous referee process for regular DSN papers. The late submission deadline and expedited screening, along with the corresponding 5-minute talk during DSN, allow for very rapid dissemination and timely feedback from the community.
Dynamic Vnodes - design and implementation
Authors: Aju John
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

Dynamic vnodes make the UNIX kernel responsive to a varying demand for vnodes, without a need to rebuild the kernel. It also optimizes the usage of memory by deallocating excess vnodes. This paper describes the design and implementation of dynamic vnodes in DEC OSF/1 V3.0. The focus is on the vnode deallocation logic in a Symmetric Multi-Processing environment. Deallocation of vnodes differs from the familiar concept of dynamically allocated data structures in the following ways: the legacy name-cache design implicitly assumes that vnodes are never deallocated, and the vnode free-list needs to cache unused vnodes effectively.
The Role of Surface Plasmon Modes in the Casimir Effect
Authors: F. Intravaia, A. Lambrecht
Venue: Open Systems Information Dynamics (2007)

In this paper, we study the role of surface plasmon modes in the Casimir effect. First we write the Casimir energy as the sum over the modes of a real cavity. We may identify two sorts of modes, two evanescent surface plasmon modes and propagative modes. As one of the surface plasmon modes becomes propagative for some choice of parameters we adopt an adiabatic mode definition where we follow this mode into the propagative sector and count it together with the surface plasmon contribution, calling this contribution "plasmonic". The remaining modes are propagative cavity modes, which we call "photonic". The Casimir energy contains two main contributions, one coming from the plasmonic, the other from the photonic modes. Surprisingly we find that the plasmonic contribution to the Casimir energy becomes repulsive for intermediate and large mirror separations. Alternatively, we discuss the common surface plasmon defintion, which includes only evanescent waves, where this effect is not found. We show that, in contrast to an intuitive expectation, for both definitions the Casimir energy is the sum of two very large contributions which nearly cancel each other. The contribution of surface plasmons to the Casimir energy plays a fundamental role not only at short but also at large distances.