ppxscal/embedding_network huggingface dataset:
Accurate timing analysis using SAT and pattern-dependent delay models
Authors: D. Tadesse, D. Sheffield, E. Lenge, R. I. Bahar, J. Grodstein
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Accurate delay modeling beyond static models is critical to garnering better correlation with post-silicon analysis. Furthermore, post-silicon timing validation requires a pattern-dependent timing model to generate patterns. To address these issues, we propose a timing analysis tool that integrates a data-dependent delay model into its analysis. Our approach solves for the delay by using the concept of circuit unrolling and formulation of timing questions as decision problems for input into a SAT solver. The effectivness and validity of the proposed methodology is illustrated through experiments on benchmark circuits.
A Routing Based Service Discovery Protocol for Ad hoc Networks
Authors: Abdel Obaid, Azeddine Khir, Hafedh Mili
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper, we describe a strategy for service discovery and publication coupled with routing protocols. We propose a new protocol for services discovery called SEDIRAN (Service Discovery and Interaction with Routing protocols in Ad hoc Networks), on top of a reactive routing protocol, namely, AODV (Ad hoc On demand Distance Vector). However, we think that our protocol can be easily generalized to other reactive routing protocols.
Learning grammars with a modified classifier system
Authors: W. Cyre
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes a modified learning classifier system for evolving grammars from small, handcrafted grammars. The algorithm uses distinct discovery and evaluation steps, and a culling step to reduce ambiguity. It performs surprisingly well in developing grammars for very complex sentences in a restricted domain of English, and in some experiments the grammar's competence improved up to tenfold.
Approximate solution of a class of singular integral equations of second kind
Authors: B. N. Mandal, G. H. Bera
Venue: Journal of Computational and Applied Mathematics (2007)

A simple method based on polynomial approximation of a function is employed to obtain approximate solution of a class of singular integral equations of the second kind. For a hypersingular integral equation of the second kind, this method avoids the complex function-theoretic method and produces the known exact solution to Prandtl's integral equation as a special case. For a particular singular integro-differential equation of the second kind, this also produces an approximate solution which compares favourably with numerical results obtained by various Galerkin methods. The convergence of the method for both the equations is also established.
An Evaluation of Popular Search Engines on Finding Turkish Documents
Authors: Rabia Gulcin Demirci, Vildan Kismir, Yiltan Bitirim
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

This article investigates the information retrieval performance of popular search engines on finding Turkish documents. First of all, five popular search engines (Google, Yahoo, Msn, AlltheWeb and Ask) and a list of Turkish queries are determined. Each query is run on each search engine one by one and first twenty documents on each retrieval output are evaluated as being "relevant' and "non-relevant'. Then, for evaluation of search engines precision and normalized recall ratios are calculated at various cut-off points for each query and search engine. Furthermore, the results are used to make comparison of the search engines with local search engines. Overall, Google appears to be the best search engine in terms of average precision (73%) and normalized recall ratios (66%), on finding Turkish documents. However, local search engines have lower information retrieval performance to finding Turkish documents and need more improvement than international search engines.
Robust learning algorithms for nonlinear filtering
Authors: D. Neumerkel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A nonlinear adaptive filter for use in steel mill applications is described. This filter takes the form of a generalised regression network and is used to remove eccentricities from a steel mill force signal. Online adaptation is achieved by means of standard recursive parameter update algorithms suitable for linear regression type models. It is demonstrated that second order methods can lead to severe parameter biasing effects and a more serious effect known as bursting, whereby the parameter estimation becomes numerically unstable. This paper discusses the above effects form a theoretical and practical viewpoint, and considers the suitability of several learning algorithms for the eccentricity filtering application. This analysis leads to a numerically robust filtering structure, the efficacy of which is demonstrated by means of results from a real steel rolling mill.
Structured least squares to improve the performance of ESPRIT-type high-resolution techniques
Authors: M. Haardt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

