ppxscal/embedding_network huggingface dataset:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Authors: B. Fortz, A. R. Mahjoub, S. T. McCormick, P. Pesneau
Venue: Mathematical Programming: Series A and B (2006)

We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a &#x201c;ring&#x201d;) to which each edge belongs, does not exceed a given length K. We identify a class of inequalities, called cycle inequalities, valid for the problem and show that these inequalities together with the so-called cut inequalities yield an integer programming formulation of the problem in the space of the natural design variables. We then study the polytope associated with that problem and describe further classes of valid inequalities. We give necessary and sufficient conditions for these inequalities to be facet defining. We study the separation problem associated with these inequalities. In particular, we show that the cycle inequalities can be separated in polynomial time when K&#x2264;4. We develop a Branch-and-Cut algorithm based on these results and present extensive computational results.
On inductively minimal geometries that satisfy the intersection property
Authors: Philippe Cara, Dimitri Leemans
Venue: Journal of Combinatorial Theory Series A (2005)

We prove that, up to isomorphism, for a given positive integer n, there is only one inductively minimal pair (Γ, Sym(n)) of rank n - 1 that satisfies the intersection property. Moreover, we show that the diagram of Γ is linear.
Simulators and assemblers for minicomputers
Authors: Donald D. Fisher
Venue: ACM SIGSIM Simulation Digest (1975)

Program debugging for minicomputers with paper tape input can be a frustrating and time consuming process. One way to simplify this process is to develop a simulator for the minicomputer which operates on a large host computer. The assumption is made that turn around time on the host computer is reasonable and that debug diagnostics are included. The first step of the simulator design is to develop a hardware reference language description of the instruction set. This step is useful even if a simulator is not developed because it requires one to obtain a complete understanding of the instruction set, the registers, and the interactions of all of the control signals. Such understanding is a prerequisite to the development of successful programs for the mini, especially at the assembler level. This paper describes the implementation of simulator-assembler packages for minicomputers.
The characterization of stacked α-Si/SiGe/α-Si sensing membrane
Authors: Chia-Ming Yang, Chao-Sung Lai, Chih-Yao Wang, Cheng-En Lue, Jung-Chung Chou, Wen-Yaw Chung, Dorota G. Pijanowska
Venue: Microelectronic Engineering (2005)

In this work, the stacked α-Si/SiGe/α-Si film was first used as ion sensing membrane of Electrolyte-Insulator-Semiconductor. All sensing membranes were deposited in low pressure chemical vapor deposition with GeH4 and Si2H6 mixtures. Comparing to α-Si sensing membrane, the characteristics of the α-Si/SiGe/α-Si sensing membrane were studied including pH sensitivity and drift phenomena. The pH sensitivity of α-Si/SiGe/α-Si and α-Si EIS was 83.1±2.1 and 76.8±2.2mV/pH, respectively. However, the drift voltage was a little large and resulted in the unstable sensitivity. A physical model was proposed for the unstable sensitivity phenomena. This unstable phenomenon was eliminated by baking treatment.
Review of "Simulation with GASP_PL/I, by A. Alan B. Pritsker and Robert E. Young", John Wiley and Sons, New York, 1975
Venue: ACM SIGSIM Simulation Digest (1976)

Another example of the writings of Prisker who has again suceeded in producing a workable volume for the classroom. The book is well structured with a logical flow development of the language GASP_PL/I. 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
Sensor Networks and Grid Middleware for Laboratory Monitoring
Authors: Jamie M. Robinson, Jeremy G. Frey, Andy J. Stanford-Clark, Andrew D. Reynolds, Bharat V. Bedi
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

By combining automatic environment sensing and experimental data collection with broker based messaging middleware, a system has been produced for the real-time monitoring of experiments whilst away from the lab. Changes in the laboratory environment are encapsultated as simple messages, which are published using an MQTT compliant broker. Clients subscribe to the MQTT stream, and perform a data transform on the messages; this may be to produce a user display or to change the format of the message for republishing. For example, anMQTT client written for the Java MIDP platform can be run on a smart-phone with a GPRS Internet connection, freeing us from the constraints of the network. We present an overview of the technologies used, and how these are helping chemists make the best use of their time.
Helping End-Users "Engineer" Dependable Web Applications
Authors: Sebastian Elbaum, Kalyan-Ram Chilakamarri, Bhuvana Gopal, Gregg Rothermel
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

