ppxscal/embedding_network huggingface dataset:
A Formal Method for Analyzing Software Architecture Models in SAM
Authors: Huiqun Yu, Xudong He, Yi Deng, Lian Mo
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The Software Architecture Model (SAM) is a general software architecture model based on a dual formalism combining Petri nets and temporal logic. A SAM model contains a hierarchical set of compositions, each of which consists of a set of components, a set of connectors, and a set of constraints. This paper proposes a formal method for analyzing SAM models in both element (either component or connector) level and composition level. The basic idea is to simulate Petri net behaviors in terms of fair transition systems. The properties of individual components and connectors are verified either by deductive reasoning or model checking. The properties of the entire system is inferred from the properties of its constituents. A detailedcase study of an electronic commerce system shows our approach to formally modeling, refining and analyzing software architecture models.
Cost-Effective Compiler Directed Memory Prefetching and Bypassing
Authors: Daniel Ortega, Eduard Ayguadé, Jean-Loup Baer, Mateo Valero
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Ever increasing memory latencies and deeper pipelines push memory farther from the processor. Prefetching techniques aim is to bridge these two gaps by fetching data in advance to both the L1 cache and the register file. Our main contribution in this paper is a hybrid approach to the prefetching problem that combines both software and hardware prefetching in a cost-effective way by needing very little hardware support and impacting minimally the design of the processor pipeline. The prefetcher is built on-top of a static memory instruction bypassing, which is in charge of bringing prefetched values in the register file. In this paper we also present a thorough analysis of the limits of both prefetching and memory instruction bypassing. We also compare our prefetching technique with a prior speculative proposal that attacked the same problem, and we show that at much lower cost, our hybrid solution is better than a realistic implementation of speculative prefetching and bypassing. In average, our hybrid implementation achieves a 13% speed-up improvement over a version with software prefetching in a subset of numerical applications and an average of 43% over aversion with no software prefetching (achieving up to a 102% for specific benchmarks).
Hybrid Channel Access Scheduling in Ad Hoc Networks
Authors: Lichun Bao, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only, HAMA is a node-activation channel access protocol that also maximizes the chance of link activations using time- and code-division schemes. HAMA only requires identifiers of the neighbors within two hops from each node to schedule channel access. Using this neighborhood information, each node determines whether to transmit in the current time slot on a dynamically assigned spreading code. A neighbor protocol supplements HAMA with up-to-date two-hop neighborhood information by reliably propagating the one-hop neighbor updates through a novel random access technique. The throughput and delay characteristics of HAMA in randomly-generated multihop wireless networks are studied by analyses and simulations. The results of the analyses show that HAMA achieves higher channel utilization in ad hoc networks than a distributed scheduling scheme based on node activation, similar throughout as a well-known scheduling algorithm based on complete topology information, and much higher throughout than the ideal CSMA and CSMA/CA protocols.
The Abalone Interpolation: A Visual Interpolation Procedure for the Calculation of Cloud Movement
Authors: Elke Hergenröther, Antonio Bleile, Don Middleton, Andrzej Trembilski
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

