ppxscal/embedding_network huggingface dataset:
Adaptation Mechanisms for Survivable Sensor Networks against Denial of Service Attack
Authors: Dong Seong Kim, Chung Su Yang, Jong Sou Park
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper, we propose adaptation mechanisms for sensor networks. The existing researches on security for sensor networks have mostly concerned with confidentiality, integrity and authentication based on cryptographic mechanisms. These aspects of security are important but not enough to provide survivability of sensor networks. In this paper, we employ the software rejuvenation and reconfiguration methodology to increase the survivability of sensor nodes in sensor networks. The model uses global or local intrusion detection systems and performs 4 strategies to extend the availability of sensor nodes in sensor networks. We propose a general framework and its methodology and the security analysis and evaluation results show the feasibility of our approach.
Interactive-group object-replication fault tolerance for CORBA
Authors: Brent E. Modzelewski, David Cyganski, Marian V. Underwood
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

As more and more computers and workstations enter the workplace they are inevitably connected to a network. Networks provide the interconnection necessary for computers to share common data, peripherals and other system resources. Distributed computing allows network applications to access functions or processes on remote computers. Developing network applications specifically to interact and draw upon resources of multiple computers creates the groundwork for a distributed system or distributed computing environment (DCE). An ideal distributed system is self monitoring and resilient to failures. In the event of a failure the system should dynamically reconfigure itself with automatic fail-over for applications that fall victim to the fault. Transparency of fault tolerant mechanisms is desirable, especially when introducing legacy applications into the distributed system. The reduction of application development efforts heavily relies on the availability of portable, non-invasive, fault tolerance providing extensions, which introduce mechanisms for uninterruptible service by insertion into existing distributed applications. To test the potential for addressing some of these desired capabilities for a distributed system implemented within a CORBA distributed computing environment, the Interactive-Group Object-Replication (IGOR) system was developed. IGOR is a system of objects that provides fault tolerance through object replication by arranging replicas in fault tolerant groups which interact to provide access to redundant data and services. For purposes of portability, interoperability and to evaluate the CORBA environment, IGOR was designed with the constraint of lying entirely within the CORBA architecture and using IIOP as the communication protocol. This guarantees its portability over changes in platform and network technologies. The IGOR system is re-configurable and its fault tolerance mechanisms are completely transparent to client applications.
K-16 partnerships: casting a broad net for filling the critical gaps in engineering
Authors: E. Q. Villa
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The University of Texas at El Paso (USA) has a long standing commitment to pre-college outreach and recruitment in engineering and science. An array of programs provides rich venues for attracting young people into engineering-, technology- and science-related careers. These account for contact with over 8,000 young people every year- each with opportunities to explore a number of career-related options and to interact with professional engineers, scientists, undergraduate/graduate science and engineering students and university faculty. Moreover, the College aggressively supports K-12 mathematics and science education reform in area schools-advocating and facilitating the implementation of hands-on standards-based curriculum in subject/content areas most critical in preparing young people for pursuing a more rigorous course of study at the university.
Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison
Authors: Isabelle Puaut, Christophe Pais
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We propose in this paper an algorithm for off-line selection of the contents of on-chip memories. The algorithm supports two types of on-chip memories, namely locked caches and scratchpad memories. The contents of on-chip memory, although selected off-line, is changed at run-time, for the sake of scalability with respect to task size. Experimental results show that the algorithm yields to good ratios of on-chip memory accesses on the worst-case execution path, with a tolerable reload overhead, for both types of on-chip memories. Furthermore, we highlight the circumstances under which one type of on-chip memory is more appropriate than the other depending of architectural parameters (cache block size) and application characteristics (basic block size).
Identifying Governance Dimensions to Evaluate Information Systems Security in Organizations
Authors: Gurpreet Dhillon, Gurvirender Tejay, Weiyin Hong
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Prior studies in information systems security have a limited emphasis on empirically identifying security dimensions. This research paper presents the results of an empirical study to understand governance dimensions of information systems security. The research study was conducted in three phases involving interviews, an exploratory phase and a confirmatory phase. The exploratory phase generated a 4-factor, 16-item model for behavioral security of an organization. The confirmatory phase involving structural equation modeling validated the impact of governance dimensions on the overall information systems security of an organization. Data was collected from two different samples of 163 and 175 respondents for each phase respectively. The results suggest that the governance dimensions impact information system security of an organization through behavioral security.
Towards semantic interoperability in healthcare: ontology mapping from SNOMED-CT to HL7 version 3
Authors: Amanda Ryan
Venue: Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72 (2006)

