ppxscal/embedding_network huggingface dataset:
SyDeR&mdash;System design for reusability
Authors: Frank Feldkamp, Michael Heinrich, Klaus Dieter Meyer-Gramann
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

A fixed set of components with a fixed set of properties is often regarded as a defining characteristic of configuration design problems. In configuration design for larger and more complex systems (e.g., street cars), however, this often is not really true. The reason is that sometimes the component library offers no component that meets the actual requirements, so that a new component has to be added to the library. In general, configuration design for larger products must be interactive: interactive in the sense that the user controls the configuration process and in the sense that the phases of knowledge acquisition and configuration are partly mixed. This paper describes a method and a corresponding software tool (SyDeR, System Design for Reusability) that support the interactive configuration design of complex products, especially in the tendering phase. It combines three different technologies:&bull; structural modeling of technical systems;&bull; a library for technical solutions, which is based upon taxonomies and allows the reuse of the technical solutions;&bull; constraint techniques to propagate design decisions and check designs for consistency to support interactive configuration design.This paper gives an overview of the functionality of the SyDeR tool and describes the main ideas behind the modeling language, which is especially oriented towards the requirements of system design problems. It also explains how we integrated structural modeling, taxonomies, and advanced constraint reasoning techniques into real-world applications.
Recursion over objects of functional type
Authors: Joëlle Despeyroux, Pierre Leleu
Venue: Mathematical Structures in Computer Science (2001)

This paper presents an extension of the simply typed &lambda;-calculus that allows iteration and case reasoning over terms of functional types that arise when using higher order abstract syntax. This calculus aims at being the kernel for a type theory in which the user will be able to formalize logics or formal systems using the LF methodology, while taking advantage of new induction and recursion principles, extending the principles available in a calculus such as the Calculus of Inductive Constructions. The key idea of our system is the use of modal logic S4. We present here the system, its typing rules and reduction rules. The system enjoys the decidability of typability, soundness of typed reduction with respect to the typing rules, the Church&ndash;Rosser and strong normalization properties and it is a conservative extension over the simply typed &lambda;-calculus. These properties entail the preservation of the adequacy of encodings.
An empirical analysis of the IEEE 802.11 MAC layer handoff process
Authors: Arunesh Mishra, Minho Shin, William Arbaugh
Venue: ACM SIGCOMM Computer Communication Review (2003)

IEEE 802.11 based wireless networks have seen rapid growth and deployment in the recent years. Critical to the 802.11 MAC operation, is the handoff function which occurs when a mobile node moves its association from one access point to another. In this paper, we present an empirical study of this handoff process at the link layer, with a detailed breakup of the latency into various components. In particular, we show that a MAC layer function - probe is the primary contributor to the overall handoff latency. In our study, we observe that the latency is significant enough to affect the quality of service for many applications (or network connections). Further we find variations in the latency from one hand-off to another as well as with APs and STAs used from different vendors. Finally, we discuss optimizations on the probe phase which can potentially reduce the probe latency by as much as 98% (and a minimum of 12% in our experiments). Based on the study, we draw some guidelines for future handoff schemes.
On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control
Authors: Maithili Narasimha, Gene Tsudik, Jeong Hyun Yi
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Peer-to-peer systems enable ef.cient resource aggregation and are inherently scalable since they do not depend on any centralized authority. However, lack of a centralized authority, prompts many security-related challenges. Providing efficient security services in these systems is an active research topic which is receiving much attention in the security research community.In this paper, we explore the use of threshold cryptography in peer-to-peer settings (both Internet- and MANET-based) to provide, in a robust and fault tolerant fashion, security services such as authentication, certificate issuance and access control. Threshold cryptography provides high availability by distributing trust throughout the group and is, therefore, an attractive solution for secure peer-groups. At least, so it seems. Our work investigates the applicability of threshold cryptography for membership control in peer-to-peer systems. In the process, we discover that one interesting recently proposed scheme contains an unfortunate (yet serious) flaw. We then present an alternative solution and its performance measurements. More importantly, our preliminary work casts a certain degree of skepticismon the practicality and even viability of using (seemingly attractive) threshold cryptography in certain peer-to-peer settings.
The use of computational analysis to design novel drugs
Authors: T. Mavromoustakos, P. Zoumpoulakis, M. Zervou, I. Kyrikou, A. Kapou, N. Benetis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Hypertension is a growing undesired symptom which damages health and threatens mostly the developed societies. It is estimated that 20% of the Greek population suffers from hypertension. Research efforts for the controlling of hypertension are focused in blocking Ang II release and more recently in competing Ang II binding on AT1 receptors. This latest approach generated the synthesis of losartan and promoted it in the pharmaceutical market (COZAAR). Other derivative drugs which fall into SARTAN's class followed. To comprehend the stereoelectronic requirements which may lead to the better understanding of the molecular basis of hypertension, the stereochemical features of angiotensin II, its peptide antagonists sarmesin and sarilesin, synthetic peptide analogs, AT1 non-peptide antagonists commercially available as well as synthetic ones were explored. AT1 antagonists are designed to mimic the C-terminal part of Ang II [1]. In this aspect, it is proposed that the butyl chain of losartan may mimic the isopropyl chain of Ile, the tetrazole ring mimics the C-terminal carboxylate group and the imidazole ring the corresponding imidazole ring of His [6]. The drug design is based on the optimization of superimposition studies of losartan with C-terminal part of sarmesin [2].
Energy savings and speedups from partitioning critical software loops to hardware in embedded systems
Authors: Greg Stitt, Frank Vahid, Shawn Nematbakhsh
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

