ppxscal/embedding_network huggingface dataset:
Survivability-Aware Configuration Management of Service-Oriented System Based on Service Dependency
Authors: Tun Lu, Ning Gu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Service-oriented computing (SOC) emerging as a new computing diagram that supports the rapid and low-cost development of distributed applications by composing platform-independent, coarse-grained and loosely coupled services. With the prevalence of service-oriented system, how to build survivable applications in the immature research field of serviceoriented system engineering (SOSE) has become a big challenge. An approach of configuration management based on service dependency is presented in this paper to analyze and optimize the survivability of applications. Three dimensions, i.e. distance, strength and criticality, are defined to describe the survivability of service dependency. A directed acyclic graph called weighted system configuration graph (WSCG) is proposed to model the survivability of an application, where each direct dependency between two services is assigned a weight which is calculated based on the three dimensions. Then we give an algorithm in WSCG to obtain the maximal survivability system configuration from redundant service configurations. The mobile video conference (MVC) scenario is illustrated to show the effectiveness and the soundness of our approach and algorithms. At last, the conclusion is drawn with future work given.
Impulse noise removal by multi-state median filtering
Authors: Tao Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Images are often corrupted by impulse noise due to a noisy sensor or channel transmission errors. The goal of removing impulse noise is to suppress the noise while preserving the integrity of edge and detail information associated with the original image. In this paper, a generalized framework for median filtering based on a switching scheme, called multi-state median (MSM) filter, is proposed. By using a simple thresholding operation, the output of the proposed MSM filter is adaptively switched among those of a group of centre weighted median (CWM) filters having different centre weights. As a result, the MSM filter is equivalent to an adaptive CWM filter with a space varying center weight which is dependent on local signal characteristics. The effectiveness in noise suppression and detail preservation of the proposed filtering technique has been evaluated by extensive simulations, showing superior performance to other median based filters.
SU-8 process for biomedical inspection /spl mu/-carriers
Authors: P.-H. Chen, P.-P. Ding, J.-S. Kuo
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The present study provides a novel carrier fabrication method for biomedical application. The SU-8 thick photoresist fabrication process is used to produce the /spl mu/-carrier of 200 /spl mu/m/spl times/200 /spl mu/m with various thicknesses. These /spl mu/-carriers will be used for the purpose of biomedical inspection after proper surface modification by chemicals. To quantify and qualify the immersed /spl mu/-carriers in the inspected solution, specific marker is designed and fabricated on every /spl mu/-carrier as identification according to the application. Hence, a precise control on the marker feature dimension will be crucial for the application. In addition, the thick resist layer uniformity is very important in defining the marker pattern on the surface of carrier. Besides, the sidewall profile is also crucial especially for the fabrication of 10 /spl mu/m through-hole markers on the carriers of 50 /spl mu/m to 100 /spl mu/m thick. The orthogonal array experimental design method is employed to optimize the process parameters, including the soft bake, exposure, postexposure bake, and development parameters. Moreover, the effect of development with ultrasonic agitation is also investigated.
Analysis of subband adaptive filters
Authors: H. Sakai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents an analysis of a subband adaptive filter structure using noncausal Wiener filter theory and multirate system concepts. The transfer function of the overall system is close to that of the full band optimal Wiener filter whereas that of the conventional subband filter contains a delay of the filter bank.
Advanced Techniques for Watershed Visualization
Authors: Vladimir J. Alarcon, Charles G. O'Hara
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Analytical shaded relief is commonly used for visualization of Digital Elevation Models (DEMs). Sometimes, the quality of unaltered analytical shaded relief can be lacking for identification of streams and water divides. Hydroshading [1] is a technique that provides enhanced capabilities of visualization of hydrologically-meaningful topographical features. In this research, hydroshading algorithms are applied to NASA's Shuttle Radar Topography Mission (SRTM) DEM datasets. The visualization technique is applied to coastal and inland watersheds in Mississippi (Saint Louis Bay and Luxapallila, respectively). The testing of hydroshading in these two areas shows that the technique is more effective in areas with moderate topographical relief than in low relief terrain. Combining hydroshading with standard threedimensional visualization of DEMs enhances identification of water divides and streams. Hydroshaded DEMs were used to manually delineate Luxapallila and Saint Louis Bay's Wolf River catchments. Delineation results are comparable to output of standard automated delineation produced by GIS software (BASINS).
Anthills built to order: automating construction with artificial swarms
Authors: Radhika Nagpal, H. Sebastian Seung
Venue:  (2006)

