ppxscal/embedding_network huggingface dataset:
Integration in Component-Based Software Development Using Design Patterns
Authors: Stephen S. Yau, Ning Dong
Venue: 24th International Computer Software and Applications Conference (2000)

Components-based development is promising in improving software development productivity and software quality by re-using existing well-tested software components. However, one of the challenges of component-based development is how to integrate various components in software systems. In this paper, an approach is presented to apply design patterns to component integration. This approach uses a formal design pattern representation and a design pattern instantiation technique of automatic generation of component wrapper from design patterns.
On Random Symmetric Travelling Salesman Problems
Authors: Alan M. Frieze
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp1 | ZTSP - Z2FAC| = 0(1). The proof is via by the analysis of a polynomial time algorithm that finds a tour only a little longer than Z2FAC.
Using Digital Narratives to Support the Collaborative Learning and Exploration of Cultural Heritage
Authors: Paul Mulholland, Trevor Collins
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Cultural institutions increasingly see the need to play an important role in the lifelong learning ofcitizens. Recent trends, particularly in science museums, have been toward supporting visitors to actively learn rather than passively receive information. Here we propose how narrative can be used within the design of new technologies to support lifelong learning in a cultural setting. Narratives can be used to construct explanations and make sense of the world. Narrative is also central to collaboration and the building of community identity. Heritage collections, whether held privately or curated by a cultural institution convey narratives. Our conceptualisation of narrative, learning theory and curatorial practice indicates that new technology in the cultural domain should: support active interpretation; help reveal the context and process underpinning cultural artefacts; support learning and creativity; and address the challenge to provide an experience that is both entertaining and educational.
Look-Ahead Channel Reservation and Borrowing in Cellular Network System
Authors: Haihong Zheng, Sourav Bhattacharya
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

This paper addresses the channel resource management problem for the cellular wireless network, under various traffic load conditions. Channel borrowing, a critical function in the effective management of cellular networks, is known to offer key performance benefits under hot spot situation. We propose a new channel borrowing approach, termed as LCRB (Look-ahead Channel Reservation and Borrowing) - where the key ideas include the ability to reserve a set of channels for different neighboring cells according to their traffic profile, and to conduct look-ahead channel borrowing to provide channel distribution in anticipation of a forthcoming hot spot. The main benefits includes the timeliness (i.e., reduced delay) of channel borrowing which can assist to meet deadlines of hard real-time message and to reduce the waiting time of uprising call. Simulation has been conducted to demonstrate the benefits.
Modeling Comprehension Processes in Software Development
Authors: Tuomas Klemola, Juergen Rilling
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

