ppxscal/embedding_network huggingface dataset:
Path-Oriented Transition Fault Test Generation Considering Operating Conditions
Authors: B. Seshadri, I. Pomeranz, S. M. Reddy, S. Kundu
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

We describe a test generation procedure for path-oriented transition faults that takes into account the fact that operating conditions may change during circuit operation. A path-oriented transition fault is detected through the longest sensitizable path that goes through the fault site. The operating conditions we consider are junction temperature and power supply voltage. Since path delays change with operating conditions, the longest path through a fault site may be different under different conditions. We show that test generation using nominal delays is not sufficient for covering the complete range of operating conditions, even if N-detection test generation is used. Therefore, operating conditions need to be addressed explicitly during test generation. However, since temperature and voltage are continuous variables and represent an infinite number of values in the range, test generation must concentrate on a small selected set of operating conditions. We discuss the selection of these conditions and demonstrate that N-detection test generation with multiple operating conditions is effective in covering the range of operation conditions almost completely.
Fairness and optimality in congestion games
Authors: Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general problem is hard to approximate to any factor, we give simple algorithms for natural simplifications. We also consider these problems in the symmetric network congestion game model [11, 4], and show hardness results and approximate solutions.
The Impossibility of Boosting Distributed Service Resilience
Authors: Paul Attie, Rachid Guerraoui, Petr Kouznetsov, Nancy Lynch, Sergio Rajsbaum
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and f-resilient services can solve the consensus problem in the presence of f+1 undetectable process stopping failures. (A service is f-resilient if it is guaranteed to operate as long as no more than f of the processes connected to it fail.) Our first theorem assumes that the given services are atomic objects, and allows any connection pattern between processes and services. In contrast, we show that it is possible to boost the resilience of systems solving problems easier than consensus: the k-set consensus problem is solvable for 2k-1 failures using 1-resilient consensus services. The first theorem and its proof generalize to the larger class of failure-oblivious services. Our second theorem allows the system to contain failure-aware services, such as failure detectors, in addition to failure-oblivious services; however, it requires that each failure-aware service be connected to all processes. Thus,thus f+1 process failures overall can disable all the failure-aware services. In contrast, it is possible to boost the resilience of a system solving consensus if arbitrary patternsof connectivity are allowed between processes and failure-aware services: consensus is solvable for any number of failures using only 1-resilient 2-process perfect failure detectors.
Feedback Classification of Multi-Input Nonlinear Control Systems
Authors: Issa Amadou Tall
Venue: SIAM Journal on Control and Optimization (2005)

We study the feedback group action on multi-input nonlinear control systems with uncontrollable mode. We follow slightly an approach proposed in Kang and Krener [W. Kang and A. J. Krener, SIAM J. Control. Optim., 30 (1992), pp. 1319--1337] which consists of analyzing the system and the feedback group step by step. We construct a normal form which generalizes, on one hand, the results obtained in the single-input case and, on the other hand, those recently obtained by the same author in the controllable case. We illustrate our results by studying the Caltech Multi-Vehicle Wireless Testbed (MVWT) and the prototype of Planar Vertical TakeOff and Landing aircraft {(PVTOL)}. We also study the notion of bifurcation of controllability for systems with one nonzero uncontrollable mode. We first show that the equilibria for those systems is a p-dimensional submanifold (p equals number of inputs). Provided that one term in their normal form is nonzero, we show that these systems are linearly controllable, hence stabilizable, at any nearby equilibrium point of the origin.
Applying SPE techniques for modeling a grid-enabled JAVA platform
Authors: Mariela Curiel, M. Angélica Pérez, Ricardo González
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Advances in Internet and the availability of powerful computers and high-speed networks have propitiated the rise of Grids. The scheduling of applications in Grids is complex due to factors like the heterogeneity of resources and changes in their availability. Models provide a way of performing repeatable and controllable experiments for evaluating scheduling algorithms under different scenarios. This article describes the development of a performance model for a JAVA-based distributed platform using a SPE methodology, where Layered Queuing Network (LQN) models are derived from Use Case Maps (UCM).
TCP with adaptive pacing for multihop wireless networks
Authors: Sherif M. ElRakabawy, Alexander Klemm, Christoph Lindemann
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the TCP congestion window. We show how a TCP sender can adapt its transmission rate close to the optimum using an estimate of the current 4-hop propagation delay and the coefficient of variation of recently measured round-trip times. The novel TCP variant is denoted as TCP with Adaptive Pacing (TCP-AP). Opposed to previous proposals for improving TCP over multihop IEEE 802.11 networks, TCP-AP retains the end-to-end semantics of TCP and does neither rely on modifications on the routing or the link layer nor requires cross-layer information from intermediate nodes along the path. A comprehensive simulation study using ns-2 shows that TCP-AP achieves up to 84% more goodput than TCP NewReno, provides excellent fairness in almost all scenarios, and is highly responsive to changing traffic conditions.
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
Authors: Pavol Hell, Jing Huang
Venue: SIAM Journal on Discrete Mathematics (2005)

