ppxscal/embedding_network huggingface dataset:
On the Optimal Placement of Secure Data Objects over Internet
Authors: Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farokh B. Bastani
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changing the number of shares in secret sharing schemes can be costly. To achieve performance goals in data accesses, secret sharing can be combined with dynamic replication in a distributed system with varying client access patterns. In this paper, we investigate the problem of optimal allocation of secure data objects that are secret shared and possibly replicated. The system topology we consider consists of two layers. In the upper layer, multiple clusters form a network topology that can be represented by a general graph. The nodes within each cluster also have a topology represented by a general graph. We decompose the share replica allocation problem into two sub-problems, the resident set problem which allocates a subset of shares to clusters, and the -intra-cluster allocation problem which determines the number of share replicas to be allocated and their placements. We develop two different heuristic algorithms for the two sub-problems. The algorithm for the optimal resident set problem has a time complexity of O(n^2 ). An O(n^3 ) algorithm is presented for the intra-cluster allocation problem.
Mining Biomedical Images with Density-Based Clustering
Authors: M. Emre Celebi, Y. Alp Aslandogan, Paul R. Bergstresser
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial proximity of data points. In this work we adapt a density-based clustering algorithm, DBSCAN, to a new problem domain: Identification of homogenous color regions in biomedical images. Examples of specific problems of this nature include landscape segmentation of satellite imagery, object detection and, in our case, identification of significant color regions in images of skin lesions (tumors). Automated outer and inner boundary segmentation is a key step in segmentation of structures such as skin lesions, tumors of breast, bone, and brain. This step is important because the accuracy of the subsequent steps (extraction of various features, post-processing) crucially depends on the accuracy of this very first step. In this paper, we present an unsupervised approach to segmentation of pigmented skin lesion images based on DBSCAN clustering algorithm. The color regions identified by the algorithm are compared to those identified by the human subjects and the Kappa coefficient, a statistical indicator of computer-human agreement, is found to be significant.
Relation Algebras and their Application in Temporal and Spatial Reasoning
Authors: Ivo Düntsch
Venue: Artificial Intelligence Review (2005)

Qualitative temporal and spatial reasoning is in many cases based on binary relations such as before, after, starts, contains, contact, part of, and others derived from these by relational operators. The calculus of relation algebras is an equational formalism; it tells us which relations must exist, given several basic operations, such as Boolean operations on relations, relational composition and converse. Each equation in the calculus corresponds to a theorem, and, for a situation where there are only finitely many relations, one can construct a composition table which can serve as a look up table for the relations involved. Since the calculus handles relations, no knowledge about the concrete geometrical objects is necessary. In this sense, relational calculus is "pointless". Relation algebras were introduced into temporal reasoning by Allen (1983, Communications of the ACM 26(1), 832--843) and into spatial reasoning by Egenhofer and Sharma (1992, Fifth International Symposium on Spatial Data Handling, Charleston, SC). The calculus of relation algebras is also well suited to handle binary constraints as demonstrated e.g. by Ladkin and Maddux (1994, Journal of the ACM 41(3), 435--469). In the present paper I will give an introduction to relation algebras, and an overview of their role in qualitative temporal and spatial reasoning.
Two-Stage Image Segmentation by Adaptive Thresholding and Gradient Watershed
Authors: Ming Hong Pi, Hong Zhang
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Many images contain the coarse pieces and fine particles. Hence it is often important to segment the coarse pieces and fine particles using different segmentation techniques. In this paper, we combine adaptive thresholding and watershed transform in a two-stage image segmentation method, which has been used for oil-sand size analysis. We also present an image-retrieval-like approach to speed up size estimation of the fine particles.
Components and Contracts for Embedded Software
Authors: Shuyu Li, XiaoJiang Li, Jian Wu
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Component-based development is a key technology in the development of software for modern embedded systems. However, components can be difficult to deploy in embedded systems because of unclear description. This paper presents an approach to building software for embedded systems, based on the use of component in combination with contracts. The contracts specify both the functional properties and QoS properties of the different components in the system. By capturing all relevant information explicitly in the contracts, we can raise the level of abstraction for the designer and facilitate system development.
Trusting in transparency
Authors: Rebecca T. Mercuri
Venue: Communications of the ACM (2005)