End-user programmers are increasingly relying on web authoring environments to create web applications. Although often consisting primarily of web pages, such applications are increasingly going further, harnessing the content available on the web through "programs" that query other web applications for information to drive other tasks. Unfortunately, errors can be pervasive in web applications, impacting their dependability. This paper reports the results of an exploratory study of end-user web application developers, performed with the aim of exposing prevalent classes of errors. The results suggest that end-users struggle the most with the identification and manipulation of variables when structuring requests to obtain data from other web sites. To address this problem, we present a family of techniques that help end user programmers perform this task, reducing possible sources of error. The techniques focus on simplification and characterization of the data that end-users must analyze while developing their web applications. We report the results of an empirical study in which these techniques are applied to several popular web sites. Our results reveal several potential benefits for end-users who wish to "engineer" dependable web applications.
Code Security Analysis of a Biometric Authentication System Using Automated Theorem Provers
Authors: Jan Jurjens
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authenticity of data are notoriously hard to establish, especially in the context of cryptographic interactions. A lot of research has been devoted to developing formal techniques to analyze abstract specifications of cryptographic protocols. Less attention has been paid to the analysis of cryptoprotocol implementations, for which a formal link to specifications is often not available. In this paper, we apply an approach to determine security goals provided by a C implementation to a industrially-strength biometric authentication system. Our approach is based on control flow graphs and automated theorem provers for first-order logic.
The use of simulation in the design of an inventory control system
Venue: ACM SIGSIM Simulation Digest (1979)

Although the literature abounds with inventory models developed for almost every conceivable set of circumstances, when it comes time to develop an inventory system for a particular application, none of the literature models seem to fit exactly. This requires the analyst to do one or both of the following:a) Modify an existing model to fit the given situation.b) Assume that even though not all of the assumptions in the existing model are satisfied, it will do an adequate job of controlling the inventory.Frequently, simulation is used to evaluate the consequences of following approach b (see, for example references 1, 3, 5, and 8).The purpose of this paper is to demonstrate the use of simulation in the design of a forecasting and inventory control system. The use of alternate approximate modelling strategies will be simulated using an analytic simulation model of the real system on a relatively large sample of parts. The design questions under study will include the forecasting model, the frequency of updating the forecasts, the order quantity model, and the reorder point model. In each case, a very simple and a more complex model will be used. The major thrust is to point out the use of simulation as an aid in evaluating design alternatives.
Querying with Negation in Data Integration Systems
Authors: Zoran Majkic
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. It is characterized by an architecture based on a global schema, with the set of integrity constraints, and a set of sources. In this paper we investigate the way in which Closed World Assumption on a source data base can be coherently propagated to the global schema. The problem to resolve is directly connected by the fact that a global schema has a number (possibly infinite) of minimal models, caused by the incompleteness of source databases w.r.t. the integrity constraints over global schema. The aim of this preliminary work is to open the perspective for query language with negation in Data integration framework.
Phase-only and amplitude-only adaptive algorithms based on a d(3)ls method for smart antenna systems and airborne radar applications
Authors: Tapan K. Sarkar
Venue:  (2005)

Adaptive array signal processing has been used in many applications. One principle advantage of an adaptive array is the ability to recover the desired signal while also automatically placing deep pattern nulls along the direction of the interferences. Adaptive antenna array systems perform by changing amplitudes and phases of the voltages induced at each of the antenna elements. Forming such a weighted sum of the complex voltages could be slow and ineffective for large arrays. Some existing antenna systems possess the capability of using the weights as the phase only at each of the antenna elements to mitigate the undesired interference while preserving simultaneously the desired signal. For these reasons, in this dissertation we propose an adaptive methodology where the weights can be phase-only or amplitude-only. The use of these algorithms results on a faster response and simpler software and hardware design. These algorithms are based on a Direct Data Domain Least Squares (D3LS) approach, in which we utilize only a single snapshot of the data for adaptive processing. In most adaptive algorithms it is necessary to know something about the signal that we are trying to extract in a noisy environment. The D 3LS approach is also available where the direction of arrival (DOA) of the signal of interest (SOI) is known a priori. Further, for Space-Time Adaptive Processing (STAP) applications, the algorithm requires knowledge of the signal Doppler frequency. Hence we need to guarantee a good estimate for the DOA and the Doppler frequency of the SOI. One of the open problems is how to provide a good estimate for the DOA of the SOI when there is uncertainty associated with the assumed DOA due to the atmospheric diffraction or measurement errors. It will be shown that the norm of the adapted weights provide a refined estimate for the actual DOA of the SOI when there are uncertainties associated with their initial estimates. Specifically, the existence of a minimum in the sum of the weights can be used further to estimate the target return angle. It could also be used to perform the detection process as well. So this thesis represents the minimum norm properties of the optimum weights. This could lead to a more accurate estimation of the direction of arrival of the signal or on a detection process, when a good estimate for the direction of arrival information is not available a priori.
A Distributed Monitoring Mechanism for Mobile Ad Hoc Networks
Authors: Jianhua Song, Fan Hong, Yajun Guo
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