One of the most successful Healthcare Information Models is version 2 of the Health Level 7 (HL7) standard. However, this standard has various problems, mainly its lack of semantic interoperability. This shortfall was addressed in HL7 Version 3, a newer standard which has been designed to solve this problem. Total semantic interoperability cannot be achieved without defined terminology, and to this end the use of the Systemised Nomenclature of Medicine - Clinical Terms (SNOMED-CT) is proposed. The difficulty arrives when deciding how to integrate the information model and the terminology. The line between where one ends and the other begins is often indistinct. This paper describes a proposal for normalising the two using ontology mapping and basing HL7 message models on SNOMED-CT concepts and their relationships, in an effort to further total semantic interoperability and seamless communication between healthcare entities.
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
Authors: Laszlo Egri, Benoit Larose, Pascal Tesson
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric Krom monotone SNP. The deep result of Reingold [17] on the complexity of undirected connectivity suffices to show that symmetric Datalog queries can be evaluated in logarithmic space. We show that for a number of constraint languages \Gamma, the complement of the constraint satisfaction problem CSP(\Gamma) can be expressed in symmetric Datalog. In particular, we show that if CSP(\Gamma) is first-order definable and \Lambda is a finite subset of the relational clone generated by \Gamma then ¬CSP(\Lambda) is definable in symmetric Datalog. Over the two-element domain and under standard complexity-theoretic assumptions, expressibility of ¬CSP(\Gamma) in symmetric Datalog corresponds exactly to the class of CSPs computable in logarithmic space. Finally, we describe a fairly general subclass of implicational (or 0/1/all) constraints for which the complement of the corresponding CSP is also definable in symmetric Datalog. Our results provide preliminary evidence that symmetric Datalog may be a unifying explanation for families of CSPs lying in L.
A revocable backup system
Authors: Dan Boneh, Richard J. Lipton
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

We present a system which enables a user to remove a file from both the file system and all the backup tapes on which the file is stored. The ability to remove files from all backup tapes is desirable in many cases. Our system erases information from the backup tape without actually writing on the tape. This is achieved by applying cryptography in a new way: a block cipher is used to enable the system to "forget" information rather than protect it. Our system is easy to install and is transparent to the end user. Further, it introduces no slowdown in system performance and little slowdown in the backup procedure.
Quality of service (qos) support for multimedia applications in large-scale networks
Authors: Johnny Wong, Wallapak Tavanapong
Venue:  (2006)

