ppxscal/embedding_network huggingface dataset:
Web Service Composition Approaches: From Industrial Standards to Formal Methods
Authors: Maurice ter Beek, Antonio Bucchiarone, Stefania Gnesi
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Composition of web services is much studied to support business-to-business and enterprise application integration in e-Commerce. Current web service composition approaches range from practical languages aspiring to become standards (like BPEL, WS-CDL, OWL-S and WSMO) to theoretical models (like automata, Petri nets and process algebras). In this paper we compare these approaches w.r.t. a selected set of characteristics (like trust, security and performance) and we advocate the use of formal models, and their tool support, to increase one's confidence in web service compositions. This paper can assist web service composition designers and developers to deliver lasting solutions, in concordance with the technology's critical needs.
A problem-based course in sustainable technology
Authors: C. E. Hmelo, T. Shikano, M. Realff, B. Bras, J. Mullholland, J. A. Vanegas
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Sustainable technology has been defined as technology that provides for our current needs without sacrificing the ability of future populations to sustain themselves. Approaching the synthesis of sustainably engineered solutions requires weighing the qualities of different proposals from a variety of different perspectives. Of necessity these problems must be solved from multidisciplinary perspectives. Students, therefore, need to learn not only what their own disciplines have to say about the issues, but they also need to be able to recognize the other kinds of issues that arise and to know which disciplines can contribute to their solutions. Thus, students need to learn how to recognize new issues and to work collaboratively. This points to a need for students to learn by working on cases in multidisciplinary teams. These multidisciplinary groups provide opportunities for collaboration and reflection that have the potential to greatly enhance student learning. Learning in such an environment can provide students with cases that they can recall and adapt later in their careers. We describe the curriculum of a problem-based course in sustainable development and technology (SDT) as well as discussing the technology that will be used in the future to support collaborative learning. In addition, we present some assessment data to indicate what students have learned and needs that have been identified as a result of these assessments.
Moore's law meets the life sciences
Authors: Tim Cheng
Venue: IEEE Design Test (2007)

The ability to perform DNA analysis, clinical diagnostics, and biomolecule detection and manipulation using miniaturized devices has many practical applications. This issue examines such devices, their functionality and applications, and the design and test technology challenges involved in developing them. This issue also features a roundtable on design and CAD challenges for leading-edge multimedia designs, and a eulogy by Aart de Geus paying tribute to the late A. Richard Newton.
Fuzzy set-valued Gaussian processes and Brownian motions
Authors: Shoumei Li, Li Guan
Venue: Information Sciences: an International Journal (2007)

Gaussian processes and Brownian motion are concepts and tools in modelling important uncertain systems in many areas. In view of uncertainty complexity in many real-world problems, we extend these tools to the case where stochastic processes can take on fuzzy sets as values. In this paper, we discuss fuzzy set-valued Gaussian processes based on the results of [S. Li, Y. Ogura, V. Kreinovich, Limit Theorems and Applications of Set-Valued and Fuzzy Set-Valued Random Variables, Kluwer Academic Publishers, Dordrecht, 2002; S. Li, Y. Ogura, H.T. Nguyen, Gaussian processes and martingales for fuzzy valued variables with continuous parameter, Inform. Sci. 133 (2001) 7-21; S. Li, Y. Ogura, F.N. Proske, M.L. Puri, Central limit theorems for generalized set-valued random variables, J. Math. Anal. Appl. 285 (2003) 250-263; N.N. Lyashenko, On limit theorems for sums of independent compact random subsets in the Euclidean space, J. Soviet Math. 20 (1982) 2187-2196] and [M.L. Puri, D.A. Ralescu, The concept of normality for fuzzy random variables, Ann. Probab. 13 (1985) 1373-1379]. We also introduce the concept of fuzzy set-valued Brownian motion, and then prove several properties of such processes.
A Novel Approach for the Link Layer in Impulse-based UWB Ad Hoc Networks
Authors: Nan Shi, Liang Xia, Ignas G. Niemegeers
Venue: Wireless Personal Communications: An International Journal (2007)