We present results of extensive hardware/software partitioning experiments on numerous benchmarks. We describe our loop-oriented partitioning methodology for moving critical code from hardware to software. Our benchmarks included programs from PowerStone, MediaBench, and NetBench. Our experiments included estimated results for partitioning using an 8051 8-bit microcontroller or a 32-bit MIPS microprocessor for the software, and using on-chip configurable logic or custom application-specific integrated circuit hardware for the hardware. Additional experiments involved actual measurements taken from several physical implementations of hardware/software partitionings on real single-chip microprocessor/configurable-logic devices. We also estimated results assuming voltage scalable processors. We provide performance, energy, and size data for all of the experiments. We found that the benchmarks spent an average of 80&percnt; of their execution time in only 3&percnt; of their code, amounting to only about 200 bytes of critical code. For various experiments, we found that moving critical code to hardware resulted in average speedups of 3 to 5 and average energy savings of 35&percnt; to 70&percnt;, with average hardware requirements of only 5000 to 10,000 gates. To our knowledge, these experiments represent the most comprehensive hardware/software partitioning study published to date.
Quality Time
Authors: Ramnivas Laddad, Roger Alexander
Venue: IEEE Software (2003)

Aspect-Oriented Programming Will Improve Quality, Ramnivas LaddadSoftware engineers arealways looking for ways to improve modularity in software. Recently, aspect-oriented programming emerged as a new modularity technique that aims to cleanly separatethe implementation of crosscutting concerns(requirements and design elements that affect multiple modules). Several characteristics of AOP work together to improve software quality.Aspect-Oriented Programming: the Real Costs?, Roger AlexanderThe essence of aspect-oriented programming is that crosscutting concerns are factored into distinct abstractions (that is, aspects) that are solely responsible for a particular crosscutting concern. This raises the system's modularity and increases cohesion of the abstractions that are primary concerns. We must understand and address AOP's significant weaknesses before we can realize its benefits.
Experiences using a dual wireless technology infrastructure to support ad-hoc multiplayer games
Authors: Hartmut Ritter, Thiemo Voigt, Min Tian, Jochen Schiller
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Multiplayer games for mobile wireless devices are becoming increasingly popular. Many modern devices such as PDAs or mobile telephones are equipped with Bluetooth interfaces. Bluetooth facilitates the formation of ad-hoc networks thus enabling users to set up multiplayer games spontaneously. On the other hand, Bluetooth has strong restrictions in terms of transmission range and the number of users per piconet. We deploy additional infrastructure in order to overcome these shortcomings. This infrastructure uses a second wireless technology that sets up and maintains a consistent view of a distributed game by exchanging information about the status and location of players. We set up an experimental testbed consisting of single-board communication devices developed in our lab and Bluetooth-equipped PDAs.Our experiments show that the proposed infrastructure is able to extend the range of games beyond the coverage of a Bluetooth piconet. Furthermore, we are able to track players. Smooth handovers between piconets are also possible. However, due to the current limitations of Bluetooth, handovers are not fast enough to enable highly interactive gaming across different piconets. We present a game that uses this and discuss future application scenarios.
Implementation of the ASP organizing vision: the role of participation and trust
Authors: Rajiv Kishore
Venue: Business strategies for information technology management (2003)

