ppxscal/embedding_network huggingface dataset:
Asymptotic behavior of the central path for a special class of degenerate SDP problems
Authors: Jo&#x00e3;o X. da Cruz Neto, Orizon P. Ferreira, Renato D. C. Monteiro
Venue: Mathematical Programming: Series A and B (2005)

This paper studies the asymptotic behavior of the central path (X(&#x03bd;),S(&#x03bd;),y(&#x03bd;)) as &#x03bd;&#x2193;0 for a class of degenerate semidefinite programming (SDP) problems, namely those that do not have strictly complementary primal-dual optimal solutions and whose &#x201c;degenerate diagonal blocks&#x201d; ** of the central path are assumed to satisfy **. We establish the convergence of the central path towards a primal-dual optimal solution, which is characterized as being the unique optimal solution of a certain log-barrier problem. A characterization of the class of SDP problems which satisfy our assumptions are also provided. It is shown that the re-parametrization t>0&#x2192;(X(t4),S(t4),y(t4)) of the central path is analytic at t=0. The limiting behavior of the derivative of the central path is also investigated and it is shown that the order of convergence of the central path towards its limit point is **. Finally, we apply our results to the convex quadratically constrained convex programming (CQCCP) problem and characterize the class of CQCCP problems which can be formulated as SDPs satisfying the assumptions of this paper. In particular, we show that CQCCP problems with either a strictly convex objective function or at least one strictly convex constraint function lie in this class.
Searching the Solution Space in Constructive Geometric Constraint Solving with Genetic Algorithms
Authors: M. V. Luzón, A. Soto, J. F. Gálvez, R. Joan-Arinyo
Venue: Applied Intelligence (2005)

Geometric problems defined by constraints have an exponential number of solution instances in the number of geometric elements involved. Generally, the user is only interested in one instance such that besides fulfilling the geometric constraints, exhibits some additional properties. Selecting a solution instance amounts to selecting a given root every time the geometric constraint solver needs to compute the zeros of a multi valuated function. The problem of selecting a given root is known as the Root Identification Problem.In this paper we present a new technique to solve the root identification problem. The technique is based on an automatic search in the space of solutions performed by a genetic algorithm. The user specifies the solution of interest by defining a set of additional constraints on the geometric elements which drive the search of the genetic algorithm. The method is extended with a sequential niche technique to compute multiple solutions. A number of case studies illustrate the performance of the method.
REPORTS FROM CSCW'92
Authors: Sara Bly
Venue: ACM SIGCHI Bulletin (1993)

The ACM Conference on Computer-Supported Cooperative Work (CSCW'92) was held in Toronto, Canada, October 31 to November 4, 1992. Sponsored by ACM SIGCHI and SIGOIS, the conference was focused on "sharing perspectives" especially in bringing together the multiple disciplines of the field. In the next several pages, you will find seven panel and workshop reports that are summaries of discussions not available as part of the conference proceedings.
On the revision of probabilistic beliefs using uncertain evidence
Authors: Hei Chan, Adnan Darwiche
Venue: Artificial Intelligence (2005)

We revisit the problem of revising probabilistic beliefs using uncertain evidence, and report results on several major issues relating to this problem: how should one specify uncertain evidence? How should one revise a probability distribution? How should one interpret informal evidential statements? Should, and do, iterated belief revisions commute? And what guarantees can be offered on the amount of belief change induced by a particular revision? Our discussion is focused on two main methods for probabilistic revision: Jeffrey's rule of probability kinematics and Pearl's method of virtual evidence, where we analyze and unify these methods from the perspective of the questions posed above.
A High-Performance Framework for Sun-to-Earth Space Weather Modeling
Authors: Ovsei Volberg, Tamas I. Gombosi, Kenneth G. Powell, Aaron J. Ridley, Kenneth C. Hansen, Gabor Toth, Quentin F. Stout, Darren De Zeeuw, Kevin Kane, David R. Chesney, Robert Oehmke
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

The Space Weather Modeling Framework (SWMF) aims at providing software architecture for integrated modeling of different domains of Sun-Earth system and high-performance physics-based space weather simulation. The SWMF component architecture promotes collaboration between developers of individual physics models and empowers them by providing coupling context and parallel and distributed computing support. The framework design places minimal requirements on components. The webbased Graphical User Interface facilitates the remote access to the framework even from scientific groups that do not have an access to supercomputers or clusters otherwise.
AIS SIGHCI position paper
Authors: Dennis F. Galletta, Ping Zhang, Fiona Fui-Hoon Nah
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The upcoming ACM SIGCHI Development Consortium is aimed at meeting the needs of multidisciplinary professionals that must choose among a variety of professional associations and their events. The position of AIS' (Association for Information Systems) SIGHCI is that the main problem lies in the deep chasms that separate the literatures of the related disciplines, and the solution is to provide an umbrella organization that enables a more organized federation of disciplines, groups, and associations. Problems identified include differences in terminology, competition for scarce resources, differences in how publications in various outlets are valued, and confusion about where should be the "home" for HCI/CHI majors. Suggestions include developing a framework for a federation, negotiating shared understandings about publication outlets, and coordinating information about meetings and other events.
IP network for emergency service
Authors: K. K. A. Zahid, L. Jun, K. Kazaura, M. Matsumoto
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Internet has become the primary means for worldwide communications. In terms of recreation, business, and various imaginative reasons for information distribution it is the most used communication method today. In recent times, it is a big issue of how we can make the best use of Internet in an emergency period. The goal of this paper is to ensure Internet's best effort services to help during emergencies without any major changes in existing technology. Here, we present a system architecture that reflects a general overview of how it can work parallel to the authorized Emergency Telecommunications Services (ETS). To detect location information in a loosely coupled network environment is the most challenging aspect using IP's flat address model. Our conceptual view of the system architecture shows how the service can be provided extending DHCP, XML with existing core technology. In succession, a simulation of the system is shown to realize call setup delay and end to end VoIP packet delay over the IP network.
Scalable packet classification
Authors: Florin Baboescu, George Varghese
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Packet classification is important for applications such as firewalls, intrusion detection, and differentiated services. Existing algorithms for packet classification reported in the literature scale poorly in either time or space as filter databases grow in size. Hardware solutions such as TCAMs do not scale to large classifiers. However, even for large classifiers (say, 100 000 rules), any packet is likely to match a few (say, 10) rules. This paper seeks to exploit this observation to produce a scalable packet classification scheme called Aggregated Bit Vector (ABV). It takes the bit vector search algorithm (BV) described in Lakshman and Stidialis, 1998 (which takes linear time) and adds two new ideas, recursive aggregation of bit maps and filter rearrangement, to create ABV (which can take logarithmic time for many databases). We show that ABV outperforms BV by an order of magnitude using simulations on both industrial firewall databases and synthetically generated databases.
Checking and Transforming Models with AutoFOCUS
Authors: Bernhard Schatz, Peter Braun, Franz Huber, Alexander Wisspeintner
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The construction of increasingly sophisticated software systems demands techniques to reduce the complexity of the development process by supplying automated steps. In a model-based approach, operations to analyse and transform models of the system can be used to supply some automation for the development process. These operations can be embedded in a CASE-based approach to ensure conceptual consistency and support the application of design and process patterns.
Document-Oriented Software Construction based on Domain-Specific Markup Languages
Authors: Jose Luis Sierra, Baltasar Fernandez-Manjon, Alfredo Fernandez-Valmayor, Antonio Navarro
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper we present ADDS (Approach to Document-oriented Development of Software), our solution to software construction based on Domain-Specific Languages (DSLs). DSLs in ADDS are formulated as descriptive Domain-Specific Markup Languages (DSMLs) that are used for marking up the documents that describe the relevant aspects of the applications (e.g. data and some aspects of the behavior). Final running applications are obtained by the processing of these documents with suitable processors. ADDS promotes the incremental development of DSMLs and their processors, so they can evolve according to the authoring needs of the different participants in the development process (domain experts and developers). The incremental nature of ADDS is eased by its document orientation. Thus ADDS palliates the high costs of formulation, operationalization and maintenance of DSLs exhibited by other approaches.
Safety assurance via on-line monitoring
Authors: Shlomi Dolev, Frank Stomp
Venue: Distributed Computing (2003)

This paper proposes a new approach and new techniques for on-line monitoring of concurrent programs to ensure that some of their safety properties are not violated. The techniques modify erroneous systems, which violate a certain safety property, into new systems which satisfy the safety property. It does so by adding a new layer that controls the scheduling of steps in the system. We formally characterize the relationship between the erroneous and the new system. Safety monitors for mutual-exclusion, l-exclusion, and the producer-consumer tasks are presented. Proofs for the mutual-exclusion task and the l-exclusion task are presented to demonstrate the applicability of our approach.
Fine-Grain Adaptive Compression in Dynamically Variable Networks
Authors: Calton Pu, Lenin Singaravelu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine-Grain (FG) Mixing strategy that compresses and sends as much data as possible, and then uses any remaining bandwidth to send uncompressed packets. Experimental measurements show that FG Mixing achieves significant gains in effective throughput, particularly at higher network bandwidths. However, non-trivial interactions between system components and layers (e.g., compression algorithms and middleware settings such as block size and buffer size) have significant impact on the overall system performance. Finally, the trade-offs and performance profiles of FG Mixing are measured, observed, and found to be consistent over a wide range of combinations of compression algorithms (GZIP, LZO, BZIP2), workload compression ratios (from 1 to 4), and network bandwidth (from 0 to 400 Mbps).
Voice activated command and control with Java-enabled speech recognition over Wifi
Authors: Tony Ayres, Brian Nolan
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

In this paper we present recent research in the development of a voice enabled command and control application, using Java, in which a remote robotic device, with a JVM, is controlled over a Wifi/WLAN/TCPIP network from a mobile handheld PC (iPaq) or a PC workstation. The research considers three different scenario configurations. A recognition grammar for command and control of the robot has been created and implemented in Java, in part in the recognition engine and in part on the robot. The robot is a proxy for one of a number of JVM enabled intelligent devices that can be controlled in this manner. The physical topology involves Java at each node endpoint, that is, at the handheld PC (iPaq), the PC workstation, the Linux server and onboard the robot (including its Java based Lejos OS). Network communications is primarily WLAN with an element of IR and the possibility of BlueTooth (subject to the resolution of certain important Java and Bluetooth issues). For placement of a speech recognition engine on Linux we are initially using Sphinx through the Java Native Interface but plan to develop our own speech recognition engine, in Java, for deployment on Linux. Traditionally speech processing in software has resided in the domain of C software development. Recent advances in Java with the Java Speech API, along with the Java Media Framework, have facilitated the consideration of Java for speech and language engineering activities. Our hypothesis is that Java is now a suitable platform for speech and language engineering in software. The evidence provided by our initial results, for Java speech recognition, achieved using the Cloudgarden implementation of JSAPI, validates this hypothesis. We outline our future plans to move our framework more fully into the ubiquitous computing arena and extend the reach of Java and speech processing in support of command and control a structured way, including, for example, camera feedback to base.
Measuring Software Processes Performance based on the Fuzzy Multi Agent Measurements
Authors: Mir Ali Seyyedi, Mohammad Teshnehlab, Fereidoon Shams
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The present article discusses and presents a new comprehensive approach aimed at measuring the maturity and quality of software processes. This method has been designed on the basis of Software Capability Maturity Model (SW-CMM) and the Multi-level Fuzzy Inference Model and is used as a measurement and analysis tool. Among the most important characteristics of this method one can mention simple usage, accuracy, quantitative measures and comparability. Fuzzy logic-based tools are designed to provide such functions.
ATF: an adaptive three-layer framework for inter-stream synchronization of SMIL multimedia presentations
Authors: Ing-Chau Chang, Sheng-Wen Hsieh
Venue: Journal of Systems and Software (2005)

In this paper, we propose an Adaptive Three-layer Framework (ATF) to guarantee the inter-stream synchronization, which is called as the APplication Quality of Service (APQoS) in this paper, of World Wide Web Consortium (W3C) Synchronized Multimedia Integration Language (SMIL) presentation. This ATF framework, which is composed of the Framework Control Layer (FCL), the Quality Guarantee Layer (QGL) and the Media Control Layer (MCL), functions as the middleware between underlying best-effort network protocol stacks and the SMIL client/server applications. The FCL at the SMIL client periodically monitors underlying network bandwidth and delay for the QGL to verify whether the total bandwidth requirements of all concurrent objects to meet the APQoS of the SMIL presentation can be satisfied with the available bandwidth, which is the sum of the monitored bandwidths of all concurrent objects. The QGL executes the novel Intra-SMIL Bandwidth Reallocation (ISBR) scheme to dynamically adjust bandwidth allocations among concurrent SMIL objects, according to their Media Importance (MI) values calculated by the MCL. If the available bandwidth is not enough, the ISBR scheme gracefully degrades the layer-encoded objects that have the smallest MI values and only allocate the necessary bandwidth for their base layer (BL) streams instead. Oppositely, if aggressively upgrades the degraded layer-encoded objects that have the largest MI values and allocate the necessary bandwidth for both the BL and enhancement layer (EL) streams. These bandwidths are then feedback to the remote media servers to modify the transmission rates accordingly. With the quantitative analysis for the SMIL presentation quality, this ATF framework achieves the APQoS with the best SMIL playback quality.
A Presentation Description Language for Adaptive Web Systems
Authors: S. Hossein Sadat, Ali A. Ghorbani
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Adaptive Web systems apply page synthesis techniques to increase the flexibility of adaptation. Page synthesis process uses various system models, such as concept model, user model, and presentation model to generate the final presentation. The authors of an adaptive Web system need to express these models in a simple and reusable way. In this paper, a new language is proposed for presentation description to be used in an adaptive Web systems framework. The syntax of the language as well as its semantics has been defined and the implementation of a compiler for the language is discussed.
Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks
Authors: J. Li, G. Mohan, E. Cheng Tien, K. C. Chua
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

In this paper, we investigate the problem of dynamically routing bandwidth-guaranteed label switched paths (LSPs) in integrated IP-over-wavelength division multiplexed (WDM) networks with inaccurate link state information. To select a good path, a routing algorithm needs up-to-date link state information. This leads to excessive update overhead and scalability problems. In real networks, from the practical point of view, in order to avoid extensive overhead of advertising and processing link state information, updates need to be made periodically or based on a threshold trigger. This leads to inaccuracies in the link state information. Our contribution is that we consider the routing problem taking into consideration the uncertainty of link state parameters due to wavelength inaccuracy in addition to bandwidth inaccuracy. Based on the threshold-triggered update scheme, we present a probabilistic method to model the uncertainty of link state parameters. We then define a cost function reflecting the uncertainty. Depending on different cost metrics chosen to be optimized, we propose two routing algorithms considering the uncertainty of link state parameters. The objective is to minimize the impact of inaccurate information so that the blocking probability as well as setup failures are reduced. We use various performance metrics such as total blocking probability, blocking probability due to setup failures, blocking probability due to routing failures, bandwidth update frequency, and wavelength update frequency to evaluate the effectiveness of the proposed algorithms. Through extensive simulation experiments, we show that our algorithms can significantly reduce the impact of inaccurate link state information and perform very well.
Managing infinite variability in mobile terminal software: Research Articles
Authors: Alessandro Maccari, Anders Heie
Venue: Software&mdash;Practice Experience (2005)

Mobile terminals have evolved from basic portable telephones to complex and diverse devices that encompass dozens of other features, ranging from tri-dimensional games to office suites with data transmission capabilities. Variability is value: mobile terminal manufacturers must succeed in fulfilling the requirements of hundreds of mobile telecom operators worldwide, and at the same time increase the value of their brand by adopting a common user interface style while offering the features that the target end-user category desires. This makes for practically infinite variability and creates a business problem. The complexity of the variability problem increases due to issues such as the ability to &lsquo;plug and play&rsquo; and &lsquo;feature descension&rsquo; (the down-scaling of high-end features and their introduction into lower-end models). The main lesson we have learned from our experience in this field is that the application of relatively simple architectural patterns usually eases up management of the complexity at the architectural level. However, tackling the variability problem at the technical level is ineffective unless the organization is able to ensure the application of the solutions. We analyze the main challenges that lie behind the variability problem in mobile terminals, at both technical and organizational level, and illustrate some of the solutions we have implemented together with our product developers and system architects. Our experience calls for more applied research in the area of variability management, as well as for a number of enhancements to academic curricula. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Models and Modeling Infrastructures for Global Computational Platforms
Authors: Rich Wolski, Daniel Nurmi, John Brevik, Henri Casanova, Andrew Chien
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Recent research results and infrastructure efforts demonstrate the potential effectiveness of large-scale distributed computing. Effective scheduling based on empirically verifiable models has emerged as a key factor in these successes. Moving to a new truly global computing capability will similarly depend critically on new models and scheduling techniques. The development and instantiation of models for computing platforms are critical first steps for studying the feasibility and scalability of applications, as well as for developing methodologies to enhance application performance. Our focus, in this proposal, is on the modeling technologies that will enable performance engineering of such global computations. Specifically, these new modeling technologies will support resource characterization and scheduling techniques thereby enabling robust, predictable performance.
Web Services Are Not Distributed Objects
Authors: Werner Vogels
Venue: IEEE Internet Computing (2003)

The hype surrounding Web services has generated many common misconceptions about the fundamentals of this emerging technology.