In providing security assurances, transparency and trust are inherently intertwined concepts, but their relationship is not well understood.
Information systems development at the virtual global university: an experience report
Authors: Victor Pankratius, Wolffried Stucky
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In this paper, we present our experiences gained from the course "Information Systems Development" which is entirely taught online at the Virtual Global University (VGU). We identify technical, economic, and pedagogical problems and challenges which are of general interest to anyone teaching software engineering online.
Neural Network Approach for Software Cost Estimation
Authors: Nasser Tadayon
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Software engineering measurement and analysis specifically, cost estimation initiatives have been in the center of attention for many firms. In this paper, author explores the use of the expert judgment and machine learning techniques using neural network as well as referencing COCOMO II approach to predict the cost of software. Some primary work in the use of neural network in estimating software cost by [WITTIG & FINNIE] and Karunanithi produced very accurate results, but the major setback in their work was due to the fact that the accuracy of the result relied heavily on the size of the training set. Understanding the adversity in applying neural networks, the author proposes a dynamic neural network that will initially use COCOMO II. The proposed network improves its estimation as the number of data set increases with input from expert judgment that affects the learning procedure.
Fuzzy Pattern Recognition Approach to Construction Contractor Selection
Authors: Li Yawei, Chen Shouyu, Nie Xiangtian
Venue: Fuzzy Optimization and Decision Making (2005)

Contractor selection is a complex process crucial to ensuring the success of construction projects. Existing methods by which owners select a suitable contractor have been inadequate because it is difficult for decision-makers to evaluate contractor bids against inexact qualitative criteria. The purpose of this paper is to propose a Multiple-layer Fuzzy Pattern Recognition (MFPR) approach to solve contractor selection problem. Integrating judgments, experience and preferences of decision-makers, this paper uses the paired comparison method to decide relative membership degrees of qualitative criteria as well as weights of the criteria set, a case study for a channel construction project was used to demonstrate the feasibility of this approach. The findings clearly indicate that the techniques may successfully harmonize different opinions and reach a group consensus.
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
Authors: Thomas Fischer, Peter Merz
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes in a network locally optimize TSP instances by using the CLK algorithm. We show that the distributed variant finds better tours compared to the original CLK given the same total amount of computation time. Hence, the cooperation of the processes in the distributed algorithm increases the effectiveness of the approach beyond the maximally achievable reduction in computation time due to parallelization. E.g. for TSP instance fl3795, the original CLK got stuck in local optima in each of 10 runs, whereas the distributed algorithm found optimal tours in each run requiring less than 10 CPU minutes per node on average in an 8 node setup.
Strong Semismoothness of the Fischer-Burmeister SDC and SOC Complementarity Functions
Authors: Defeng Sun, Jie Sun
Venue: Mathematical Programming: Series A and B (2005)

We show that the Fischer-Burmeister complementarity functions, associated to the semidefinite cone (SDC) and the second order cone (SOC), respectively, are strongly semismooth everywhere. Interestingly enough, the proof relys on a relationship between the singular value decomposition of a nonsymmetric matrix and the spectral decomposition of a symmetric matrix.
Systems Support for Pervasive Query Processing
Authors: Wenwei Xue, Qiong Luo, Lionel M. Ni
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applications, we have developed a pervasive query processing framework called Aorta. Unlike traditional database systems, a pervasive query processor requires systems support for managing a large number of networked, heterogeneous devices. In this paper, we present the communication, synchronization, and scheduling mechanisms in Aorta. Even though these techniques have their roots in distributed and parallel systems, we show how these techniques are customized and applied for pervasive query processing. In essence, communication between heterogeneous devices enables network data independence, synchronization on devices protects action atomicity, and scheduling works for adaptive, cost-based multi-query optimization. We have conducted empirical studies on our prototype as well as simulation studies to evaluate the system performance.
Detecting and Visualizing Refactorings from Software Archives
Authors: Carsten Gorg, Peter Weisgerber
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