This dissertation studied issues pertaining to QoS provision for multimedia applications at the application layer. We initially studied Internet routing pathology and Internet routing stability by repeating experimental and analytical methods conducted by Paxson in 1996. No similar study was done in recent years. Our findings show that routing behavior of the Internet in 2006 are different from those reported in 1996 in some important aspects. Second, we investigated different stochastic models (e.g. self-similar processes, Auto-Regressive Integrated Moving-Average (ARIMA)) in order to find a suitable model that describes available bandwidth over time of an end-to-end path between two Internet hosts. Our finding of the suitable model is beneficial to predicting of future values of available bandwidth along an end-to-end path. To the best of our knowledge, no similar study was conducted. Third, we designed and evaluated a new path monitoring algorithm inferring available bandwidth of an end-to-end path without monitoring all the paths to minimize monitoring overhead. Our algorithm does not rely on underlying network-layer topology information as required in topology-aware path monitoring techniques. Finally, to complement the above study, we introduced our multicast protocol named "core-set routing" for transmitting multimedia data from a set of senders to a set of receivers, taking QoS into account. The protocol is suitable for interactive multi-sender multimedia applications such as video conferencing and network gaming.
Efficient machine-code test-program induction
Authors: F. Corno, G. Cumani, M. Sonza Reorda, G. Squillero
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Technology advances allow integrating an entire system on a single chip, including memories and peripherals. The testing of these devices is becoming a major issue for chip manufacturing industries. This paper presents a methodology, similar to genetic programming, for inducing test programs. However, it includes the ability to explicitly specify registers and resorts to directed acyclic graphs instead of trees. Moreover, it exploits a database containing the assembly-level semantics associated with each graph node. This approach is extremely efficient and versatile: candidate solutions are translated into source-code programs allowing millions of evaluations per second. The proposed approach is extremely versatile: the macro library allows the target processor and the environment to be changed easily. The approach was verified on three processors with different instruction sets, different formalisms and different conventions. A complete set of experiments on a test function is also reported for the SPARC processor.
Nontrivial analytic signals with positive instantaneous frequency and band-limited amplitude
Authors: M. I. Doroslovacki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Questions have previously been raised about the existence of an analytic signal with positive instantaneous frequency when the form of the analytic signal is prescribed. Here, it is shown that the complex function a(t)exp[j(/spl omega//sub 0/t+m(t))] is an analytic signal when m(t) is a real periodic function and a(t) is a band-limited real function with the maximum bandwidth depending on /spl omega//sub 0/ and the fundamental frequency of m(t). That implies as a special case m(t) which is simultaneously a periodic and piecewise polynomial. Positivity of the instantaneous frequency is simply obtained by requiring that the absolute value of the first derivative of m(t) is smaller than /spl omega//sub 0/.
News: A Structure for Unstructured Data Search
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

The Unstructured Information Management Architecture is a software development framework developed at IBM to help realize the valueofunstructured data search. IBM made UIMA open source in mid-2005 to encourage development of domain analytics. In early December 2006,IBMjoined some of the technology industry's other leading governmental and academic sector players to form the UIMA Technical Committeeat the Organization for the Advancement of Structured Information Standards. The UIMA framework was transferred to the Apache Foundation's incubator concurrent with the formation of the OASIS committee.
ZeroBio - Evaluation and Development of Asymmetric Fingerprint Authentication System Using Oblivious Neural Network Evaluation Protocol
Authors: Kei Nagai, Hiroaki Kikuchi, Wakaha Ogata, Masakatsu Nishigaki
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We propose a cryptographic protocol for biometrics authentication without revealing personal biometrical data against malicious verifier. Our protocol uses a neural network and zero-knowledge interactive proof. In this paper, we developed a sample implementation system of our proposed protocol and we evaluate the performance and the accuracy of the proposed protocol. Especially, we study several algorithms for feature extraction of minutiae of fingerprint which is appropriate to our protocol. We examine false acceptance rates and rejection rates.
A Security Model and Architecture for Multichannel E-Government Systems
Authors: MariaGrazia Fugini
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper presents a service-oriented model and architecture for security in multichannel information systems of Public Administrations, where services can be delivered to citizens and enterprises on various channels, including mobile systems. The model and architecture are based on the definition of service delivery channels given in some ongoing EGovernment projects. In particular, the security model is framed in the field of Services to e-Employment, as studied in the SEEMP (Single European Employment Market Place) project, using models and tools that have been implemented in a previous project on adaptive multichannel information systems.
Path Shortening Schema for Minimum Delay Spanning Tree on Overlay Multicast
Authors: Hiroki Saito, Yoichi Nakamura
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Overlay networks are expected to play a significant role in interactive group applications in the Internet. In these application, since the applications require broadcast communication, application layer multicast under the overlay networks involving all active participants is a reasonable solution. Therefore, considering that the applications are generally delay sensitive, minimizing delay on an overlay multicast tree becomes important issue. In this paper, we propose a novel schema that allows us to minimize delay in overlay multicast tree. Our schema consists two-phase procedure: join procedure and refinement procedure. The join procedure performs which node on multicast tree to select and to connect it when a new node joins multicast tree. The refinement procedure corrects imbalance of multicast tree, and restructures it.
Modeling of the non-linear acoustic response of bubbles by Volterra series analysis
Authors: S. M. Simmons
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The ability to determine the size distribution of a field of bubbles has a wide range of practical applications. Bubbles have traditionally been detected by using either optical or acoustic techniques. Bubbles exhibit strong acoustic resonance properties dependent on their size. By probing a field of bubbles it is possible to form an estimate of the range of sizes present by analysing the scattered data. There are a number of acoustic bubble sizing methods currently available, some of which exploit the nonlinear dynamic behaviour of the bubble. By modeling this behaviour, improvements may be made to the estimation techniques. This paper presents estimates for the quadratic transfer function of a single bubble based on the Volterra series. A method of estimating the Volterra kernels using a neural network is presented which significantly reduces the quantity of data required to form an estimate of the transfer function.
Engineering education in Japan: my experience
Authors: J. R. McGuire
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

While attending a Japanese National University I observed many unique aspects of engineering education in Japan. Most of these unique aspects point toward three interesting themes: Preparation, Fraternity, and Mentorship. The effects of these characteristics are discussed and compared to engineering education in the United States. 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
Do Architecture Design Methods Meet Architects' Needs?
Authors: Davide Falessi, Giovanni Cantone, Philippe Kruchten
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Several Software Architecture Design Methods (SADM) have been published, reviewed, and compared. But these surveys and comparisons are mostly centered on intrinsic elements of the design method, and they do not compare them from the perspective of the actual needs of software architects. We would like to analyze the completeness of SADM from an architect's point of view. To do so, we define nine categories of software architects' needs, propose an ordinal scale for evaluating the degree to which a given SADM meets the needs, and then apply this to a small set of SADMs. The contribution of the paper is twofold: (i) to provide a different and useful frame of reference for architects to select SADM, and (ii) to suggest SADM areas of improvements. We found two answers to our question: "do architectural design methods meet the needs of the architect?" Yes, all architect's needs are met by one or another SADM, but No, no architectural design method meets simultaneously all the needs of an architect. This approach may lead to improvements of existing SADMs.
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
Authors: Dirk Neumann, Bjorn Schnizler, Ilka Weber, Christof Weinhardt
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-proof and more importantly allocative efficient. The VCG mechanism retains its properties for combinatorial allocation problems. From a computational perspective the VCG has to solve two problems: (1) the winner-determination (2) the determination of the prices. However, both problems are complex (NP-hard), when complementarities are present. The Pricing-Per-Column (PPC) auction is another approach to solve the combinatorial allocation problem. In essence, it applies the Vickrey principle to any possible combination of goods and determines the overall winning bids. PPC is computationally less demanding, however, it can be shown that PPC is not necessarily efficient. Apparently, solving the tension between computational and game-theoretic properties is a challenging task in mechanism design. Engineering auctions suggests to lower requirements upon the auction. In this paper the evaluation of the PPC concerning approximate efficiency is presented - in an analytical and simulative evaluation the PPC is compared to the VCG and it is shown that the efficiency losses incurred by the PPC mechanism are very small.
Verification of Peer-to-peer Algorithms: A Case Study
Authors: Rana Bakhshi, Dilian Gurov
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The problem of maintaining structured peer-to-peer (P2P) overlay networks in the presence of concurrent joins and failures of nodes is the subject of intensive research. The various algorithms underlying P2P systems are notoriously difficult to design and analyse. Thus, when verifying P2P algorithms, a real challenge is to find an adequate level of abstraction at which to model the algorithms and perform the verifications. In this paper, we propose an abstract model for structured P2P networks with ring topology. Our model is based on process algebra, which, with its well-developed theory, provides the right level of abstraction for the verification of many basic P2P algorithms. As a case study, we verify the correctness of the stabilization algorithm of Chord, one of the best-known P2P overlay networks. To show the correctness of the algorithm, we provide a specification and an implementation of the Chord system in process algebra and establish bisimulation equivalence between the two.