For the production of smooth animation of flow simulation out of only several data steps manyinterpolated intermediate data steps are needed. Especially for the meteorological visualization of moving clouds for TV broadcasting purposes such interpolations are of high importance. The traditional method for the animation production is to fade one dataset out and to fade the next dataset in. The visual result is not very realistic if the clouds should move quickly and thedistances between them are too great, because blending produces no clouds movements. In this paper we present the Abalone Interpolation for the calculation of visually realistic cloud movements. The presented solution is not only suitable for meteorological visualization but also for visual preparation of the flow calculation results.
Web Cartography for Online State Promotion: An Algorithm for Clustering Web Resources
Authors: François Velin, Pascale Kuntz, Henri Briand
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper presents an approach of Web cartography to be used in the context of online site promotion.The overall objective is to provide users with handy maps offering information about candidate sites for the creation of hyperlinks that enable a large flow of targeted visitors.Two main types of data must be considered; texts and hyperlinks.We propose to exploit the latter to construct a relevant corpus on which semantic as well as graph analysis can be applied.The stress is put on theclustering of Web resources based on the link network,which makes it possible to highlight groups of strongly connected sites which are of the utmost interest for our application.To tackle the site graph partitioning problem, we turn to a promising iterative approach initially developedin the context of computer-aided design.It uses spectral decomposition of the Laplacian matrix to embed theconsidered graph in a geometric space where efficientmethods can be applied.An algorithm that was adaptedfrom an existing one implements the method.Experimentswere conductedon a real application case concerning the promotion of a site dealing with Cognac.We present the obtained map as well as leads to exploit it.
A Simplified Protocol Operational Semantics for Multiagent Protocols
Authors: Jean-Luc Koning
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Multiagent systems are based on the notion that if one gathers simple autonomous systems (agents) within a society and that they are endowed with interaction skills, then such a society may show complex behaviors (compared to each of the agent's skills) that are not implemented in any particular individual. The society's intelligence is distributed among its constituents. Besides, one fundamental characteristic of such a system is its ability of interaction between its constituents, i.e., its agents.In the multiagent system community the communication issue is typically addressed by means of interaction protocols that give more or less flexible guidelines to cognitive agents in their communication with each other. Their usual representation by means of graphs only offers a syntactic description of the protocol. No semantic information can be taken into consideration. Moreover, the particular family of protocols that are thus addressed falls in the class of regular languages. This means multiagent systems with such protocols deny themselves any chance of a larger interaction expression power.Here we go beyond this limit by relying on the Protocol Operational Semantics (POS), inspired by the structural operational semantics of programming languages. It is a formalismbased on algebraic data types and pattern-matching which enables to easily describe interaction protocols at an agent level. Such a model is not only a theoretical framework, but also a computational one due to the existence of adequate programming languages, like Pizza/Java and other ML languages.Since POS is a tool that enables to better study protocols which necessitate a Turing power, in this paper, we develop and improve it according to this perspective.
A Specification-Based Coverage Metric to Evaluate Test Sets
Authors: Paul Ammann, Paul E. Black
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Software developers use a variety of methods, including both formal methods and testing, to argue that their systems are suitable components for high assurance applications. In this paper, we develop another connection between formal methods and testing by defining a specification-based coverage metric to evaluate test sets. Formal methods in the form of a model checker supply the necessary automation to make the metric practical. The metric gives the software developer assurance that a given test set is sufficiently sensitive to the structure of an application's specification. In this paper, we develop the necessary foundation for the metric and then illustrate the metric on an example.
Boolean Decomposition of Binary Image Operators
Authors: Heraldo Maciel França Madeira, Hélio Pedrini
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Boolean expansion of binary functions has been used in the representation of binary image operators. This representation scheme induced the creation of image processing architectures based on decision diagrams. In some situations, the application of this graph-based operator over the input images is faster than the corresponding conventional approach, in that the operators are constructively described by means of basic operators and set operations. However, when the conventional architecture exploits the bit parallelism of the microprocessor logical instructions, its performance often surpasses that of the graph-based system. This article proposes a novel approach, in which the decision diagrams guide the actions of the underlying conventional architecture, taking advantage of its parallelism, so that faster image processing can be achieved.
ALLNODE barrier synchronization network
Authors: Howard T. Olnowich
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper presents a proposed hardware solution using an existing multi-stage switching network for synchronizing N multiple processors at predetermined programmable barriers. The technique permits all N processors to access the network simultaneously and to perform synchronization in parallel using only several network cycles. The synchronization requires no additional network facilities, and consumes usually less than 5% of the bandwidth when merged onto the same multi-stage network that handles normal message traffic. The approach permits up to 2048 barriers, but can be expanded. The network is based on the Allnode Switch and Network concepts, a circuit-switching implementation, that permits a special barrier synchronization mode where all N processors are simultaneously attached to the network and can interact as if they were attached to a multi-drop bus.
Coarse Grained Parallel Next Element Search
Authors: Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoidal decomposition and polygon triangulation problems. A simplified version for axis parallel segments requires only O(n/p) storage per processor, and we discuss an implementation of this version.As in a previous paper by Develliers and Fabri, our algorithm is based on a distributed implementation of segment trees which are of size O(n log n). This paper improves on which presented a CGM algorithm for the special case of trapzoidal decomposition only and requires O((n/p) * log p * log n) local computation.
Privacy of Trust in Similarity Estimation through Secure Computations
Authors: Javier Carbo Rubiera, Jose M. Molina Lopez, Jorge Davila Muro
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Current e-commerce applications provide us a binary definition of trust depending on whether some requirements are satisfied or not. However trust can be seen as a more general and subjective concept tightly linked to reputation. The subjectivity of the evaluations of certain behaviours justifies this kind of trust. We intend agents to manage subjective trust as humans do, in a vague and abstract way, as a fuzzy concept. In this paper we extend our previous works about the introduction of newcomers into an already running agent system. Because of the economical and strategic value of the trust-related information exchanged in such e-commercial scenarios, the access to this information should be restricted to certain group of close agents. Agents were grouped in cooperative clusters according to similarity of the opinions about others. Specifically this paper evaluates the privacy of these opinions while similarity can be easily estimated. The results of this evaluation will justify the use of secure computations in the introduction of newcomers.
C-Notes: Designing a Mobile and Wireless Application to Support Collaborative Knowledge Building
Authors: Marcelo Milrad, Juan Perez, Heinz Ulrich Hoppe
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

In order to support rich forms of collaborative learning, learners need appropriate tools to share, exchange, and negotiate their ideas. The use of wireless networked handheld computers in education is rapidly increasing, thus providing new opportunities to engage students in collaborative activities independent of time and space. In this paper, we describe our work in progress related to the design and implementation of a mobile and wirelessapplication to support collaborative knowledge building. The paper presents an innovative approach for supporting the exchange and discovery of key ideas among students by using wireless optical readers, handheld devices and an application we have developed using Java and XML.
The HOVER System for Rapid Holistic Verification of Off-lineHandwritten Phrases
Authors: Sriganesh Madhvanath, Evelyn Kleinberg, Venu Govindaraju, Sargur N. Srihari
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

o In this paper, we describe ongoing research on a system for rapid verification of unconstrained off-line handwritten phrases using perceptual holistic features of the handwritten phrase image. The system is used to verify handwritten street names automatically extracted from live US mail against recognition results of analytical classifiers. The system rejects errors with 98% accuracy at the 30% accept level, while consuming approximately 20msec per image on the average on a 150 MHz SPARC 10.
Combining Approximate Geometry with View-Dependent Texture Mapping - A Hybrid Approach to 3D Video Teleconferencing
Authors: Celso S. Kurashima, Ruigang Yang, Anselmo Lastra
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present a hybrid system using computer vision and graphics methods that effectively combines fast automatic 3D model extraction with view-dependent texture mapping for the purpose of real-time person-to-person 3D video teleconferencing. In our approach the problem of creating a dense disparity map is bypassed. We compute only a sparse geometric model, which is textured from multiple cameras using an image-based rendering approach. Using a commodity graphics card and three personal computers arranged in a cluster, we achieve aperformance of 3 to 4 frames per second. We demonstrate the ability to provide a 3D tele-immersive environment with our system.
A Scalable Fault-Tolerant Network Management System Built Using Distributed Object Technology
Authors: Tomohiro Fujisaki, Masaki Hamada, Katsuyoshi Kageyama
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

A network management system (NMS) has been built using distributed object technology and a four-layered architecture with device model objects. This NetKeeper NMS, which is built on a distributed object platform, has improved scalability and fault tolerance, and can be customized easily. It can thus be used to manage enterprise networks, which consist of a huge number of multi-vendor network devices and have original management policies. NetKeeper is being used in a commercial internet service provider's network and in several LANs.
IP Traceback-Based Intelligent Packet Filtering: A Novel Technique for Defending against Internet DDoS Attacks
Authors: Minho Sung, Jun Xu
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Distributed Denial of Service (DDoS) is one of the most difficult security problems to address. While many existing techniques (e.g., IP traceback) focus on tracking the location of the attackers after-the-fact, little is done to mitigate the effect of an attack while it is raging on. In this paper, we present a novel technique that can effectively filter out the majority of DDoS traffic, thus improving the overall throughput of the legitimate traffic. The proposed schemeleverages on and generalizes the IP traceback schemes to obtain the information concerning whether a network edge is on the attacking path of an attacker ("infected") or not ("clean"). We observe that while an attacker will have all the edges on its path marked as "infected", edges on the path of a legitimate client will mostly be "clean". By preferentially filtering out packets that are inscribed with the marks of "infected" edges, the proposed scheme removesmost of the DDoS traffic while affecting legitimate traffic only slightly. Simulation results based on real-world network topologies (e.g., Skitter) all demonstrate that the proposed technique can improve the throughput of legitimate traffic by 3 to 7 times during DDoS attacks.
Aspect-Oriented Programming with Enterprise JavaBeans
Authors: Jung Pil Choi
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Enterprise JavaBeans (EJB) provides special functionalities such as transaction, persistence, location transparency and security. These functionalities can be considered as aspects and EJB can be regarded as an aspect-oriented programming (AOP) environment. However, its architecture has no extensibility and flexibility to add or modify aspects, so it is not considered as a general AOP environment and hard to be applied to diverse domains. In this research, a new EJB server, named AES, is designed and implemented. An aspect exists independently of a container, and can be added and updated as needed. A container is changed into a generalized metaobject supporting more aspects in a flexible and extensible way. Also, an EJBObject is changed as a reference aspect supporting various network protocols. To prove flexibility and extensibility of AES, a testing application and user-defined aspects are developed. Finally, overhead for supporting AOP in EJB is measured.
An Image Interpretation Device cannot be Reliable without any Semantic Coherency Analysis of the Interpretated Objects - Application to French Cadastral Maps
Authors: Jean-Marc Ogier, Rémy Mullot, Jacques Labiche, Yves LeCoutier
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The methodology we have used for the interpretation of the French cadastral documents focuses on a number of studied results of the visual perception and a hierarchical description of the document. The strategy used has been based on the "model" document, employing a mixed approach including various "points of view" about the image to be processed. The results of this mixed analysis reveal the appearance of non-interpretable objects on the cadaster, due to the presence of semantic uncoherence. Thanks to the return cycles between the high and low level processing, an analytical strategy is proposed and allows, in order to independently cure the incoherence, thus to attain the most reliable interpretation of the cadastral map.
Yaka: Document Notification and Delivery Across Heterogeneous Document Repositories
Authors: Damián Arregui, François Pacull, Jutta Williamowski
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Nowadays people have to deal with an increasing amount of information contained in electronic documents available from numerous heterogeneous, widely distributed sources. Keeping up to date with recently published material relevant to a particular topic has become a challenge in itself. The Yaka system aims at facilitating this task by providing notification and delivery services. Yaka relies on a flexible definition of subjects through intelligent wrapping of existing information sources. Users can subscribe to these subjects in order to be notified whenever new relevant documents are published. Yaka augments document notification with document meta-information obtained through a set of integrated linguistic services. From the notification message users can directly request the document content. Yaka then delivers this content, automatically transformed into the appropriate format, through a variety of delivery media. In this article, we describe the Yaka functionality, its architecture and how we deployed it within Xerox.
Designing a Distributed Software Development Support System Using a Peer-to-Peer Architecture
Authors: Seth Bowen, Frank Maurer
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Distributed software development support systems typically use a centralized client-server architecture. This approach has some drawbacks such as the participants may experience lengthy delays if they are located far from the central server, and the organization that runs theserver must deal with the security and privacy issues that come with being in charge of a central repository of information. We are investigating whether this centralized control can be relaxed by using peer-to-peer (P2P) technology. In this paper, we address the motivations forusing a P2P architecture, examine the design issues related to the development of a P2P software development support system, and discuss the implementation framework that will be used.
Mining Coverage-Based Fuzzy Rules by Evolutional Computation
Authors: Tzung-Pei Hong, Yeong-Chyi Lee
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper, we propose a novel mining approach based on the genetic process and an evaluation mechanism to automatically construct an effective fuzzy rule base. The proposed approach consists of three phases: fuzzy-rule generating, fuzzy-rule encoding and fuzzy-ruleevolution. In the fuzzy-rule generating phase, a number of fuzzy rules are randomly generated. In the fuzzy-rule encoding phase, all the rules generated are translated into fixed-length bit strings to form an initial population. In the fuzzy-rule evolution phase, genetic operations andcredit assignment are applied at the rule level. The proposed mining approach chooses good individuals in the population for mating, gradually creating better offspring fuzzy rules. A concise and compact fuzzy rule base is thus constructed effectively without human expertintervention.