ESPRIT type high-resolution (spatial) frequency estimation techniques, like standard ESPRIT, state space methods, matrix pencil methods, or Unitary ESPRIT, obtain their (spatial) frequency estimates from the solution of a highly-structured, overdetermined system of equations. Here, the structure is defined in terms of two selection matrices applied to a matrix spanning the estimated signal subspace. Structured least squares (SLS) is a new algorithm to solve this overdetermined system, the so called invariance equation, by preserving its structure. Simulations confirm that SLS outperforms the least squares (LS) and total least squares (TLS) solutions of this invariance equation, since the accuracy of the resulting (spatial) frequency estimates and the accuracy of the underlying signal subspace are improved significantly. Furthermore, SLS can be used to improve the accuracy of adaptive frequency estimating schemes that are based on fast adaptive subspace tracking techniques. Moreover, SLS has been extended to the two-dimensional (2-D) case to be used in conjunction with 2-D Unitary ESPRIT, an efficient ESPRIT-type algorithm that provides automatically paired 2-D (spatial) frequency estimates.
Vision-based three-dimensional navigation for an autonomous helicopter
Authors: Gaurav Sukhatme
Venue:  (2006)

We address the 3D navigation problem for an Unmanned Aerial Vehicle (UAV) through urban environments, specifically an autonomous robotic helicopter. In doing so, we investigate techniques which would allow a UAV to perform two kinds of navigation: safe wandering and path planning based on a partially accurate world model, with dynamic replanning as unmodeled obstacles are detected. Typically UAVs operate at high altitudes where obstacle avoidance is not needed. This limits the applications they can be used for. A UAV capable of safe wandering through an urban environment could perform tasks such as exploration, mapping and Urban Search and Rescue. To perform safe wandering, the UAV would need to detect and avoid obstacles in real-time. Having the ability to plan a path through an urban environment would allow a UAV to perform tasks such as package delivery, surveillance and patrolling. In developing these capabilities, we address obstacle avoidance, path planning, replanning, and system integration with a real helicopter. Although obstacle avoidance and path planning are well studied problems for ground-based robots operating in 2D, they are not well studied for integrated 3D problems such as the one proposed in this thesis. We present a novel vision-based obstacle avoidance technique combining optic flow and stereo vision. Through experiments we show that this combined technique produces more reliable safe wandering than either technique alone. Experiments on the real autonomous helicopter show that optic flow can be used to avoid obstacles to the side, and that stereo vision can be used to avoid obstacles to the front. We investigate a number of factors that influence the performance of the optic flow-based centering response, including optimum camera angle, egomotion compensation, and control strategies. Through analytical and empirical investigations, we show the optimum camera angle is 45 degrees. We address the path planning problem by implementing a Probabilistic Roadmap path-planner, and assume a partially accurate 3D model of the environment is available (implying the need for dynamic replanning). We show 3D path planning in a simulation environment, including dynamic replanning when unmodeled obstacles are detected using stereo vision.
A scheduling scheme for network saturated NT multiprocessors
Authors: Jørgen Sværke Hansen, Eric Jul
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

The use of high performance networking technologies, e.g., ATM networks, demands much from both operating systems and processors. During high network loads, user threads may be starved because the processor spends all its time handling interrupts. To alleviate this problem, we propose using a two level network interface servicing scheme that uses interrupts during low network loads to provide low latency, and polling threads during high network loads to avoid user thread starvation. In this paper, we examine the use of such a scheme on dual-processor workstations running Windows NT connected by an ATM network. Performance evaluation of our multiprocessor prototype implementation shows that using our two level scheme can improve performance when used carefully.
Conflict Managers for Self-stabilization without Fairness Assumption
Authors: Maria Gradinariu, Sebastien Tixeuil
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two nodes that are in conflict cannot enter their critical section simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of self-stabilizing algorithms that operate in an essentially sequential model, into selfstabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer requires initial symmetry breaking but preserves the original algorithm guarantees.
Performance and Reliability of the Multistage Bus Network
Authors: Laxmi N. Bhuyan, Ashwini K. Nanda, Tahsin Askar
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

