ppxscal/embedding_network huggingface dataset:
Evaluation of placer suboptimality via zero-change netlist transformations
Authors: Andrew B. Kahng, Sherief Reda
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formally define a class of netlist transformations that produce different netlists from the given netlist but have the same Half-Perimeter Wire Length (HPWL). Furthermore, the optimal HPWL value of the new netlists is no less than that of the original netlist. By applying our transformations and re-executing the placer, we can interpret any deviation in HPWL as a lower bound to the deviation from the optimal HPWL value. Such deviation is a measure of suboptimality. Using these transformations, the suboptimality of several existing academic and industrial placers is studied on the IBM benchmarks. Our results show that current placers are sub-optimal for zero-change transformations with deviations in HPWL by up to 32% on the IBM (version 1) benchmarks. The specific nature of our transformations also pinpoints possible directions for improvement in existing placers.
Real-time human tracking system with multiple omnidirectional vision sensors
Authors: Takushi Sogo, Hiroshi Ishiguro, Mohan M. Trivedi
Venue: Systems and Computers in Japan (2004)

We propose a real-time human tracking system that uses multiple omnidirectional vision sensors. This system estimates and tracks the locations of multiple persons from omnidirectional 360-degree images captured by multiple omnidirectional vision sensors using N-ocular stereo, which is obtained by extending conventional trinocular stereo, and without using image characteristics. In N-ocular stereo, robust real-time target location estimation can be achieved by taking into account human model errors and human azimuth observation errors, as well as the problem of measurement precision of target locations in stereo based on omnidirectional images; and by further simplifying these factors and correcting them. Using this method, we created a prototype system and verified its effectiveness based on a human tracking experiment. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 79&ndash;90, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1228
Do students recognize ambiguity in software design? a multi-national, multi-institutional report
Authors: Ken Blaha, Alvaro Monge, Dean Sanders, Beth Simon, Tammy VanDeGrift
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Successful software engineering requires experience and acknowledgment of complexity, including that which leads designers to recognize ambiguity within the software design description itself. We report on a study of 21 post-secondary institutions from the USA, UK, Sweden, and New Zealand. First competency and graduating students as well as educators were asked to perform a software design task. We found that as students go from first competency to graduating seniors they tend to recognize ambiguities in under-specified problems. Additionally, participants who recognized ambiguity addressed more requirements of the design.
Linear Combination Representation for Outlier Detection in Motion Tracking
Authors: Guodong Guo, Charles R. Dyer, Zhengyou Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we show that Ullman and Basriýs linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outlier detection in motion tracking with an affine camera. For this task LC can be realized either on image frames or feature trajectories, and therefore two methods are developed which we call linear combination of frames and linear combination of trajectories. For robust estimation of the linear combination coefficients, the support vector regression (SVR) algorithm is used and compared with the RANSAC method. SVR based on quadratic programming optimization can efficiently deal with more than 50 percent outliers and delivers more consistent results than RANSAC in our experiments. The linear combination representation can use SVR in a straightforward manner while previous factorization-based or subspace separation methods cannot. Experimental results are presented using real video sequences to demonstrate the effectiveness of our LC + SVR approaches, including a quantitative comparison of SVR and RANSAC.
Cost-Efficient QoS Routing Protocol for Mobile Ad Hoc Networks
Authors: Wenzhu Zhang, Jiandong Li, Xuan Wang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

A novel CEQRP (Cost-Efficient QoS Routing Protocol) for mobile ad hoc networks (MANETs) is proposed. CEQRP can provide QoS guarantee and is aimed at extending the batteryýs lifetime at each host by selecting the hosts with a long batteryýs remaining lifetime to forward packets. Simulation results show that CEQRP has good network performance. Furthermore, CEQRP shows distinct performance advantages in using a hostýs electric energy efficiently.
A chance-constrained multi-period model for a special multi-reservoir system
Authors: M. N. Azaiez, M. Hariga, I. Al-Harkan
Venue: Computers and Operations Research (2005)