With emergence of a wide range of wireless devices, protecting mobile ad hoc networks became an increasingly important and also a more difficult task. Intrusion detection system (IDS) can be deployed as a second line of defense in a Mobile Ad hoc Network (MANET). But it may be impossible to make every wireless node the monitoring nodes due to the resource limitation. So it is important to investigate distributed monitoring mechanism appropriate for ad hoc networks. A distributed scheme based on the concepts of connected weighted dominating set is proposed for selecting the monitoring nodes to detect network packets in ad hoc networks. The proposed scheme is aimed to minimize costs of network monitoring and IDS system. The performance of the proposed scheme is also investigated.
Distance and Matching for Authentication by On-Line Signature
Authors: M. Wirotius, J. Y. Ramel, N. Vincent
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Authentication by on-line handwritten signature is one of the most accepted authentication way, this is due to its easy use and to our cultural habits. In order to improve performances of the authentication process, we propose to take into account, on one part, the global temporal aspect and the efficiency of the writing of the signature and, on the other part, the signature variability of a person by using the only available information, the training signatures. To improve the robustness of the process we propose a method which consists of selecting the representative points in the signature. Curves comparison is based on Dynamic Time Warping (DTW) in an original way. The different methods elaborated are tested on two databases of signatures and compared with the standard use of DTW. It shows the relevance of the improvements. All the modifications that we have presented will allow to obtain an improvement of more than 15%.
Reduced complexity detection methods for continuous phase modulation
Authors: Michael Rice
Venue:  (2005)

Continuous phase modulation (CPM) is often plagued by high receiver complexity. One successful method of dealing with this is the well-known pulse amplitude modulation (PAM) representation of CPM, which was first proposed by Laurent. It is shown that the PAM representation also applies to multi-h CPM and ternary CPM, two previously unconsidered cases. In both cases it is shown that many PAM components may be required to exactly represent the signal. This is especially true of partial-response systems where the memory of the signal is long. Therefore, approximations are proposed which require only a limited number of terms. These extensions of the PAM representation are used to construct reduced-complexity detectors for CPM. These are generalizations of the detector first proposed by Kaleh. These detectors can be used in an optimal configuration, or in a suboptimal reduced-complexity configuration. The PAM complexity-reduction principle is shown explicitly. An exact expression is given for the pairwise error probability for the entire class of PAM-based CPM detectors, not just the extended cases proposed herein. The analysis is performed for the additive white Gaussian noise (AWGN) channel. The performance bound that results from this pairwise error probability is shown to be tighter than a previously published bound for PAM-based CPM detectors. The analysis shows that PAM-based detectors are a special case of the broad class of mismatched CPM detectors. However, it is shown that the metrics for PAM-based detectors accumulate distance in a different manner than metrics for other mismatched and suboptimal detectors. These distance properties are especially useful in applications with greatly reduced trellis sizes. The proposed detectors are included in two case studies. The first is for a multi-h CPM standard used in aeronautical telemetry. Many reduced-complexity detectors are studied in addition to PAM-based detectors. The second case study is for a ternary CPM known as shaped offset QPSK (SOQPSK). Here, the performance of serially concatenated coded SOQPSK is studied along with uncoded systems. It is shown that the coded systems achieve large gains over uncoded systems. However, the design proposed herein achieves these gains with less complexity than previously published designs.
Study of the Impact of Hardware Fault on Software Reliability
Authors: Bing Huang, Xiaojun Li, Ming Li, Joseph Bernstein, Carol Smidts
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