Recently, D. Corneil found a simple 3-sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil's algorithm to make it a certifying algorithm, and then describe a similar certifying 3-sweep LexBFS algorithm for the recognition of proper interval bigraphs. It follows from an earlier paper that the class of proper interval bigraphs is equal to the better known class of bipartite permutation graphs, and so we have a certifying algorithm for that class as well. All our algorithms run in time O(m+n), including the certification phase. The certificates of representability (the intervals) can be authenticated in time O(m+n). The certificates of nonrepresentability (the forbidden subgraphs) can be authenticated in time O(n).
Implementation of the SHA-2 Hash Family Standard Using FPGAs
Authors: N. Sklavos, O. Koufopavlou
Venue: The Journal of Supercomputing (2005)

The continued growth of both wired and wireless communications has triggered the revolution for the generation of new cryptographic algorithms. SHA-2 hash family is a new standard in the widely used hash functions category. An architecture and the VLSI implementation of this standard are proposed in this work. The proposed architecture supports a multi-mode operation in the sense that it performs all the three hash functions (256, 384 and 512) of the SHA-2 standard. The proposed system is compared with the implementation of each hash function in a separate FPGA device. Comparing with previous designs, the introduced system can work in higher operation frequency and needs less silicon area resources. The achieved performance in the term of throughput of the proposed system/architecture is much higher (in a range from 277 to 417%) than the other hardware implementations. The introduced architecture also performs much better than the implementations of the existing standard SHA-1, and also offers a higher security level strength. The proposed system could be used for the implementation of integrity units, and in many other sensitive cryptographic applications, such as, digital signatures, message authentication codes and random number generators.
PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems
Authors: Huaping Shen, Mary Suchitha Joseph, Mohan Kumar, Sajal K. Das
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Mobile Peer-to-Peer (MP2P) systems consist of mobile peers that collaborate with each other to complete application problems. Information sharing in such environments is a challenging problem due to the fundamental limitations of battery power, wireless bandwidth, and users' frequent mobility. We proposed a novel scheme, called Proximity Regions for Caching in Cooperative MP2P Networks (PReCinCt) to efficiently support scalable data retrieval in large-scale MP2P networks. In the PReCinCt scheme, the network topology is divided into geographical regions where each region is responsible for a set of keys representing the data. In this paper, we extend the PReCinCt scheme to facilitate consistent cooperative caching in MP2P systems. The caching scheme considers data popularity, data size and region-distance during replacement to optimize cache content of peers. PReCinCt employs a hybrid push/pull mechanism to maintain data consistency among replicas in the network. Simulation results show the cost of consistency maintenance in terms of latency and energy consumption is significantly improved in the PReCinCt scheme.
A consideration of e-business modeling value evaluation
Authors: Midori Takao, Masao J. Matsumoto
Venue: Systems and Computers in Japan (2004)

Business is being reformed into e-business via e-business modeling. The value obtained by implementing e-business is referred to as e-business modeling value, and in this paper the authors discuss a framework for such an evaluation. Based on examples of changes in business value due to e-business modeling in three industries, including consumer products manufacturing, the authors identify value targets for major business processes by closely investigating the differences between them and conventional business value evaluation targets. The authors offer their framework as one cause of the reduction in investor interest resulting from the currently weak frameworks to measure the effects of e-business investment. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 85&ndash;97, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10561
Saddle Points and Pareto Points in Multiple Objective Programming
Authors: Matthias Ehrgott, Margaret M. Wiecek
Venue: Journal of Global Optimization (2005)