Social insects build large, complex structures, which emerge through the collective actions of many simple agents acting with no centralized control or preplanning. These natural systems motivate investigating the use of artificial swarms to automate construction or fabrication. The goal is to be able to take an unspecified number of simple robots and a supply of building material, give the system a high-level specification for any arbitrary structure desired, and have a guarantee that it will produce that structure without further intervention. In this thesis I describe such a distributed system for automating construction, in which autonomous mobile robots collectively build user-specified structures from square building blocks. The approach preserves many desirable features of the natural systems, such as considerable parallelism and robustness to factors like robot loss and variable order or timing of actions. Further, unlike insect colonies, it can build particular desired structures according to a high-level design provided by the user. Robots in this system act without explicit communication or cooperation, instead using the partially completed structure to coordinate their actions. This mechanism is analogous to that of stigmergy used by social insects, in which insects take actions that affect the environment, and the environmental state influences further actions. I introduce a framework of extended stigmergy in which building blocks are allowed to store, process or communicate information. Increasing the capabilities of the building material (rather than of the robots) in this way increases the availability of nonlocal structure information. Benefits include significant improvements in construction speed and in ability to take advantage of the parallelism of the swarm. This dissertation describes system design and control rules for decentralized teams of robots that provably build arbitrary solid structures in two dimensions. I present, a hardware prototype, and discuss extensions to more general structures, including those built with multiple block types and in three dimensions. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Dynamics modeling of microbeams under electrostatic load
Authors: E. Brusa, F. De Bona, A. Gugliotta, A. Soma
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This paper investigates the features of different techniques to model the dynamic behaviour of microbeams electrostatically actuated to identify the frequency shifting due to the electromechanical coupling. A first model with a single degree of freedom of double clamped microbeam is investigated: the analytic solution of the linearized equation of motion is compared to the numerical one of the nonlinear problem, solved by the Newmark method. FEM models are then introduced and compared to Newmark numerical integrations. A new procedure for a fast estimation of the frequency has been developed: a parabolic curve (frequency vs. voltage) approximates the actual characteristic by means of two interpolation points, corresponding to the steady-state frequency (pure mechanical actuation) and to a generic voltage, for which the Newmark method is applied once.
Adaptive power-line disturbance detection scheme using a prediction error filter and a stop-and-go CA CFAR detector
Authors: Jaehak Chung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents a new power-line disturbance detection algorithm. The utilized recursive least square (RLS) prediction error filter extracts the power-line disturbance signal from recorded data, and the modified stop-and-go cell average constant false alarm rate (CA CFAR) detector makes a decision based on the squared output of the previous stage. The detection performance of the proposed algorithm is determined by simulations, and actual high voltage transmission line data is utilized to demonstrate the performance of the proposed algorithm.
Higher-order concurrent Win32 programming
Authors: Riccardo Pucella
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