A Multistage Bus Network(MBN) has been proposed as a viable alternative to the existing interconnection networks. The MBN consists of multiple stages of buses connected in a manner similar to the conventional Multistage Interconnection Networks(MINs) and has the same bandwidth at each stage. Due to the bidirectional nature of the MBN, there exist a number of separate paths between any source and destination pair. Some paths make a U-turn at an intermediate stage switch which is a common ancestor of the source and destination. We present self routing techniques for the various paths. We also present a performance analysis of a synchronous packet switched MBN and compare the results with those of a MIN. Finally we present a reliability analysis of the MBN and show its superiority over the MIN.
Robust packet image transmission by wavelet coefficient dispersement
Authors: T. Frajka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a packetization method for robust image transmission over packet erasure channels. The packets are formed in such a way that the image information is spread over different frequency bands and spatial locations to avoid complete disruption of certain image blocks in case of a packet loss. Experimental results are provided to demonstrate the performance of this method.
Dynamic subgrouping in RTRL provides a faster O(N/sup 2/) algorithm
Authors: N. R. Euliano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Static grouping of processing elements (PEs) has been proposed to reduce the computational complexity of real time recurrent learning (RTRL) from O(n/sup 4/) to O(n/sup 2/), but performance suffers. This paper proposes a dynamic subgrouping of PEs estimated from a local approximation of the /spl pi/ matrix based on temporal Hebbian of sensitivities during training. The method is O(n/sup 2/) and leads to better performance.
Analyzing cooperative containment of fast scanning worms
Authors: Jayanthkumar Kannan, Lakshminarayanan Subramanian, Ion Stoica, Randy H. Katz
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

Fast scanning worms, that can infect nearly the entire vulnerable population in order of minutes, are among the most serious threats to the Internet today. In this work, we investigate the efficacy of cooperation among Internet firewalls in containing such worms. We first propose a model for firewall-level cooperation and then study the containment in our model of cooperation using analysis and simulation. Our results suggest that, with moderate overhead, cooperation among Internet firewalls can provide 95% containment under 10% deployment while being resilient to 100-1000 malicious firewalls.
A Point-Based Rendering Approach for Mobile Devices
Authors: Zhiying He, Xiaohui Liang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

It is a challenging task to provide real-time, realistic 3D graphics on mobile devices like PDAs, Smart phones, etc. for resource constraints. Considering the mobile devices are lack of powerful 3D graphics hardware support, in this paper we present a point-based rendering of 3D models--that is, getting regular sampling points in 3D space and then projecting all the sampling points to the screen by splatting. It has better performance results and can represent various information of object. It also has optimal rendering throughput.
Input-dependent neural network trained by real-coded genetic algorithm and its industrial applications
Authors: S. H. Ling, F. H. F. Leung, H. K. Lam
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