In this paper relationships between Pareto points and saddle points are studied in convex and nonconvex multiple objective programming. The analysis is based on partitioning the index sets of objectives and constraints and splitting the original problem into subproblems having a special structure. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. In the nonconvex case, a saddle point characterization of Pareto points is possible under assumptions that guarantee existence of Pareto points and stability conditions of single objective problems. Essentially, these conditions are not stronger than those in analogous results for single objective programming.
Can we use a complex systems framework to model community-based learning?
Authors: Elizabeth Charles
Venue: ACM SIGGROUP Bulletin (2003)

The classroom is bustling with activity and Miss Lawson calls out, "five more minutes." Scattered throughout the room are groups of four and five students crowded around each of the five low-standing circular work desks. A palpable buzz of enthusiasm fills the air as these groups deliberate amongst themselves before hurriedly filling in the large sheets of poster paper sitting on their work desks.
Working Session on Interoperable Reengineering Services
Authors: Dean Jin, Andreas Winter
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Interoperability is the challenge involved in getting software components to work together. This working session discusses in depth the state of the art in reengineering tool interoperability. A distinction is made between data interoperability and service interoperability. The limitations and promise of each of these aspects of interoperability will be introduced. Examples of existing solutions and an examination of the ways they can be improved to further enhance the reengineering process will be discussed. An evaluation of open problems will show future research perspectives in reengineering tool interoperability.
Jacobian elliptic functions as inverses of an integral
Authors: B. C. Carlson
Venue: Journal of Computational and Applied Mathematics (2005)