Ultra Wide Band (UWB) impulse radio, promises to be suitable for short-range, low-power, low cost and high data rate applications. While most UWB research is concentrating on the physical layer, little research has been published on the link layer. The fundamental operations in the link layer need to take into account the specifics of impulse radio and also the particular features of ad hoc networks. A novel self-organizing link layer protocol based on time hopping impulse radio, called SDD, was proposed by the authors. This protocol is a collision-free mechanism that enables the devices to discover neighboring nodes and arrange the access to communication resources shared among the nodes. In this paper, some issues related to the self-organizing link layer based on UWB impulse radio are investigated and addressed. The SDD protocol is further developed and specified in detail. The simulations are carried out using GloMoSim simulation environment. An SDD module has been developed and embedded in the simulator. Results show that the SDD protocol can work properly and efficiently in a single-hop ad hoc network.
Bounded Support Vector Machines, Semidefinite
Authors: Jianping Li, Zhenyu Chen, Weixuan Xu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Credit risk assessment is a basic and critical factor in credit risk management. In addition to conventional statistical method, neural network, decision tree and Support Vector Machine are the popular methods in this field in recent years. However, they all have weakness in two aspects: poor classification accuracy for unbalanced data and poor interpretability in real applications. A novel method, called Least Squares Support Feature Machine (LS-SFM), is proposed to reduce the misclassification cost and achieve an interpretable model by introducing the single feature kernel and sampling method. One important character of LS-SFM is that it can deliver the significance of each feature to users Our experiment on a real credit card dataset shows good performance. LS-SFM outperforms some well-known methods in several aspects.
Empirical Evaluation of a UML Sequence Diagram with Adornments to Support Understanding of Thread Interactions
Authors: Shaohua Xie, Eileen Kraemer, R. E. K. Stirewalt
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Programs that use multi-threaded concurrency are known to be difficult to design. Moreover, research in computer-science education suggests that concurrency and synchronization concepts are generally difficult to master. It stands to reason that comprehension tasks may be more complex for programs that employ concurrency than for sequential programs. We believe that external representations, specifically refinements to some of the popular UML modeling notations, should aid students in mastering fundamental concurrency/ synchronization concepts and should enable practitioners to better comprehend the dynamically evolving nature of the these programs. In this paper, we present our synchronization adorned UML (saUML) sequence diagram notation that highlights aspects of thread interactions and describe an empirical study of whether these diagrams, as opposed to purely textual representations, help students to better understand concurrent executions and concurrency concepts, as measured by their ability to answer questions about a particular execution of a multi-threaded system. A statistically significant benefit was found from the study.
Performance pathologies in hardware transactional memory
Authors: Jayaram Bobba, Kevin E. Moore, Haris Volos, Luke Yen, Mark D. Hill, Michael M. Swift, David A. Wood
Venue: ACM SIGARCH Computer Architecture News (2007)

Hardware Transactional Memory (HTM) systems reflect choices from three key design dimensions: conflict detection, version management, and conflict resolution. Previously proposed HTMs represent three points in this design space: lazy conflict detection, lazy version management, committer wins (LL); eager conflict detection, lazy version management, requester wins (EL); and eager conflict detection, eager version management, and requester stalls with conservative deadlock avoidance (EE). To isolate the effects of these high-level design decisions, we develop a common framework that abstracts away differences in cache write policies, interconnects, and ISA to compare these three design points. Not surprisingly, the relative performance of these systems depends on the workload. Under light transactional loads they perform similarly, but under heavy loads they differ by up to 80%. None of the systems performs best on all of our benchmarks. We identify seven performance pathologies-interactions between workload and system that degrade performance-as the root cause of many performance differences: FriendlyFire, StarvingWriter, SerializedCommit, FutileStall, StarvingElder, RestartConvoy, and DuelingUpgrades. We discuss when and on which systems these pathologies can occur and show that they actually manifest within TM workloads. The insight provided by these pathologies motivated four enhanced systems that often significantly reduce transactional memory overhead. Importantly, by avoiding transaction pathologies, each enhanced system performs well across our suite of benchmarks.
Step by step eigenvalue analysis with emtp discrete time solutions
Authors: Jorge Ariel Hollman
Venue:  (2006)