As software plays increasingly important roles in modern society, reliable software becomes desirable for all stakeholders. One of the root causes of software failure is the failure of the computer hardware platform on which the software resides. Traditionally, fault injection has been utilized to study the impact of these hardware failures. One issue raised with respect to the use of fault injection is the lack of prior knowledge on the faults injected, and the fact that, as a consequence, the failures observed may not represent actual operational failures. This paper proposes a simulation-based approach to explore the distribution of hardware failures caused by three primary failure mechanisms intrinsic to semiconductor devices. A dynamic failure probability for each hardware unit is calculated. This method is applied to an example Z80 system and two software segments. The results lead to the conclusion that the hardware failure profile is location related, time dependent, and software-specific.
Enabling Customer-Driven Processes in Value-Added Networks Using an Architecture for E-Collaboration
Authors: Adam Otmar, Pavlina Chikova, Anja Hofer
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Different customer requirements in combination with technological advances caused mainly by the Internet enable new or improved customer-driven business processes. The management of such processes requires a deep but flexible integration of enterprises. In this context new forms of cooperation like E-Collaboration, describing the efficient and effective collaboration of participants in a value-added network, arise. In order to manage customer- driven business processes across such networks, existing concepts and tools for business process management need to be adapted and extended. For that purpose an E-Collaboration architecture is presented in this paper, which shows how cross-enterprise, customer-driven processes can be planned, implemented and controlled in a value-added network. Another important building block is the life-cycle-model that serves as a guideline for the process-oriented creation and operation of cooperations towards a common customer-driven production and bundling of goods and services.
Bridging the Gap between Analysis and Design Using Dependency Diagrams
Authors: Simona Vasilache, Jiro Tanaka
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Requirements specifications often make use of a number of scenarios that are interrelated and that depend on each other in many ways. However, they are often treated separately, one by one. We propose a new type of diagrams, named dependency diagrams, which are able to illustrate the various kinds of relationships existing between scenarios. We make use of a scenario matrix for each scenario and we describe the transformation process of scenarios into state machines, based on the information in the scenario matrices, and that in the dependency diagrams. The result is a number of state machines that can be used for detailed design models and code can further be generated from them. Using our approach, we can bridge the gap between analysis and design and we can bring the developer one step closer to the implementation.
Middleware benchmarking: approaches, results, experiences: Research Articles
Authors: Paul Brebner, Emmanuel Cecchet, Julie Marguerite, Petr Tůma, Octavian Ciuhandu, Bruno Dufour, Lieven Eeckhout, Stéphane Frénot, Arvind S. Krishna, John Murphy, Clark Verbrugge
Venue: Concurrency and Computation: Practice Experience (2005)

The report summarizes the results of the Workshop on Middleware Benchmarking held during OOPSLA 2003. The goal of the workshop was to help advance the current practice of gathering performance characteristics of middleware implementations through benchmarking. The participants of the workshop have focused on identifying requirements of and obstacles to middleware benchmarking and forming a position on the related issues. Selected requirements and obstacles are presented, together with guidelines to adhere to when benchmarking, open issues of current practice, and perspectives on further research. Copyright &copy; 2005 John Wiley & Sons, Ltd.This report has been produced from the OOPSLA 2003 Middleware Benchmarking Workshop. The workshop homepage is at
Design Patterns for Agent-Based Service Composition in theWeb
Authors: IngoM uller, Peter Braun, Ryszard Kowalczyk
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Service-oriented architectures have been recognized as advantageous architectural styles for future enterprise and scientific applications. However, on top of already available middleware layers, many problems regarding services engineering and management have been identified as open issues. The integration of agent-based approaches can provide promising solutions in order to overcome these prevailing obstacles. This paper identifies two agent-based design patterns based on a classification scheme outlining several ways for agent-service integration in the context of agentbased service composition.
Delay Testability Properties of Circuits Implementing Threshold and Symmetric Functions
Authors: Piotr Patronik
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this paper, we present a general method for proving robust delay testability of multi-output threshold circuit. We prove that robust delay testability of some class of multioutput threshold circuits depends only on the set of welldefined properties of the merging circuits. We also prove the robust delay testability properties of two existing design methods of multi-output threshold circuits: one presented by Reddy [28] and the improved one by Rahaman et al. [27].
Extending the ArchC Language for Automatic Generation of Assemblers
Authors: Alexandro Baldassin, Paulo Cesar Centoducatte, Sandro Rigo
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

In this paper we extend the ArchC language with new constructs to describe the assembly language syntax and operand encoding of an instruction set architecture. Based on the extended language we have created a tool which can automatically generate assemblers. Our tool uses the GNU Binutils framework in order to produce the assembler, generating the architecture dependent files necessary to retarget the GNU assembler and the Binutils libraries. We have generated assemblers for the MIPS-I and SPARC-V8 architectures based on ArchC models using our tool. The assemblers generated for both architectures were compared with the default gas assemblers for a set of files taken from the MiBench benchmark, and the ELF object files generated by each pair of assemblers were equivalent in both cases.