We present a concurrent framework for Win32 programming based on Concurrent ML, a concurrent language with higher-order functions, static typing, lightweight threads and synchronous communication channels. The key points of the framework are the move from an event loop model to a threaded model for the processing of window messages, and the decoupling of controls notifications from the system messages. This last point allows us to derive a general way of writing controls that leads to easy composition, and can accommodate ActiveX Controls in a transparent way.
Research on Real Time Computer Simulation System of Urban Logistics Distribution Vehicle Routing Optimization Based on GIS
Authors: Hongchun Hu, Yaohua Wu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Based on GIS as the main carrier, our real time computer simulation system of urban logistics distribution vehicle routing optimization precisely measures and marks the information of distribution site, providing true and available information for routing optimization, performing low cost and highly efficient operation on vehicle scheduling by the distribution center through optimization algorithm. The system can satisfy the demand of urban logistics distribution routing optimization under the multi-constraints condition of variable distribution cites and complex urban roads by simulating numerous distribution cites up to scores of thousands according to different plans and different regions and counting the information of vehicle routing and loading by different plans for contrast analysis so as to adjust and optimize the distribution routing, regions, period and vehicles in order to accomplish the equilibrium distribution and management of many relevant indexes such as vehicle load capacity, distribution work capacity and distribution time.
Real-Time Commercial Recognition Using Color Moments and Hashing
Authors: Abhishek Shivadas, John M. Gauch
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper, our focus is on real-time commercial recognition. In particular, our goal is to correctly identify all commercials that are stored in our commercial database within the first second of their broadcast. To meet this objective, we make use of 27 color moments to characterize the content of every video frame. This representation is much more compact than most color histogram representations, and it less sensitive to noise and other distortion. We use framelevel hashing with subsequent matching of moment vectors and video frames to perform commercial recognition. Hashing provides constant time access to millions of video frames, so this approach can perform in real-time for databases containing thousands of commercials. In our experiments with a database of 63 commercials, we achieved 96% recall, 100% precision, and 98% utility while recognizing commercials within the first 1/2 second of their broadcast.
Self-concordant functions for optimization on smooth manifolds
Authors: Danchi Jiang, John B. Moore, Huibo Ji
Venue: Journal of Global Optimization (2007)

This paper discusses self-concordant functions on smooth manifolds. In Euclidean space, such functions are utilized extensively as barrier functions in interior-point methods for polynomial time optimization algorithms. Here, the self-concordant function is carefully defined on a differential manifold in such a way that the properties of self-concordant functions in Euclidean space are preserved. A Newton decrement is defined and analyzed for this class of functions. Based on this, a damped Newton algorithm is proposed for the optimization of self-concordant functions. Under reasonable technical assumptions such as geodesic completeness of the manifold, this algorithm is guaranteed to fall in any given small neighborhood of the optimal solution in a finite number of steps. The existence and uniqueness of the optimal solution is also proved in this paper. Hence, the optimal solution is a global one. Furthermore, it ensures a quadratic convergence within a neighborhood of the minimal point. This neighborhood can be specified in terms of the Newton decrement. The computational complexity bound of the proposed approach is also given explicitly. This complexity bound is shown to be of the order $$O(-{\rm ln}(\epsilon)),$$ where $$\epsilon$$ is the desired precision. Some interesting optimization problems are given to illustrate the proposed concept and algorithm.
Java transactions for the internet
Authors: M. C. Little, S. K. Shrivastava
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