The present work introduces a methodology to obtain a discrete time state space representation of an electrical network using the nodal [G] matrix of the Electromagnetic Transients Program (EMTP) solution. This is the first time the connection between the EMTP nodal analysis solution and a corresponding state-space formulation is presented. Compared to conventional state space solutions, the nodal EMTP solution is computationally much more efficient. Compared to the phasor solutions used in transient stability analysis, the proposed approach captures a much wider range of eigenvalues and system operating states. A fundamental advantage of extracting the system eigenvalues directly from the EMTP solution is the ability of the EMTP to follow the characteristics of nonlinearities. The system's trajectory can be accurately traced and the calculated eigenvalues and eigenvectors correctly represent the system's instantaneous dynamics. In addition, the algorithm can be used as a tool to identify network partitioning subsystems suitable for real-time hybrid power system simulator environments, including the implementation of multi-time scale solutions. The proposed technique can be implemented as an extension to any EMTP-based simulator. Within our UBC research group, it is aimed at extending the capabilities of our real-time PC-cluster Object Virtual Network Integrator (OVNI) simulator.
Detecting and preventing stepping-stone intrusion by monitoring network packets
Authors: Stephen S. Huang
Venue:  (2006)

Most computer intruders chain several previously compromised computers so as to hide themselves before launching attacks on a target computer. One way to stop such intruders is to detect the intrusions and prevent them from using compromised computers; another way is to trace the intrusions back. The former is called stepping-stone detection, and the latter prevention or connection traceback. We propose here three approaches to detect stepping-stone intrusion: Request-Response, Step-Function, Network Fluctuation; we also propose two approaches to trace intrusions back: Temporal Thumbprint and Round-trip Time Thumbprint. The experimental results and theoretical analysis show that these can perform better than existing stepping-stone intrusion detection and prevention approaches in terms of false positive rate, false negative rate, and the resistibility to intruder evasions, such as time jittering and chaff perturbation. Matching TCP/IP packets is critical to both stepping-stone intrusion detection and connection traceback. We formally model and study this problem and propose three approaches to match the TCP/IP packets of an interactive session: TCP/IP protocol-based matching, clustering-partitioning matching, and standard deviation-based matching. The information embedded in the network traffic can be used to detect and prevent stepping-stone intrusion. We verify this statement through the technologies to detect stepping-stone, and to trace intrusions back. By monitoring, matching, mining, and statistical analyzing the TCP/IP packets of an interactive session, this dissertation offers a view of computer security breaches not from their origin or intended effect, but from their manifestation in the network traffic trace.
A rich OPAC user interface with AJAX
Authors: Jesse Prabawa Gozali, Min-Yen Kan
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Open Public Access Catalogs (OPACs) provide patrons with a user interface (UI) to help their information seeking tasks. Even though many OPAC UIs are now web-based, their architectures are often static, which does not allow them to integrate user assistance modules dynamically. We report on a UI that supports integration of such modules, while providing a usable and rich environment. We explore how Asynchronous JavaScript + XML (AJAX) can be employed to create an OPAC UI that offers a better user experience and task support. Our developed UI features a modular architecture that combines several Natural Language Processing (NLP) modules employed to enhance information seeking. Our UI manages queries in a novel way with a tabbed interface featuring an overview/details presentation model, and an AJAX query results data grid. Preliminary user testing results are also presented.
Component Compatibility and Its Verification
Authors: Donald C. Craig, Wlodek M. Zuberek
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

An approach to verification of component compatibility is proposed in which each component's behaviour (at its interfaces) is represented by a labeled Petri net in such a way that the sequences of services (provided or requested) correspond to sequences of labels assigned to occurring transitions. The behaviour of a component can thus be defined as the language of its modeling net. Two interacting components are compatible if and only if all possible sequences of services requested by one of these two components can be satisfied by the other component; in other words, two components are compatible if the language of the requesting component is a subset of the language of the component providing the services. Verification of this simple relation depends upon the class of languages defining the behaviours of the components. If the languages are regular, the verification of compatibility is straightforward. For nonregular languages, a more elaborate approach is needed in which a net model composed of the interacting components is checked for the absence of deadlocks. Some applications of the proposed approach are also discussed.
Design and evaluation of a continuous consistency model for replicated services
Authors: Haifeng Yu, Amin Vahdat
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from either strong consistency guarantees or none at all. This paper explores the semantic space between traditional strong and optimistic consistency models for replicated services. We argue that an important class of applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of inconsistent access in an application-specific manner. Thus, we develop a set of metrics, Numerical Error, Order Error, and Staleness, to capture the consistency spectrum. We then present the design and implementation of TACT, a middleware layer that enforces arbitrary consistency bounds among replicas using these metrics. Finally, we show that three replicated applications demonstrate significant semantic and performance benefits from using our framework.
Beetles, Cannibalism, and Chaos: Analyzing a Dynamical System Model
Authors: Dianne P. O'Leary
Venue: Computing in Science and Engineering (2007)