We perform knowledge discovery in software archives in order to detect refactorings on the level of classes and methods. Our REFVIS prototype finds these refactorings in CVS repositories and relates them to transactions and configurations. Additionally, REFVIS relates movements of methods to the class inheritance hierarchy of the analyzed project. Furthermore, we present our visualization technique that illustrates these refactorings. REFVIS provides both a class hierarchy layout and a package layout and uses color coding to distinguish different kinds of refactorings. Details on each can be displayed on demand using mouse-over tooltips. Finally, we demonstrate by case studies on two open source projects how REFVIS facilitates understanding of refactorings applied to a software project.
Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms: Research Articles
Authors: F. Desprez, F. Suter
Venue: Concurrency and Computation: Practice Experience (2004)

In this paper we study the impact of the simultaneous exploitation of data- and task-parallelism, so called mixed-parallelism, on the Strassen and Winograd matrix multiplication algorithms. This work takes place in the context of Grid computing and, in particular, in the Client&ndash;Agent(s)&ndash;Server(s) model, where data can already be distributed on the platform. For each of those algorithms, we propose two mixed-parallel implementations. The former follows the phases of the original algorithms while the latter has been designed as the result of a list scheduling algorithm. We give a theoretical comparison, in terms of memory usage and execution time, between our algorithms and classical data-parallel implementations. This analysis is corroborated by experiments. Finally, we give some hints about heterogeneous and recursive versions of our algorithms. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Identifying the prototypical career paths of IT professionals: a sequence and cluster analysis
Authors: Damien Joseph, Soon Ang, Sandra Slaughter
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

This study seeks to understand whether there are prototypical career paths in IT. We use sequence analysis to analyze actual work history of individuals who had held jobs in the IT profession. Our findings suggest that, contrary to the traditional view of a dual career path of IT professionals, IT professionals' careers actually follow one of three career paths: technical; managerial; or protean. We also find that individuals in the IT technical career path have significantly more IT technical experience compared to those in other career paths. We conclude this paper by discussing these results and identifying the implications for research and practice. This study makes a key contribution to the literature on IT professionals as being one of the first to analyze empirically the actual career paths of IT.
Introduction
Authors: Maris G. Martinsons
Venue: Communications of the ACM (2005)

In the 19th century, Napoleon Bonaparte predicted "When China awakens, it will astonish the world." China's recent stirring from its centuries-old slumber has far-reaching implications for international business and politics, as well as for science and technology development.For much of the last two millennia, China was one of the world's greatest economies and most technologically advanced societies. In recent centuries, however, the Middle Kingdom stagnated as other parts of the world experienced the Enlightenment, the Industrial Revolution, and the emergence of computer-based IT. Since paramount leader Deng Xiaoping opened China's door to the outside world in 1979, an infusion of market economics, foreign capital, and modern technology has been restoring its historical prominence [8]. From a global perspective, the country has gone from near irrelevance during the 1960s to being quaint, exotic, and inscrutable before emerging as a heavyweight. The Beijing Olympic Games in 2008 will celebrate the country's latest rise and represent an important milestone in its transformation from isolated Maoist state to full-fledged member of the international community.
Space-based multi-hop networking
Authors: Loren P. Clare, Jay L. Gao, Esther H. Jennings, Clayton Okino
Venue: Computer Networks and ISDN Systems (2005)