The Web frequently suffers from failures which affect the performance and consistency of applications run over it. An important fault-tolerance technique is the use of atomic transactions for controlling operations on services. While it has been possible to make server-side Web applications transactional, browsers typically did not possess such facilities. However, with the advent of Java it is now possible to consider empowering browsers so that they can fully participate within transactional applications. In this paper we present the design and implementation of a standards compliant transactional toolkit for the Web. The toolkit allows transactional applications to span Web browsers and servers and supports application specific customisation, so that an application can be made transactional without compromising the security policies operational at browsers and servers.
Message from the General Chairs
Authors: J. B. Lyles, A. Watters
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Summary form only given. The Internet has grown enormously over the last decade and has become ubiquitous. Most past research has focused on improving the performance and scalability of the Internet. The issue of securing the Internet has become a central issue due to a series of attacks that shut down some of the world's most high profile Web sites. Moreover, the growing concerns for cyber terrorism have made governments and researchers realize the importance of Internet security. Securing the Internet, as in any other field of computers, is based on the principle of confidentiality and integrity. This principle exists in every field, but the presence of packet sniffers, malicious routers, covert channels, eavesdroppers, denial-of-service (DoS) in the Internet makes this problem quite challenging. There has been a surge of Internet security research in the field of information assurance, which primarily focused on protecting the data using techniques such as authentication and encryption. However, information assurance assumes that the devices responsible for encrypting, forwarding and sending are trustworthy. Researchers are now questioning these assumptions, as instances have occurred where the network infrastructure (e.g., routers, servers) is compromised to the advantage of the malicious adversaries. Therefore, Internet infrastructure security is the need of the hour.
Code-length-based universal extraction for blind signal separation
Authors: G. C. Orsak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We propose a blind signal separation algorithm (CLUE) that uses the sum of the individual code lengths of the extracted signals as a measure of the separation performance. The new technique combines a widely-available universal data compression routine with any single-parameter search procedure. Unlike previous approaches, the proposed method is model-free and does not rely on the moment values of the signals for its separation performance. An example shows the algorithm's efficiency in separating mixtures of image, audio, and text data.
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
Authors: Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Krishnamurthy
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with scheduling based on heuristics to alleviate network performance degradation due to excessive collisions and retransmissions. In particular, by utilizing local information about sensor neighbors, our protocols minimize collisions in areas with high channel contention. The simulation results of our hybrid techniques show improved performance of data delivery and reduced energy consumption compared to carrier-sensing based IEEE 802.15.4 CAP mode and time-division based DRAND.
Dynamically regularized fast RLS with application to echo cancellation
Authors: S. L. Gay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper introduces a dynamically regularized fast recursive least squares (DR-FRLS) adaptive filtering algorithm. Numerically stabilized FRLS algorithms exhibit reliable and fast convergence with low complexity even when the excitation signal is highly self-correlated. FRLS still suffers from instability, however, when the condition number of the implicit excitation sample covariance matrix is very high. DR-FRLS, overcomes this problem with a regularization process which only increases the computational complexity by 50%. The benefits of regularization include: (1) the ability to use small forgetting factors resulting in improved tracking ability and (2) better convergence over the standard regularization technique of noise injection. Also, DR-FRLS allows the degree of regularization to be modified quickly without restarting the algorithm. The application of DR-FRLS to stabilizing the fast affine projection (FAR) algorithm is also discussed.
Statistical debugging using compound boolean predicates
Authors: Piramanayagam Arumuga Nainar, Ting Chen, Jake Rosin, Ben Liblit
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Statistical debugging uses dynamic instrumentation and machine learning to identify predicates on program state that are strongly predictive of program failure. Prior approaches have only considered simple, atomic predicates such as the directions of branches or the return values of function calls. We enrich the predicate vocabulary by adding complex Boolean formulae derived from these simple predicates. We draw upon three-valued logic, static program structure, and statistical estimation techniques to efficiently sift through large numbers of candidate Boolean predicate formulae. We present qualitative and quantitative evidence that complex predicates are practical, precise, and informative. Furthermore, we demonstrate that our approach is robust in the face of incomplete data provided by the sparse random sampling that typifies postdeployment statistical debugging.
Design Guidelines for an Internet-Scaled QoS Framework
Authors: Alessandro Sorniotti, Gabriele Corliano, Alan P. Smith
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Adding Quality of Service support to the best-effort Internet is something that has been suggested and researched for a long time now. While individual networks are starting to offer QoS, it remains as elusive as ever for the Internet as a whole. A number of different QoS solutions are being deployed within networks leading to a highly heterogeneous Internet. On the other hand, there are a number of proposed standards that try to solve such great heterogeneity with fully-tailored architectures. The thesis of this paper is that heterogeneity should not be fought; instead, tussles will eventually arise among different approaches and these should be the vector towards evolution and hence must be allowed as part of the design. Each domain should be free to make its own internal choices on how to deliver QoS, while presenting a common interface. The problem then becomes the coordination of the decisions of different domains. The design of such a framework presents several key choices, which will be investigated.
Emergent Vulnerability in Integrated Operations: A Proactive Simulation Study of Risk and Organizational Learning
Authors: Eliot Rich, Finn Olav Sveen, Ying Qian, Stefanie A. Hillen, Jaziar Radianti, Jose J. Gonzalez
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The implementation of Integrated Operations (IO) for oil and gas recovery -- a real-time linkage among platform-based facilities, on-shore control centers and suppliers -- is anticipated to reduce operating costs by 30%, extend the lifetime of current production fields by five years or longer and maintain Norwegian Continental Shelf production for 50-100 years. The changes in operating procedures require extensive training to ensure continued personal and environmental safety. Vulnerabilities may emerge during the rollout of updated techniques and integration of IO technology with existing work practices. We focus on user knowledge as key to successful change. A system dynamics simulation is presented that defines work process and knowledge transition. Interviews and historical records assisted in parameterizing the model. The simulation suggests that great care should be taken to facilitate and monitor the rate of knowledge maturation, even in the face of expensive implementation delays, to reduce the risk of catastrophic failure from endemic incidents.