We develop a model for optimal multi-period operation of a multi-reservoir system for a basin operating under a conjunctive use of ground and surface Water. The inflows to the main reservoir as well as the irrigation demands are stochastic. The ground stock suffers from severe overdrafts increasing the risk of the total depletion of the aquifer in addition to the quality degradation and the threat of seawater intrusion. We treat the uncertainties in the inflows through chance constraints and penalties of failure to release the planned amounts of surface water from the main reservoir. However, we reflect uncertainties in irrigation demands by opting for deficit irrigation and using adequate production functions to estimate the expected crop yields. We attempt in the model to avoid large deficits except perhaps for periods where crop yields are relatively insensitive to water shortage. The objective is to maximize the total expected profit of the entire region. We illustrate the model through an example partially based on some hypothetical data.
Check 'n' crash: combining static checking and testing
Authors: Christoph Csallner, Yannis Smaragdakis
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We present an automatic error-detection approach that combines static checking and concrete test-case generation. Our approach consists of taking the abstract error conditions inferred using theorem proving techniques by a static checker (ESC/Java), deriving specific error conditions using a constraint solver, and producing concrete test cases (with the JCrasher tool) that are executed to determine whether an error truly exists. The combined technique has advantages over both static checking and automatic testing individually. Compared to ESC/Java, we eliminate spurious warnings and improve the ease-of-comprehension of error reports through the production of Java counterexamples. Compared to JCrasher, we eliminate the blind search of the input space, thus reducing the testing time and increasing the test quality.
Paramax Systems Corporation: MUC-4 test results and analysis
Authors: Carl Weir, Barry Silk
Venue: Proceedings of the 4th conference on Message understanding (1992)

The data extraction system submitted by Paramax for evaluation in MUC-4 is a new implementation written in CLIPS, a forward-chaining system developed and maintained by NASA's Johnson Space Center [1]. Using CLIPS as a forward-chaining engine is desirable because it runs on a wide range of machines (including Sun Sparc stations, Apple Mac IIs, and PCs), it is available at little or no cost from the government, it is fast, and it comes with good documentation and support services.
A Fault-Tolerant Distributed Channel Allocation Scheme for Cellular Networks
Authors: Jianchang Yang Qiangfeng Jiang D. Manivannan, Mukesh Singhal
Venue: IEEE Transactions on Computers (2005)

In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. If channels are statically allocated, as is the case in current cellular networks, a cell may run out of channels when a large number of mobile hosts move to the cell. To overcome this problem, dynamic channel allocation approaches have been proposed. Under dynamic channel allocation, channels are allocated to cells on demand, thus increasing channel utilization. Such channel allocation approaches fall under two categories, namely, centralized and distributed. Centralized approaches are neither scalable nor reliable, while distributed approaches have the potential to be both reliable and scalable. In the distributed approaches, a mobile service station is responsible for allocating channels to mobile hosts in the same cell. In cellular networks, mobile service stations may fail. In addition, the network may encounter intermittent network congestion and/or link failures. It is desirable for a channel allocation algorithm to work well, even in the presence of network congestion, link failures, and/or mobile service station failures. In this paper, we present a distributed dynamic channel allocation scheme for cellular networks that is fault-tolerant. Our approach can tolerate the failure of mobile service stations, link failure, and network congestion, and make efficient reuse of channels. We also provide results of the performance evaluation of our algorithm.
Partial matching accuracy indices for shapes
Authors: Shigehiro Fukushima, Zi-Liuk Zheng, Yukiyasu Yoshinaga
Venue: Systems and Computers in Japan (2004)

Indices are proposed to measure the partial matching accuracy for outlines of shapes such as those identified only partially due to occlusion and with limited region of interest. The figure catching rate and the partial matching rate curves are defined. The fractional area under the curve represents effectively the matching accuracy. More intuitive indices are the catching and matching distances. The indices are illustrated with an example of application to evaluation of gastric outlines recognized in double-contrast gastric radiograms. Gastric regions delineated by a computer are compared with tracings by a radiologist, in an attempt to evaluate numerically the accuracy. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 50&ndash;58, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10550
Constructing regular variables in message passing systems
Authors: Sibsankar Haldar
Venue: Journal of Parallel and Distributed Computing (2005)