As programs become more complex and larger, the sheer volume of information to be comprehended by developers becomes daunting. Software development is fraught with complexity that is difficult to identify a priori. Complexity is relative to the task, the developer'sexperience and the resources available. In this research, we identify comprehension processes applied in software development, the cognitive loads associated with these processes. We present an abstraction of the cognitive environment of the software developer, and introduce techniques to minimize the cognitive effort in the short-term and the long-term.
An optimization of disjunctive queries: union-pushdown
Authors: Jae-Young Chang, Sang-Goo Lee
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Most previous works on query optimization techniques deal with conjunctive queries only because the queries with disjunctive predicates are complex to optimize. Hence, for disjunctive queries, query optimizers based on these techniques generate plans using rather simple methods such as CNF- and DNF-based optimization. However, the plans generated by these methods perform extremely poorly for certain types of queries. The authors propose new query optimization method, union-pushdown, for disjunctive queries. This method is composed of four phases, and each phase utilizes some advantageous techniques of CNF- and DNF-based methods. They analyze the performance of the union-pushdown plan against those of conventional plans and show that union-pushdown can be applied to various disjunctive query types without performance degradation.
Feature-oriented software structuring
Authors: Jürgen K. Müller
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The author describes software structuring for the SW part of computer-based systems (CBS) which is oriented at the evolution of these systems. Traditional SW development methods such as SA/SD, SDL and OO methods are oriented at the logic of the SW functionality itself. They fall short in supporting a minimal development effort. They define SW features to be the counterparts of features of the CBS itself. They are oriented at extensions or changes which are made to the CBS. The software is structured in components such that feature extension is realized by additional SW components only.
Graph Isomorphism is in SPP
Authors: V. Arvind, Piyush P. Kurur
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We show that Graph Isomorphism is in the complexity class SPP, and hence it is in \oplusP (in fact, it is in ModkP for each k \geqslant 2). We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FPSPP algorithm.This general result has other consequences: for example, it follows that the hidden subgroup problem for permutation groups, studied in the context of quantum algorithms, has an FPSPP algorithm. Also, some other algorithmic problems over permutationgroups known to be at least as hard as Graph Isomorphism (e.g. coset intersection) are in SPP, and thus in ModkP for each k \geqslant 2.
Design and implementation of a 100 MHz centralized instruction window for a superscalar microprocessor
Authors: Steven Wallace, N. Dagli, Nader Bagherzadeh
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The maxim of the superscalar architecture is that higher performance can be achieved by executing multiple instructions simultaneously. This can be realized on hardware by using a centralized instruction window. We present the design and implementation of a centralized instruction window capable of out-of-order issue and completion of four instructions per cycle. A compact layout (6.4 mm by 2.2 mm) of a 32-entry instruction window resulted from a full-custom design in 1.0 /spl mu/m (drawn) 3-layer metal CMOS technology. The layout was verified by simulation and shown to operate at a clock frequency over 100 MHz.
A Web-Based Material Requirements Planning Integrated Application
Authors: Liao Qiang, Tham Chen Khong, Wong Yoke San, Wang Jianguo, Chris Choy
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: This paper presents the development of an enterprise application using distributed object technology that integrates material requirements planning (MRP) to a job shop (simulator). The application aims to realize an integrated system that responds rapidly to changing requirements and is able to integrate heterogeneous manufacturing facilities. The application accepts the customer's order and performs material requirements planning. The MRP system then sends daily planned orders to a job shop that carries out real-time scheduling and production. At the same time, orders are sent to suppliers to purchase raw materials. After completing the production task, the job shop returns the relevant information about the finished parts. Once the customer adds or modifies orders, the MRP system will update pertinent data automatically to respond to the changes of customer's requirements rapidly. The Unified Modeling Language (UML) is applied for the analysis and design of the total application. In this integrated application, the MRP system uses Enterprise Java Beans (EJB) that are deployed in a J2EE compliant application server to perform Business-to-Customer transactions and MRP logic. The job shop system uses Common Object Request Broker Architecture (CORBA) specification as communication platform.
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Authors: Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question for the language of arithmetic expressions using a constant for the number one and the operations of product and exponentiation is affirmative, and the complete equational theory also characterises isomorphism in the typed lambda calculus, where the constant for one and the operations of product and exponentiation respectively correspond to the unit type and the product and arrow type constructors. This paper studies isomorphisms in typed lambda calculiwith empty and sum types from this viewpoint. We close an open problem by establishing that the theory of type isomorphisms in the presence of product, arrow, and sum types (with or without the unit type) is not finitely axiomatisable. Further, we observe that for type theories with arrow, empty and sum types the correspondence between isomorphism and arithmetic equality generally breaks down, but that it still holds in some particular cases including that of type isomorphism with the empty type and equality with zero.
PARADIGM (version 2.0): A New HPF Compilation System
Authors: Pramod G. Joisha, Prithviraj Banerjee
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM.The metrics considered include compilation times, execution times, and communication costs. We compare all of these metrics against commercial, industrial strength compilers such as pghpf (v 2.2) and xlhpf (v 1.01) and show the superior benefits of PARADIGM (v 2.0) in all of the metrics used. We also demonstrate how robustly our framework performs in the presence of arbitrary alignments and distributions.The framework's symbolic manipulation capability is derived from an off-the-shelf commercial symbolic analysis software called Mathematica.b Measured metrics for a few popular benchmarks such as Automatic Differentiation and Integration (ADI), Euler Fluxes, TOMCATV and 2-D Explicit Hydrodynamics (EXPL) have been presented.
Branch-Directed and Stride-Based Data Cache Prefetching
Authors: Yue Liu, David R. Kaeli
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Cache memories are commonly used to reduce the performance gap between microprocessor and memory technology. To increase the chances that a cache can provide instructions and data when requested, prefetching can be employed. Prefetching attempts to prime the cache with instructions and data which will be accessed in the near future. The work presented here describes a prefetching algorithm which ties data cache prefetching to branches in the instruction stream. History of the data references is incorporated into a Branch Target Buffer (BTB). Since branch instructions determine which instruction path is followed, data access patterns are also dependent upon branch behavior. Results indicate that combining this strategy with tagged prefetching can significantly improve cache hit ratios. While improving cache hit rates is important, our prefetching policy significantly reduces the overall memory bus traffic.
An Election Based Approach to Fault-Tolerant Group Membership in Collaborative Environments
Authors: James S. Pascoe, Roger J. Loader, Vaidy S. Sunderam
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