A new breed of IT service providers, termed Application Service Providers (ASPs), has emerged during the last several years. While the ASP paradigm is opening new options for strategic governance of organizational IT infrastructures, implementation of this model is fraught with several uncertainties. This chapter describes a particular type of uncertainty, termed the "know-what" uncertainty, that firms generally face as they implement any techno-organizational innovation, and discusses some specific know-what uncertainties associated with the client adoption of the ASP paradigm. The chapter then discusses the role that participation and trust (in the ASP organizing vision) play in mitigating the client-side know-what uncertainties during the course of adoption and implementation of this new IT governance model. The chapter also provides some recommendations for clients and vendors for making this new IT services paradigm a successful reality.
An exploration of the relationship between software development process maturity and project performance
Authors: James J. Jiang, Gary Klein, Hsin-Ginn Hwang, Jack Huang, Shin-Yuan Hung
Venue: Information and Management (2004)

Software projects have a high rate of failure. Organizations have tried to reduce the rate through methodological approaches but with little perceived success. A model of software development maturity (the capability maturity model (CMM)) describes managerial processes that can he used to attack software development difficulties from the managerial control perspective at five maturity levels. Our study examined performance of projects in relation to the activities at these various levels of maturity. A survey of software engineers indicated that the activities associated with the managerial control of development related positively to project performance measures. However, not each level of maturity demonstrated observable benefits, indicating that greater caution is needed in the planning and implementation of the activities.
Prototyping and formal analysis of concurrent and distributed systems
Authors: Bernd Krämer
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We sketch the specification language SEGRAS and illustrate related formal validation techniques with a few simple examples including a dynamic reconfiguration problem. The language is particularly suited for concurrent and distributed applications. It draws from two main sources: algebraic specifications of abstract data types and a special class of high-level Petri nets. The language is supported by an experimental specification environment whose semantic tools exploit the operational semantics of the language.
Special issue on Algorithmic aspects of functional programming languages
Authors: Chris Okasaki
Venue: Journal of Functional Programming (2001)

Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.
Introducing complete graphs in molecular connectivity studies
Authors: Lionello Pogliani
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Molecular connectivity uses as key parameters for the definition of the valence molecular connectivity indices, χv, the valence delta values, δv, which are, practically, expressions of the electronic structure of the skeletal atoms in a molecule. These values, for second row atoms, can be derived from the hydrogen-suppressed chemical pseudograph. With higher row atoms arises the problem of the non-valence core electrons, which play a determinant role in the ionization, electron affinity, electronegativity, and in the size of atoms. Up to date, molecular connectivity has solved the 'core problem' with the definition of a valence delta, for the χv indices, centered on the atomic number, Z, as well as on the valence electron count, Zv. For the electrotopological state indices has, instead, the proposed valence delta is centered on the principal quantum number and on a valence delta, which can easily be derived from a chemical pseudograph. It should be underlined that the electrotopological indices are the basic tools used to define the molecular pseudoconnectivity indices. Nevertheless, the 'core problem' has recently been solved with graph concepts, and, especially with odd complele graphs, which together with the concept of pseudograph give rise to a full graph representation of a hydrogen-suppressed molecule made up of any type of atoms. Even with complete graphs two algorithms have been shown to be useful for the valence delta values. These two algorithms for the valence delta, which mimic the old algorithms and recent QSPR/QSAR studies have shown that both odd complete algorithms are a useful solution for the 'core problem'. These two algorithms have shown their validity with model studies of different properties of halocompounds.
Frequent-Pattern based Iterative Projected Clustering
Authors: Man Lung Yiu, Nikos Mamoulis
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Irrelevant attributes add noise to high dimensional clustersand make traditional clustering techniques inappropriate.Projected clustering algorithms have been proposed to findthe clusters in hidden subspaces. We realize the analogy betweenmining frequent itemsets and discovering the relevantsubspace for a given cluster. We propose a methodology forfinding projected clusters by mining frequent itemsets andpresent heuristics that improve its quality. Our techniquesare evaluated with synthetic and real data; they are scalableand discover projected clusters accurately.
DateLens: A fisheye calendar interface for PDAs
Authors: Benjamin B. Bederson, Aaron Clamage, Mary P. Czerwinski, George G. Robertson
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