Developing fault-tolerant programs for distributed systems is a difficult task. It seems that it is more difficult to develop fault-tolerant programs for message passing systems than for shared memory systems. Consequently, there has been a lot of interest in simulating atomic shared memory by constructing atomic shared variables in message passing systems. The best known construction of 1-writer n-reader atomic variables is of Attiya (J. Algorithms 34 (2000) 109). She first constructs 1-writer n-reader regular variables, and then uses them to construct atomic variables. Her regular variable construction requires, for each operation execution, exchanging 2n messages of size @?(n^3) bits. A new construction of 1-writer n-reader regular variables is proposed. Each operation execution requires exchanging 2n messages of size @?(n^2logn) bits.
An Agent-Based Approach using the ebXML Specifications for E-business
Authors: Dalila Boughaci, Habiba Drias
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this work, we are interested to data exchanges interenterprises called business- to-business (B2B) ecommerce. A B2B collaboration is a set of documents exchanges and complex interactions between organizations. Such a long process transaction may be reliable, protected, secure, and requires standardization especially for accomplishing smooth business process. This need for standardization has been recognized and the development of business standards like ebXML can be viewed as a solution. In this paper, we present a framework of an agent-based approach using the ebXML specification for B2B E-commerce. The motivation for using agents in support of e-commerce is to perform dedicated processing on behalf of clients. In addition, the agents' technology can provide a high degree of flexibility by distributing the complex problem on intelligent and cooperative entities called "intelligent agents". Also, the mobility of an agent can allow for a faster time scale of service deployment.
Escort Density Operators and Generalized Quantum Information Measures
Authors: Jan Naudts
Venue: Open Systems Information Dynamics (2005)

Parameterized families of density operators are studied. A generalization of the lower bound of Cramér and Rao is formulated. It involves escort density operators. The notion of ø-exponential family is introduced. This family, together with its escort, optimizes the generalized lower bound. It also satis.es a maximum entropy principle and exhibits a thermodynamic structure in which entropy and free energy are related by Legendre transform.
Fault-Tolerant Beacon Vector Routing for Mobile Ad Hoc Networks
Authors: Luke Demoracski
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

This paper presents a new and robust Fault-Tolerant Beacon Vector Routing (BVR) approach with multiple novel improvements. The fault tolerance algorithm NetRec was extended to apply to BVR. The new technique, ManRec, provides fault tolerance in the presence of multiple simultaneous faults. A characteristic of BVR was improved, that helps to route around faulty nodes. This addresses some frequently occurring types of BVR flooding in the case of node failures. In addition, a very useful modification has been made to the original BVR algorithm, that allows the routing algorithm to better route along faulty nodes. This new combined approach improves BVR fault tolerance, reduces flooding in the network, and improves routing success, in the presence of multiple failures. This framework provides excellent results on arbitrary types of network topologies for mobile ad hoc networks. A simulator was developed, to validate the results.
APlace: a general analytic placement framework
Authors: Andrew B. Kahng, Sherief Reda, Qinke Wang
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

We streamline and extend APlace, the general analytic placement engine based on ideas of Naylor et al. [7] and described in [3, 4, 5]. Previous work explored the adaptability of APlace to multiple contexts with good quality of results. For example, the framework was extended to traditional wirelength-driven standard-cell placement in [3, 5], achieving good results in placed HPWL and routed final wire-length. The framework was also extended to top-down multilevel placement, congestion-directed placement, mixed-size placement, timing-driven placement, I/O-core co-placement and constraint handling for mixed-signal contexts [3, 4, 5]. In this work, we have modified the implementation of APlace for speed and scalability. Improvements have been made in clustering, legalization and detailed placement strategies, as well as via a distributable solution framework for both global and detailed placement phases.
Job Scheduling for Grid Computing on Metacomputers
Authors: Keqin Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

Scheduling is a fundamental issue in achieving high performance on metacomputers and computational grids. For the first time, the job scheduling problem for grid computing on metacomputers is studied as a combinatorial optimization problem. It is proven that the list scheduling algorithm can achieve reasonable worst-case performance bound in grid environments supporting distributed supercomputing with large applications. It is also observed that communication heterogeneity does have significant impact on schedule lengths.
Dynamic probabilistic broadcasting in MANETs
Authors: Qi Zhang, Dharma P. Agrawal
Venue: Journal of Parallel and Distributed Computing (2005)