The 12 Jacobian elliptic functions are traditionally shown as inverses of 12 elliptic integrals, all of them being special cases of ∫yx[(a1 + b1t2)(a2 + b2t2)-1/2 dt in which all quantities are real and either y = 0 or x = ∞ or a1 + b1y2 = 0 or a1 + b1x2 = 0. A new unified treatment shows that for each of these four cases the other limit of integration is determined as the inverse function of the integral by the two products a1b2 and a2b1. Inequalities and equalities between these two and 0 distinguish the 12 Jacobian functions, the six circular functions, and the six hyperbolic functions. The proof comes from a corollary of a reduction theorem for the symmetric elliptic integral of the first kind.
A technical framework for sense-and-respond business management
Authors: S. Kapoor, K. Bhattacharya, S. Buckley, P. Chowdhary, M. Ettl, K. Katircioglu, E. Mauch, L. Phillips
Venue: IBM Systems Journal (2005)

In this paper we present a technical framework that supports sense and respond (SaR), the approach that enables an enterprise to adapt to a rapidly changing business environment. To implement the SaR approach, an enterprise proactively monitors trends and uses effective decision-support tools to help it act in a timely manner. We describe two pilot projects in which we implemented SaR prototypes and applied them to solve business problems. In the first pilot project we helped the IBM Microelectronics Division deploy an automated inventory management system based on our inventory optimization model. In the second pilot project, we helped the IBM Personal Computing Division deploy a SaR system in support of demand/supply conditioning. One of the components of this SaR system is an order trend model that provides early warning of constraints and excesses in the supply chain and helps make demand/supply conditioning more effective. Early results from these projects are encouraging and show that significant gains in profitability are possible.
Resisting Flooding Attacks in Ad Hoc Networks
Authors: Ping Yi, Zhoulin Dai, Yiping Zhong, Shiyong Zhang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called Ad Hoc Flooding Attack, can result in denial of service when used against ondemand routing protocols for mobile ad hoc networks, such as AODV, DSR. The intruder broadcasts mass Route Request packets or sends a lot of attacking DATA packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed Ad Hoc Flooding Attack, we develop Flooding Attack Prevention (FAP), a generic defense against the Ad Hoc Flooding Attack in mobile ad hoc networks. The FAP is composed of neighbor suppression and path cutoff. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder observe a high rate of Route Request and then they lower the corresponding priority according to the rate of incoming queries. Moreover, not serviced low priority queries are eventually discarded. When the intruder sends many attacking DATA packets to the victim node, the node may cut off the path and does not set up a path with the intruder any more. Mobile ad hoc networks can prevent the Ad Hoc Flooding Attack by FAP with little overhead.
Demonstrating the Effectiveness of Exclusion Control for Components
Authors: John Potter, Abdelsalam Shanneb, Eric Yu
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

We present experimental results on how the granularity of locking provided by synchronization wrappers affects performance. The wrappers implement method-level synchronization whose exclusion behavior is specified using a declarative approach. Our experimental results with both Java and C# suggest that fine-grained exclusion control is worthwhile implementing, at least for heavily loaded objects, and that there appears to be no performance penalty in doing so. To overcome resistance to programming more complex and fragile synchronization code, we propose generating the code automatically, based on the exclusion specification. Essentially this only entails describing the read-write conflicts between method pairs in an objectýs interface. The automatic code generation can either be done dynamically using existing reflection mechanisms, or statically by a compiler. In the latter case we envisage minor language extensions to allow programmers to specify both the exclusion requirements for a given object, and the exclusion control to be provided by a given object when it is constructed.
Symposium Versus Newsletter
Authors: Larry Press
Venue: ACM SIGSMALL/PC Notes (1987)

Like most of our members, I was unable to attend our Symposium on Small Systems last December, but I have had a chance to read the Proceedings. I'm writing this note for two reasons: to say a little about the Proceedings in case others might want to order a copy and to speculate on how we can get future Symposium papers to the members at large. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Query by image and video content: a colored-based stochastic model approach
Authors: Faruq A. Al-Omari, Mohammad A. Al-Jarrah
Venue: Data Knowledge Engineering (2005)

For efficient image retrieval, the image database should be processed to extract a representing feature vector for each member image in the database. A reliable and robust statistical image indexing technique based on a stochastic model of an image color content has been developed. Based on the developed stochastic model, a compact 12-dimensional feature vector was defined to tag images in the database system. The entries of the defined feature vector are the mean, variance, and skewness of the image color histogram distributions as well as correlation factors between color components of the RGB color space. It was shown using statistical analysis that the feature vector provides sufficient knowledge about the histogram distribution. The reliability and robustness of the proposed technique against common intensity artifacts and noise was validated through several experiments conducted for that purpose. The proposed technique outperforms traditional and other histogram based techniques in terms of feature vector size and properties, as well as performance.
Dual Clustering: Integrating Data Clustering over Optimization and Constraint Domains
Authors: Cheng-Ru Lin Ken-Hao Liu Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

Spatial clustering has attracted a lot of research attention due to its various applications. In most conventional clustering problems, the similarity measurement mainly takes the geometric attributes into consideration. However, in many real applications, the nongeometric attributes are what users are concerned about. In the conventional spatial clustering, the input data set is partitioned into several compact regions and data points which are similar to one another in their nongeometric attributes may be scattered over different regions, thus making the corresponding objective difficult to achieve. To remedy this, we propose and explore in this paper a new clustering problem on two domains, called dual clustering, where one domain refers to the optimization domain and the other refers to the constraint domain. Attributes on the optimization domain are those involved in the optimization of the objective function, while those on the constraint domain specify the application dependent constraints. Our goal is to optimize the objective function in the optimization domain while satisfying the constraint specified in the constraint domain. We devise an efficient and effective algorithm, named Interlaced Clustering-Classification, abbreviated as ICC, to solve this problem. The proposed ICC algorithm combines the information in both domains and iteratively performs a clustering algorithm on the optimization domain and also a classification algorithm on the constraint domain to reach the target clustering effectively. The time and space complexities of the ICC algorithm are formally analyzed. Several experiments are conducted to provide the insights into the dual clustering problem and the proposed algorithm.
The indexable web is more than 11.5 billion pages
Authors: A. Gulli, A. Signorini
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this short paper we estimate the size of the public indexable web at 11.5 billion pages. We also estimate the overlap and the index size of Google, MSN, Ask/Teoma and Yahoo!
Katriel's Operators for Products of Conjugacy Classes of Sn
Authors: Alain Goupil, Dominique Poulalhon, Gilles Schaeffer
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We define a family of differential operators indexed with fixed point free partitions. When these differential operators act on normalized power sum symmetric functions q¿(x), the coefficients in the decomposition of this action in the basis q¿(x) are precisely those of the decomposition of products of corresponding conjugacy classes of the symmetric group Sn. The existence of such operators provides a rigorous definition of Katriel's elementary operator representation of conjugacy classes and allows to prove the conjectures he made on their properties.