This paper presents an input-dependent neural network (IDNN) with variable parameters. The parameters of the neurons in the hidden nodes adapt to changes of the input environment, so that different test input sets separately distributed in a large domain can be tackled after training. Effectively, there are different individual neural networks for different sets of inputs. The proposed network exhibits a better learning and generalization ability than the traditional one. An improved real-coded genetic algorithm (RCGA) Ling and Leung (Soft Comput 11(1):7&#x2013;31, 2007) is proposed to train the network parameters. Industrial applications on short-term load forecasting and hand-written graffiti recognition will be presented to verify and illustrate the improvement.
What Motivates Voluntary Engagement in Cooperative Information Systems
Authors: James B. Freedman
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Firms invest heavily to develop on-line cooperative systems in the hope of creating unique value in the minds of their customers. However, when system use begins to decline, firms are faced with a major challenge: where should they invest to increase their customer's motivation to engage in the use of their system? This research applies empowerment theory to explore the factors that motivate persistent voluntary engagement with cooperative information systems.
Polyhedral simplification preserving character lines extracted from images
Authors: Minica Panchetti, Jean-Philippe Pernot, Philippe Veron
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

Visualisation, assembling/disassembling simulation, reverse engineering, or finite element analyses are so many applications where a polyhedral simplification can be mandatory. In most of the configurations, such an operation must preserve the significant shapes of the original model. This paper addresses the way these simplifications can be performed while preserving character lines, i.e. those lines which affect significantly the object visual appearance. The proposed simplification process is based on a vertex removal algorithm that uses a heterogeneous map of sizes computed with information extracted from 2D images of the object. The farther the vertices are from the character lines, the more the simplification is important. The geodesic distances are estimated while using a new algorithm based on the analysis of multiple filtering of the images. This method might reduce the computational time since there is no need to compute either the curvature or the saliency. Thus, a first attempt to enrich a polyhedral model with semantic information extracted from images is proposed.
Collaborative Agents Interaction Using Message Passing Interface
Authors: Gabriel Ciobanu
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

We describe a framework for coordinating multiple agents in the execution of a cooperative task. We work within a fair simulation environment which decides when the agents form a coalition. A multi-agent simulator environment is developed, and some experimental results are presented and discussed. The agents are modeled as non-deterministic finite automata based on predefined communication protocol. The coordination is based on exchanging status messages. We use a Linux cluster, and Message Passing Interface together with C programming language.
Execution Time Analysis of Aspectized Web Services
Authors: Muhammad Usman Bhatti, Samir Youcef, Lynda Mokdad, Valerie Monfort
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Service Oriented Computing (SOC) strives for applications having services as the fundamental element of design, and with Web services acting as the enabling technology. In an earlier work, we have empowered Web services with the concepts from Aspect Oriented Programming (AOP) to enhance their flexibility and adaptability. Software flexibility and its execution time to provide expected services are the fundamental requirements for our industrial context. Therefore, this paper presents a formal model for simulating and studying response time of aspectized Web services. By classifying these aspectized Web services according to their non-functional requirements, we intend to study the execution behavior for various classes of these services.
Kalman-filtering timing recovery scheme for orthogonal frequency domain multiplexing (OFDM) systems
Authors: M. Hajirostam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper describes a new technique for timing synchronization in orthogonal frequency domain multiplexing (OFDM) transceiver systems. The proposed technique is based on non-synchronized sampling rate and no pilot is required to be transmitted. Therefore the transmission capacity is increased. The proposed algorithm employs the angles of the received symbols in the OFDM subchannels and provides a computationally efficient technique for estimation of the timing error. An equivalent state space model is also derived for timing error and then Kalman filtering method is exploited for tracking purposes. The proposed technique is very robust, particularly under low signal to noise ratio conditions and has been verified by means of computer simulations.
Multi-resident AFS: an adventure in mass storage
Authors: Jonathan S. Goldick, Kathy Benninger, Christopher Kirby, Christopher Maher, Bill Zumach
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

The Pittsburgh Supercomputing Center has been working to integrate distributed file system technology with hierarchical mass storage. We produced a system utilizing the Andrew File System that can be interfaced to many mass storage systems. We retained the semantics of AFS and compatibility with standard clients and servers. The architecture has a logical separation between the facility that provides the user interface and access semantics and the management of the storage systems that contain user data. Support for file level replication is provided for high availability to data in a fashion that is transparent to users. This system is called Multi-Resident AFS.
Engineering workshops for K-12 schoolteachers
Authors: J. L. DeGrazia
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

K-12 teachers' professional development workshops providing educational content standards-based engineering curriculum are offered every summer at the College of Engineering and Applied Science's Integrated Teaching and Learning Laboratory on the CU-Boulder campus. A typical four-day workshop format engages teachers in mini-lectures and hands-on demonstrations, and integrates the design/build process. A written curriculum includes inquiry-based experiments to help the teachers be fully prepared to engage their students in active learning. Written feedback evaluations gauge the effectiveness and developmental appropriateness of all workshop materials. Practicing engineers and CU engineering faculty share their expertise with the participants and provide a real-world context for the academic content presented.
Integration of concurrency control in a language with subtyping and subclassing
Authors: Carlos Baquero, Rui Oliveira, Francisco Moura
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

This paper describes the integration of concurrency control in BALLOON, an object-oriented language that separates the concepts of type and class as well of subtyping and subclassing. Types are interface specifications enriched with concurrency control annotations. Classes are used to implement the operational functionality of types as well as concurrency control mechanisms. Types, classes and concurrency control annotations are independently reusable and derivable. The language takes advantage of this separation to solve the typical problems of the inheritance anomaly.