In mobile ad hoc networks (MANETs), the efficiency of broadcasting protocol can dramatically affect the performance of the entire network. Appropriate use of a probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing the reachability or having any significant degradation. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability as per the node distribution and node movement. This is done based on locally available information and without requiring any assistance of distance measurements or exact location determination devices. We evaluate the performance of our approach by comparing it with the AODV protocol (which is based on simple flooding) as well as a fixed probabilistic approach. Simulation results show our approach performs better than both simple flooding and fixed probabilistic schemes.
Hybrid crossover operators for real-coded genetic algorithms: an experimental study
Authors: F. Herrera, M. Lozano, A. M. S&#x00e1;nchez
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Most real-coded genetic algorithm research has focused on developing effective crossover operators, and as a result, many different types have been proposed. Some forms of crossover operators are more suitable to tackle certain problems than others, even at the different stages of the genetic process in the same problem. For this reason, techniques which combine multiple crossovers have been suggested as alternative schemes to the common practice of applying only one crossover model to all the elements in the population. Therefore, the study of the synergy produced by combining the different styles of the traversal of solution space associated with the different crossover operators is an important one. The aim is to investigate whether or not the combination of crossovers perform better than the best single crossover amongst them. In this paper we have undertaken an extensive study in which we have examined the synergetic effects among real-parameter crossover operators with different search biases. This has been done by means of hybrid real-parameter crossover operators, which generate two offspring for every pair of parents, each one with a different crossover operator. Experimental results show that synergy is possible among real-parameter crossover operators, and in addition, that it is responsible for improving performance with respect to the use of a single crossover operator.
A model for the management of dynamic web applications
Authors: Matthijs Dijkstra
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Organizations are looking for ways to develop and maintain dynamic web pages in a time-efficient way and looking for ways to reduce the number of failures, such as broken links. Although software vendors provide software supporting the development and maintenance of dynamic web applications, they are expensive and have no formal basis. In this paper, a mathematical model is used to describe a web interface. A web interface is regarded as a decision network and the surfing behaviour of a visitor is regarded as a decision process. The analysis of the model based on this provides both theoretical and practical insights. The mathematical model also constitutes a valuable framework for system development. It makes it possible to assess the effectiveness of websites and to predict the effect of any changes in the system.This paper concludes with a description of actual experience with this model in an operational environment.
Using Message-Driven Objects to Mask Latency in Grid Computing Applications
Authors: Gregory A. Koenig, Laxmikant V. Kale
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

One of the attractive features of Grid computing is that resources in geographically distant places can be mobilized to meet computational needs as they arise. A particularly challenging issue is that of executing a single application across multiple machines that are separated by large distances. While certain classes of applications such as pipeline style or master-slave style applications may run well in Grid computing environments with little or no modification, tightly-coupled applications require significant work to achieve good performance. In this paper, we demonstrate that message-driven objects, implemented in the Charm++ and Adaptive MPI systems, can be used to mask the effects of latency in Grid computing environments without requiring modification of application software. We examine a simple five-point stencil decomposition application as well as a more complex molecular dynamics application running in an environment in which arbitrary artificial latencies can be induced between pairs of nodes. Performance of the applications running under artificial latencies are compared to the performance of the applications running across TeraGrid nodes located at the National Center for Supercomputing Applications and Argonne National Laboratory.
Practical Data Management Techniques for Vehicle Tracking Data
Authors: Sotiris Brakatsoulas, Dieter Pfoser, Nectaria Tryfona
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

A novel data source for assessing traffic conditions is floating car data (FCD) in the form of vehicle tracking data, or, in database terms, trajectory data. This work proposes practical data management techniques including data pre-processing, data modeling and indexing to support the analysis and the data mining of vehicle tracking data
From user-centric web traffic data to usage data
Authors: Thomas Beauvisage, Houssem Assadi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we describe a user-centric Internet usage data processing platform. Raw usage data is collected using a software probe installed on a panel of Internet users' workstations. It is then processed by our platform. The transformation of raw usage data into qualified and usable information by Internet usage sociology researchers means setting up a series of relatively complex processes using quite a wide variety of resources. We use a combination of ad hoc rule-based systems and external resources to qualify the visited Web pages. We also implemented topological and temporal indicators in order to describe the dynamics of Web sessions.
Efficient TTP-Free Mental Poker Protocols
Authors: Weiliang Zhao, Vijay Varadharajan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Zhao et al proposed an efficient mental poker protocol which did not require using a Trusted Third Party(TTP). The protocol is efficient and suitable for any number of players but it introduces a security flaw. In this paper, we propose two mental poker protocols based on Zhao's previous work. The security flaw has been removed and the additional computing cost is small.