In this paper we present a novel approach to fault-tolerant group membership for use predominantly in collaborative computing environments. As an exemplar, we use the Collaborative Computing Transport Layer which offers reliable atomic multicast capabilities for use in collaborative environments such as the Collaborative Computing Frameworks (CCF). Specific design goals of the approach are the elimination of processing overhead due to heartbeats, support for partial failures and extensibility. These goals are satisfied in an approach which uses an IP multicast failure detector and two election based algorithms. By basing failure detection on IP multicast, the need for explicit keep-alive packets is removed, thus in the absence of failures the approach imposes no overhead.
Effect of Friction and Material Compressibility on Deformable Modeling of Human Lung
Authors: Adil Al-Mayah, Joanne Moseley, Mike Velec, Kristy Brock
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

A three dimensional finite element model has been developed to investigate the sliding mechanics and compressibility of human lungs of seven lung cancer patients. The model consists of both lungs, tumor, and chest wall. The interaction between lungs and chest cavities is modeled using surface-based contact with coefficient of friction of 0, 0.1 and 0.2. Experimentally measured hyperelastic material properties of the lungs are applied in the model with different degrees of compressibility using Poisson's ratio (¿) of 0.35, 0.4, 0.45 and 0.499. The analytical results are compared to actual measurements of the bifurcation of the vessels and bronchi in the lungs and tissues. The least absolute average error of 0.21(±0.04) cm is reached when frictionless contact surfaces with hyperelastic material and Poisson's ratio of 0.35 and 0.4 are applied. The error slightly changes in contact models as the coefficient of friction and Poisson's ratio increases. However, Poisson's ratio has more effect in models without contact surfaces where the average error changes from 0.33(±0.11) cm to 0.26(±0.07) cm as the Poisson's ratio increased from 0.35 to 0.499.
Optimization of IG-Based Fuzzy System with the Aid of GAs and Its Application to Software Process
Authors: Sung-Kwun Oh, Keon-Jun Park, Witold Pedrycz
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

We introduce an optimization of information granules (IG)-based fuzzy model with the aid of genetic algorithms (GAs) to describe projects in terms of complexity and development time in experimental software datasets. The proposed fuzzy model implements system structure and parameter identification with the aid of IG and GAs. To identify the structure and the parameters of fuzzy model we use genetic algorithms. The concept of information granulation was coped with to enhance the abilities of structural optimization of fuzzy model. Granulation of information realized with Hard C-Means clustering help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions in the premise part and the initial values of polynomial functions in the consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the GAs and the least square method. An aggregate objective function is constructed in order to strike a sound balance between the approximation and generalization capabilities of the fuzzy model. The experimental results include well-known software data such as medical imaging system (MIS).
Hierarchical Rough Classifiers
Authors: Sinh Hoa Nguyen, Hung Son Nguyen
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The major applications of rough set theory in data mining are related to the modeling of concepts using rough classifiers, i.e., the algorithms classifying unseen objects into lower or upper approximations of concepts. This paper investigates a class of compound classifiers called multi-level (or hierarchical) rough classifiers (MLRC). We present the most recent issues on the construction of such classifiers from data using concept ontology as an additional domain knowledge. The idea is based on the bottom-up manner to gradually synthesize the multi-layer rough classifier for the complex target concept from the simpler classifiers.We illustrate the proposed method by experiments on real-life data.
An interactive platform for auction-based allocation of loads in transportation logistics
Authors: Valentin Robu, Han Noot, Han La Poutré, Willem-Jan van Schijndel
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