A system's evolution over time can be described with a set of equations called a dynamical system. In this installment, we use a dynamical system to model the life cycle of flour beetles to estimate key parameters that describe their behavior.
Games, puzzles, and computation
Authors: Erik D. Demaine, Gerald J. Sussman
Venue:  (2006)

There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis. I develop the idea of game as computation to a greater degree than has been done previously. I present a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games. A deterministic version of Constraint Logic corresponds to a novel kind of logic circuit which is monotone and reversible. At the other end of the spectrum, I show that a multiplayer version of Constraint Logic is undecidable. That there are undecidable games using finite physical resources is philosophically important, and raises issues related to the Church-Turing thesis. In the second half of this thesis, I apply the Constraint Logic formalism to many actual games and puzzles, providing new hardness proofs. These applications include sliding-block puzzles, sliding-coin puzzles, plank puzzles, hinged polygon dissections, Amazons, Konane, Cross Purposes, TipOver, and others. Some of these have been well-known open problems for some time. For other games, including Minesweeper, the Warehouseman's Problem, Sokoban, and Rush Hour, I either strengthen existing results, or provide new, simpler hardness proofs than the original proofs. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Channel estimation for mobile OFDM system with different detectors under time-varying Rayleigh fading channel
Authors: A. M. Zoubir, P. Ho Kar-Ming
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper discusses the channel estimation issue in orthogonal frequency division multiplexing (OFDM) system using pilot-symbol assisted modulation (PSAM). A number of PSAM-OFDM detectors were considered, which included the decorrelator detector and the linear minimum mean square error (LMMSE) detector. The performance of these detectors were measured against a number of benchmarks, which include the ideal coherent receiver and the frequency-domain differential BPSK (FD-DBPSK) OFDM detector which is much simpler to implement at the expense of system performance. The conclusion is that PSAM is a very robust technique for estimating and compensating multipath fading commonly found in mobile communication channels.
Automatic patent classification using citation network information: an experimental study in nanotechnology
Authors: Xin Li, Hsinchun Chen, Zhu Zhang, Jiexun Li
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Classifying and organizing documents in repositories is an active research topic in digital library studies. Manually classifying the large volume of patents and patent applications managed by patent offices is a labor-intensive task. Many previous studies have employed patent contents for patent classification with the aim of automating this process. In this research we propose to use patent citation information, especially the citation network structure information, to address the patent classification problem. We adopt a kernel-based approach and design kernel functions to capture content information and various citation-related information in patents. These kernels. performances are evaluated on a testbed of patents related to nanotechnology. Evaluation results show that our proposed labeled citation graph kernel, which utilized citation network structures, significantly outperforms the kernels that use no citation information or only direct citation information.
A GIS tool for the evaluation of the precipitation forecasts of a numerical weather prediction model using satellite data
Authors: Haralambos Feidas, Themistoklis Kontos, Nikolaos Soulakellis, Konstantinos Lagouvardos
Venue: Computers Geosciences (2007)

In this study, the possibility of implementing Geographic Information Systems (GIS) for developing an integrated and automatic operational system for the real-time evaluation of the precipitation forecasts of the numerical weather prediction model BOLAM (BOlogna Limited Area Model) in Greece, is examined. In fact, the precipitation estimates derived by an infrared satellite technique are used for real-time qualitative and quantitative verification of the precipitation forecasts of the model BOLAM through the use of a GIS tool named as precipitation forecasts evaluator (PFE). The application of the developed tool in a case associated with intense precipitation in Greece, suggested that PFE could be a very important support tool for nowcasting and very short-range forecasting of such events.
Hyperspectral Image Compression with Optimization for Spectral Analysis
Authors: Kameron Romines, Edwin S. Hong
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Hyperspectral imaging is of interest in a large number of remote sensing applications, such as geology and pollution monitoring, in order to detect and analyze surface and atmospheric composition. The processing of these images, called spectral analysis, allows for the identification of the specific mineralogical and agricultural elements which compose an image. We seek to understand how loss due to compression can affect the spectral analysis results, and then modify the compression algorithms to improve spectral analysis performance. More specifically, we suggest modifications to the 3D-SPIHT algorithm for improving the classification accuracy of hyperspectral images for two classification techniques: spectral angle mapper (SAM) and matched filtering (MF). Results of our modification show an improvement in the error rate as reported by the classification techniques we study, indicating an increase in the ability to analyze hyperspectral images which have been compressed.