Calendar applications for small handheld devices are growing in popularity. This led us to develop DateLens, a novel calendar interface for PDAs designed to support complex tasks. It uses a fisheye representation coupled with compact overviews to give the big picture in a small space. The interface also gives users control over the visible time period, as well as supporting integrated search to discover patterns and outliers. Designed with device scalability in mind, DateLens currently runs on desktop computers as well as PDAs. Two user studies were conducted to examine the viability of DateLens as a replacement for traditional calendar visualizations. In the first study, non-PDA users performed complex tasks significantly faster with DateLens than with the Microsoft Pocket PC 2002TM calendar (using a PDA emulator). In addition, they rated DateLens as being easier to use than the default calendar application for a majority of the tasks. In the second study, the participants were expert Pocket PC users and the software was run on their own devices. Again, DateLens performed significantly faster for the complex tasks, and there were satisfaction differences favoring each calendar for different kinds of tasks. From these studies, it is clear that DateLens is superior for more complex tasks such as those associated with longer time periods. For daily event tracking, users familiar with the default Pocket PC calendar strongly preferred its daily view and behaviors.
Exploring the Locus of Profitable Pollution Reduction
Authors: Andrew King, Michael Lenox
Venue: Management Science (2002)

In this paper, we explore the locus of profitable pollution reduction. We propose that managers underestimate the full value of some means of pollution reduction and so under exploit these means. Based on evidence from previous studies, we argue that waste prevention often provides unexpected innovation offsets, and that onsite waste treatment often provides unexpected cost. We use statistical methods to test the direction and significance of the relationship between the various means of pollution reduction and profitability. We find strong evidence that waste prevention leads to financial gain, but we find no evidence that firms profit from reducing pollution by other means. Indeed, we find evidence that the bene fits of waste prevention alone are responsible for the observed association between lower emissions and profitability.
Web-based configuration assistants
Authors: Giuseppe Attardi, Antonio Cisternino, Maria Simi
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Configuration assistants are tools for guiding the final user in simple configuration tasks, such as product assembling and customization or study plans generation. For their wide availability, web-based configuration assistants are valuable in fields such as electronic commerce and information services. We describe a general approach for building web-based configuration assistants: from a high-level description of the configuration constraints and of the basic items, given in a declarative language, the hypertext files for user guidance and the Java code for constraint checking are generated. We claim that the general approach of process-oriented configuration, where the user is guided through the configuration process by an explanatory hypertext, as opposed to product-oriented configuration, where one starts from a high-level description of the product of the configuration, is better suited for many application domains.
Evaluation of distributed communication systems
Authors: Ian Parsons
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Selecting a distributed communication system is a balancing act. Ease of use, efficiency of the final product, and future needs are not mutually exclusive considerations. Several questions spring to mind immediately. What are the requirements of the communication system? What is available to use? What are the requirements of the user ? Software engineers desire software to have clean interfaces and to make any internal details inaccessible to the other components. Performance users want the software to be scalable, efficient, and easy to use, read, and debug. This paper examines four communication systems (ISIS, NMP, PVM, and Concert/C) from these two points of view.Several programs designed to test the performance of the communication system are used as examples for comparing features. These programs are neither definitive test programs nor do they have complicated communication structures. Rather, they are used to highlight potential problem areas and implementation differences.All four of these communication systems are being evaluated for the Enterprise project. Enterprise is a programming environment for developing and running distributed parallel programs on a network of workstations. Enterprise, using templates and a precompiler, constructs a software layer around the application. The user is shielded from the tiresome low-level details of hand crafting the distributed communication portion of the application. Other software tools within Enterprise manage and monitor the distributed program.For two of the communication systems (ISIS and NMP) the code was created using Enterprise. The other two systems (PVM and Concert/C) are compared using handcrafted code. A comparision between the Enterprise code and handcrafted code is done using NMP.