Many emerging applications will incorporate multiple spacecraft that form communications networks necessary to achieve coverage, latency and throughput requirements. Such networks may arise in the context of a space science mission consisting of distributed spacecraft performing multi-point sensing, or a global surveillance system serving military needs. Constellations of sensor spacecraft significantly benefit from incorporation of cross-link communications capabilities, thereby forming networks, by enabling continuous access to any/all spacecraft via a single ground contact, real-time coordinated observations, and autonomous in situ processing within a spatial neighborhood of spacecraft. Space-based networks may also be employed as relay infrastructure supporting (Earth, Moon, other planet) surface users engaged in various applications, such as space exploration. In this paper, we present an "L2 mesh" protocol for space-based sensor networks. Because of the large inter-spacecraft distances, directional antennas are used, with a single transceiver per spacecraft to achieve low cost. Orbital motion induces a dynamic albeit predictable geometry (and topology) among the spacecraft. One or more ground (base) stations are used; multiple ground stations are often required to ensure continuous network connectivity. Offered traffic patterns are general anycast to ground stations, and reversedirection dissemination (for spacecraft commanding or "forward" relay). We present a technique that derives the link activation schedule (transmit/receive mode and communications neighbor selection) and route paths used for multihop relay through the network, leveraging the Florens and McEliece algorithm for tree networks. Highly efficient communications are achieved; in particular, the inherent tree structure enables accommodation of propagation delays that otherwise degrade the large delay-bandwidth links comprising space networks. An illustrative example is presented. Simulations demonstrate that the algorithm provides high throughput and low latency performance over general network configurations. An extension to the networking method is described that is traffic adaptive.
Architecture and Performance of Application Networking in Pervasive Content Delivery
Authors: Mu Su, Chi-Hung Chi
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper proposes Application Networking (App.Net) architecture that enables Web server to deploy intermediate response with associated service logic to edge proxies in form of a workflow. The recipient proxy is allowed to instantiate the workflow using local services or by downloading mobile applications from remote sites. The final response is the output from the workflow execution fed with the intermediate result. In this paper, we defined a workflow modulation method to represent service logic and manipulate it in uniform operations. An App.Net caching method is designed to cache intermediate results as well as final response presentations. According to cost model measuring the bandwidth usage, we designed workflow placement algorithms to deploy intermediate response objects to the proxy in optimal or greedy ways. Finally, we developed an App.Net prototype and implemented a wide range of applications existed in the Web. Our simulation results show that using workflow and dynamic application deployment, App.Net can achieve better performance than conventional methods.
Model-Based Verification in the Development of Dependable Systems
Authors: Demissie B. Aredo, Olaf Owe
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we present a framework that integrates the semi-formal modeling language, namely UML, with the formal method, namely PVS, to exploit their synergy in the development of dependable systems. System descriptions are given in UML notations, which are translated into semantic models in PVS based on formal semantic definitions for UML notations. The translation is automated and the resulting semantic models are rigorously analyzed using the PVS toolkit. We demonstrate, by example, how the framework contributes to improved use of formal methods in the development of dependable systems in the industrial settings, and to underpinning semi-formal modeling languages with rigorous semantic foundation.
Correspondence Expansion for Wide Baseline Stereo
Authors: Kevin L. Steele, Parris K. Egbert
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important forstructure-from-motion algorithms, which rely on many correct matches to reduce error in the derived geometric structure. Given a small initial correspondence set we iteratively expand the set with nearby points exhibiting strong affine correlation, and then we constrain the set to an epipolar geometry using RANSAC. A key point to our algorithm is to allow a high error tolerance in the constraint, allowing the correspondence set to expand into many areas of an image before applying a lower error tolerance constraint. We show that this method successfully expands a small set of initial matches, and we demonstrate it on a variety of image pairs.
Deciding what to design: closing a gap in software engineering education
Authors: Mary Shaw, Jim Herbsleb, Ipek Ozkaya
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software has jumped "out of the box" - it controls critical systems; it pervades business and commerce; it is embedded in myriad mechanisms; it infuses entertainment, communication, and other activities of everyday life. Designs for these applications are constrained not only by traditional considerations of capability and performance but also by economic, business, market, and policy issues and the context of intended use. The diversity of applications requires adaptability in responding to client needs, and the diversity of clients and contexts requires the ability to discriminate among criteria for success.As a result, software designers must also get out of their boxes: in addition to mastering traditional software development skills, they must understand the contextual issues that discriminate good solutions from merely competent ones. Current software engineering education, however, remains largely "in the box": it neglects the rich fabric of issues that lie between the client's problem and actual software development. At Carnegie Mellon we have addressed this major shortcoming with a course that teaches students to understand both the capabilities required by the client and the constraints imposed by the client's context.This paper presents our view of the engineering character of software engineering, describes the content and organization of our new course, reports on our experience from the first three offerings of our course, and suggests ways to adapt our course for other educational settings.