This paper describes an agent-based platform for the allocation of loads in distributed transportation logisties, developed as a collaboration between CWI, Dutch National Center for Mathematics and Computer Science, Amsterdam and Vos Logistics Organizing, Nijmegen, The Netherlands. The platform follows a real business scenario proposed by Vos, and it involves a set of agents bidding for transportation loads to be distributed from a central depot in the Netherlands to different locations across Germany. The platform supports both human agents (i.e. transportation planners), who can bid through specialized planning and bidding interfaces, as well as automated, software agents. We exemplify how the proposed platform can be used to test both the bidding behaviour of human logistics planners, as well as the performance of automated auction bidding strategies, developed for such settings. The paper first introduces the business problem setting and then describes the architecture and main characteristics of our auction platform. We conclude with a preliminary discussion of our experience from a human bidding experiment, involving Vos planners competing for orders both against each other and against some (simple) automated strategics.
Retrieval Based on Self-explicative Memories
Authors: Albert Fornells, Eva Armengol, Elisabet Golobardes
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

One of the key issues in Case-Based Reasoning (CBR) systems is the efficient retrieval of cases when the case base is huge and/or it contains uncertainty and partial knowledge. We tackle these issues by organizing the case memory using an unsupervised clustering technique to identify data patterns for promoting all CBR steps. Moreover, another useful property of these patterns is that they provide to the user additional information about why the cases have been selected and retrieved through symbolic descriptions. This work analyses the introduction of this knowledge in the retrieve phase. The new strategies improve the case retrieval configuration procedure.
JOSS: Conversational Computing for the Nonprogrammer
Authors: Shirley L. Marks
Venue: IEEE Annals of the History of Computing (1982)

JOSS, the JOHNNIAC Open-Shop System, is a conversational time-sharing system developed at the Rand Corporation to demonstrate, on a small scale, the value of time-sharing and easy access to computing power for the nonprogrammer. In three computer implementations from May 1963 to the 198Os, JOSS has provided an English-like language that is easy to learn and use by trial and error at a terminal. Thus this earliest of simple on-line systems has enabled the computer novice to explore to advantage many small computational problems that might not be worth the effort in another computing environment.
Features of Mathematical Theories in Formal Fuzzy Logic
Authors: Libor Běhounek, Petr Cintula
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

A genuine fuzzy approach to fuzzy mathematics consists in constructing axiomatic theories over suitable systems of formal fuzzy logic. The features of formal fuzzy logics (esp. the invalidity of the law of contraction) entail certain differences in form between theories axiomatized in fuzzy logic and usual theories known from classical mathematics. This paper summarizes the most important differences and presents guidelines for constructing new theories, defining new notions, and proving new theorems in formal fuzzy mathematics.
Enhancing Security by Embedding Biometric Data in IP Header
Authors: Dae Sung Lee, Ki Chang Kim, Year Back Yoo
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Using a public key certificate for authentication purpose is vulnerable to MIM attack or certificate theft. In this study, we suggest a technique to embed the user's biometric data in all packets for a strong authentication. By authenticating each and every packet with the user's biometric data, we can completely remove the possibility of MIM or session hijacking attack. The embedding of biometric data starts from the very first SYN packet, thereby nullifying port scanning or SYN-flooding DOS attack. The system has been implemented and shows that it can achieve an enhanced security with tolerable increase in packet length.
Using commodity hardware platform to develop and evaluate CSMA protocols
Authors: Mei-Hsuan Lu, Peter Steenkiste, Tsuhan Chen
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Developing and evaluating wireless protocols is challenging because it requires flexible network interface hardware, which is not readily available. In this paper, we present FlexMAC, a wireless protocol development and evaluation platform based on commodity hardware. FlexMAC targets CSMA wireless protocols and allows customization of functions such as backoff, retransmission, and packet timing. We describe our implementation of FlexMAC and quantify FlexMAC's precision for 802.11b compared with commercial hardware implementations. The results show that FlexMAC's performance is very close to that of hardware implementations. We also present two case studies that illustrate FlexMAC's flexibility: the use of opportunistic relaying to boost throughput and an investigation of temporal and throughput fairness. We found that FlexMAC is a useful tool for conducting 802.11-style protocol research.
Some results of weighted quasi-arithmetic mean of continuous triangular norms
Authors: Yao Ouyang, Jinxuan Fang
Venue: Information Sciences: an International Journal (2008)

The weighted quasi-arithmetic mean of continuous triangular norms is investigated. Some results on convex combination of continuous triangular norms in Ouyang and Fang [Y. Ouyang, J.X. Fang, Some observations about the convex combination of continuous triangular norms, Nonlinear Anal. - TMA 68 (2008) 3382-3387] are generalized. Several open problems are posed.