ppxscal/embedding_network huggingface dataset:
Non-Rigid Multi-Modal Image Registration Using Cross-Cumulative Residual Entropy
Authors: Fei Wang, Baba C. Vemuri
Venue: International Journal of Computer Vision (2007)

In this paper we present a new approach for the non-rigid registration of multi-modality images. Our approach is based on an information theoretic measure called the cumulative residual entropy (CRE), which is a measure of entropy defined using cumulative distributions. Cross-CRE between two images to be registered is defined and maximized over the space of smooth and unknown non-rigid transformations. For efficient and robust computation of the non-rigid deformations, a tri-cubic B-spline based representation of the deformation function is used. The key strengths of combining CCRE with the tri-cubic B-spline representation in addressing the non-rigid registration problem are that, not only do we achieve the robustness due to the nature of the CCRE measure, we also achieve computational efficiency in estimating the non-rigid registration. The salient features of our algorithm are: (i) it accommodates images to be registered of varying contrast+brightness, (ii) faster convergence speed compared to other information theory-based measures used for non-rigid registration in literature, (iii) analytic computation of the gradient of CCRE with respect to the non-rigid registration parameters to achieve efficient and accurate registration, (iv) it is well suited for situations where the source and the target images have field of views with large non-overlapping regions. We demonstrate these strengths via experiments on synthesized and real image data.
Pure Current-Mode Frequency Filter for Signal Processing in High-Speed Data Communication
Authors: Jaroslav Koton, Kamil Vrba
Venue: Proceedings of the Second International Conference on Systems (2007)

Although the amount of equipment working in digital form is growing, it is still necessary to use analog circuits as an interface between the real world and the digitized one. Because the frequency of processed signals in the digital part increases constantly, the analog part must also be able to work in higher frequency bands. In this paper circuits working in the current-mode are described, which fulfill the conditions of new telecommunication technologies. A third-order low-pass frequency filter is described, which can be used for signal processing in industrial data networks or data buses working in the current-mode developed for automotive industry or for medical equipment.
Brazos: a third generation DSM system
Authors: Evan Speight, John K. Bennett
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

Brazos is a third generation distributed shared memory (DSM) system designed for x86 machines running Microsoft Windows NT 4.0. Brazos is unique among existing systems in its use of selective multicast, a software-only implementation of scope consistency, and several adaptive runtime performance tuning mechanisms. The Brazos runtime system is multithreaded, allowing the overlap of computation with the long communication latencies typically associated with software DSM systems. Brazos also supports multithreaded user-code execution, allowing programs to take advantage of the local tightly-coupled shared memory available on multiprocessor PC servers, while transparently interacting with remote "virtual" shared memory. Brazos currently runs on a cluster of Compaq Proliant 1500 multiprocessor servers connected by a 100 Mbps FastEthernet. This paper describes the Brazos design and implementation, and compares its performance running five scientific applications to the performance of Solaris and Windows NT implementations of the TreadMarks DSM system running on the same hardware.
Worst Case Response Time Analysis of Sporadic Task Graphs with EDF Non-preemptive Scheduling on a Uniprocessor
Authors: Huixue Zhao, Laurent George, Serge Midonnet
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

This paper considers the problem of non-preemptive hard real-time scheduling of sporadic task graphs on a uniprocessor with Earliest Deadline First (EDF) scheduling. A sporadic task graph associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response times of any subtask of a task graph. We investigate the late deadline constraint.
Arbitrary cutting of deformable tetrahedralized objects
Authors: Eftychios Sifakis, Kevin G. Der, Ronald Fedkiw
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

We propose a flexible geometric algorithm for placing arbitrary cracks and incisions on tetrahedralized deformable objects. Although techniques based on remeshing can also accommodate arbitrary fracture patterns, this flexibility comes at the risk of creating sliver elements leading to models that are inappropriate for subsequent simulation. Furthermore, interactive applications such as virtual surgery simulation require both a relatively low resolution mesh for efficient simulation of elastic deformation and highly detailed surface geometry to facilitate accurate manipulation and cut placement. Thus, we embed a high resolution material boundary mesh into a coarser tetrahedral mesh using our cutting algorithm as a meshing tool, obtaining meshes that can be efficiently simulated while preserving surface detail. Our algorithm is similar to the virtual node algorithm in that we avoid sliver elements and their associated stringent timestep restrictions, but it is significantly more general allowing for the arbitrary cutting of existing cuts, sub-tetrahedron resolution (e.g. we cut a single tetrahedron into over a thousand pieces), progressive introduction of cuts while the object is deforming, and moreover the ability to accurately cut the high resolution embedded mesh.
Accurate Evaluation of European and American Options Under the CGMY Process
Authors: Ariel Almendral, Cornelis W. Oosterlee
Venue: SIAM Journal on Scientific Computing (2007)

A finite-difference method for integro-differential equations arising from Le&acute;vy driven asset processes in finance is discussed. The equations are discretized in space by the collocation method and in time by an explicit backward differentiation formula. The discretization is shown to be second-order accurate for a relevant parameter range determining the degree of the singularity in the Le&acute;vy measure. The singularity is dealt with by means of an integration by parts technique. An application of the fast Fourier transform gives the overall amount of work $O(N_t N\log N)$, rendering the method fast.
A Tcl to C compiler
Authors: Forest R. Rouse, Wayne Christopher
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

A Tcl compiler is described, which accepts Tcl code and generates C code as ouput. Each Tcl proc is converted into a C function that can be called as a Tcl command. This code is then compiled and linked with a special libtcl.a to create an executable. This compiler has passed all the Tcl tests, and has provided a speedup for realistic computationally-intensive applications between a factor of 5 and 10, and for simpler benchmarks up to a factor of 20. In this paper, we will discuss the compiler and the issues involved with compiling Tcl code, including suggestions for future changes to the language.
NewsMe: A Case Study for Adaptive News Systems with Open User Model
Authors: Chirayu Wongchokprasitti, Peter Brusilovsky
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Adaptive news systems have become important in recent years. A lot of work has been put into developing these adaptation processes. We describe here an adaptive news system application, which uses an open user model and allow users to manipulate their interest profiles. We also present a study of the system. Our results showed that user profile manipulation should be used with caution.
Non-minimum phase inverse filter methods for immersive audio rendering
Authors: A. Mouchtaris
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Immersive audio systems are being envisioned for applications that include teleconferencing and telepresence; augmented and virtual reality for manufacturing and entertainment; air traffic control, pilot warning, and guidance systems; displays for the visually-impaired; distance learning; and professional sound and picture editing for television and film. The principal function of such systems is to synthesize, manipulate and render sound fields in real time. In this paper we examine several signal processing considerations in spatial sound rendering over loudspeakers. We propose two methods that can be used to implement the necessary filters for generating virtual sound sources based on synthetic head-related transfer functions with the same spectral characteristics as those of the real source.
Rank Theorems for Forward Secrecy in Group Key Management Protocols
Authors: Amjad Gawanmeh, Sofiene Tahar
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

Design and verification of cryptographic protocols has been under investigation for quite sometime. However, little has been done for the class of protocols that deals with group key management and distribution, and have special security properties, such as forward secrecy. In this paper, we define a formal model and establish rank theorems for forward properties based on a set of generic formal specification requirements for group key management and distribution protocols. Rank theorems imply the validity of the security property to be proved, and are deducted from a set of rank functions we define over the protocol. The above formalizations and rank theorems were implemented using the PVS theorem prover. We illustrate our approach on the verification of forward secrecy for the Enclaves protocol designed at SRI.
Hierarchization of a priori defined dataflow subgraphs
Authors: M. Willems
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

DSP algorithms are frequently represented by dataflow graphs. These graphs serve as an abstract input specification for an implementation, either in software or hardware. While doing so, the transformation process might require a special treatment of specific subgraphs within the complete dataflow graph. A hierarchization of a subgraph appears as a replacement of the subgraph by a single vertex, representing the same functionality. The subgraph to be hierarchized might be defined by the designer manually or identified automatically, matching certain criterions. Because of the possibility of introducing a deadlock, not every hierarchization is valid. This paper presents an approach that allows to identity such deadlocking subgraphs. If an a priori defined subgraph is identified to result in a deadlock, a concept is presented that allows one to separate the subgraph into sub-subgraphs of maximum size. This allows to apply the special treatment to these sub-subgraphs and not to cancel it completely.
Multi-Resolution-Analysis Scheme for Uncertainty Quantification in Chemical Systems
Authors: O. P. Le Mai&circ;tre, H. N. Najm, P. P. Pe´bay, R. G. Ghanem, O. M. Knio
Venue: SIAM Journal on Scientific Computing (2007)

This paper presents a multi-resolution approach for the propagation of parametric uncertainty in chemical systems. It is motivated by previous studies where Galerkin formulations of Wiener-Hermite expansions were found to fail in the presence of steep dependences of the species concentrations with regard to the reaction rates. The multi-resolution scheme is based on representation of the uncertain concentration in terms of compact polynomial multi-wavelets, allowing for the control of the convergence in terms of polynomial order and resolution level. The resulting representation is shown to greatly improve the robustness of the Galerkin procedure in presence of steep dependences. However, this improvement comes with a higher computational cost which drastically increases with the number of uncertain reaction rates. To overcome this drawback an adaptive strategy is proposed to control locally (in the parameter space) and in time the resolution level. The efficiency of the method is demonstrated for an uncertain chemical system having eight random parameters.
Enabling Adaptive Service Access Management for Next Generation Mult-Service Networks
Authors: Monique Calisti, Dominic Greenwood
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This paper describes the Living Systems Adaptive Service Management, LS/ASM, Suite, an innovative and comprehensive middleware solution that assists operators with effectively delivering next-generation converged services by dynamically combining end-users and service-centric requirements with network-facing management and control functionality. The main goal is to discuss how a comprehensive policy-driven and autonomic solution such as the LS/ASM Suite, spanning basic infrastructures and end-user devices and building adaptive control functionality directly into the corresponding elements, enables the shift of focus from technology to value-added services.
An embedded HMM-based approach for face detection and recognition
Authors: A. V. Nefian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We describe an embedded hidden Markov model (HMM)-based approach for face detection and recognition that uses an efficient set of observation vectors obtained from the 2D-DCT coefficients. The embedded HMM can model the two dimensional data better than the one-dimensional HMM and is computationally less complex than the two-dimensional HMM. This model is appropriate for face images since it exploits an important facial characteristic: frontal faces preserve the same structure of "super states" from top to bottom, and also the same left-to-right structure of "states" inside each of these "super states".
Intelligent Scheduling and Replication in Datagrids: a Synergistic Approach
Authors: Ali Elghirani, Riky Subrata, Albert Y. Zomaya
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In large-scale data-intensive applications data plays a pivotal role in the execution of these applications, and data transfer is the primary cause of job execution delay. In environments such as the data grids with the need to execute jobs requiring large amounts of data, a smart collaborative environment between the scheduling and data management services to achieve a synergistic effect on the performance of the grid becomes essential. This paper presents an intelligent data grid framework where job scheduling and data and replica management are coupled to provide an integrated environment for efficient access to data and job scheduling. The data management service predicts and estimates the appropriate locations of replica and proactively replicates the datasets in these locations while the intelligent Tabu Search based scheduler incorporating information about the datasets dispatches the jobs to the sites guaranteeing minimum job execution time and better overall system utilization. Evaluation of the framework shows significant improvement in the performance of the grid and job execution time.
Design and implementation of firewire device driver on FreeBSD
Authors: Katsushi Kobayashi
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

A Firewire device driver has been implemented on FreeBSD system. The driver provides IP network stack, native socket system interface, and stream device interface such as a DV video. The device driver shows enough performance on the IP over Firewire environment at 30Mbps. Also, DV video communication application using IP has been developed with the device driver and it enebles DV quality communication between US and Japan only with the consumer market products.
PACE: Augmenting Personal Mobile Devices with Scalable Computing
Authors: Xun Luo
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In the near future personal mobile devices will become ingredients of the grid. Foreseeing this, the thesis work aims at leveraging scalable computing techniques to enhance mobile devices so that their interoperability with peers and grid infrastructure will be improved, and their unique resources could be better contributed to the grid. A middleware framework named Personal Augmented Computing Environment (PACE) is proposed, the research progress is reported, and future plan is introduced. The main contributions include 1) investigation of collaborative visualization using display clusters composed by mobile devices, 2) exploration of contextaware methods for mobile devices to achieve efficient utilization of peer and grid resources, and 3) development of novel scalable human-computer interaction techniques through seamless integration of mobile devices and environmental infrastructures.
An Observational Study of Voters on the Internet
Authors: Scott P. Robertson, Christine E. Wania, S. Joon Park
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Voters in a democracy have the responsibility to learn about the candidates and issues on which they are deciding. The internet offers voters unparalleled opportunities for finding information relevant to elections. Use of the internet for politics is increasing dramatically, yet we know little about the details of what people are doing with it. We describe an observational think-aloud study of people using the internet in a mock-voting situation. Our voters were primarily opportunistic browsers following a noncompensatory search strategy who engaged in simultaneous searching, reading, evaluating, and deciding. Based on our results, we offer ideas for the design of a voter portal.
Certificate revocation and certificate update
Authors: Moni Naor, Kobbi Nissim
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

A new solution is suggested for the problem of certificate revocation. This solution represents Certificate Revocation Lists by an authenticated search data structure. The process of verifying whether a certificate is in the list or not, as well as updating the list, is made very efficient. The suggested solution gains in scalability, communication costs, robustness to parameter changes and update rate. Comparisons to the following solutions are included: 'traditional' CRLs (Certificate Revocation Lists), Micali's Certificate Revocation System (CRS) and Kocher's Certificate Revocation Trees (CRT). Finally, a scenario in which certificates are not revoked, but frequently issued for short-term periods is considered. Based on the authenticated search data structure scheme, a certificate update scheme is presented in which all certificates are updated by a common message. The suggested solutions for certificate revocation and certificate update problems is better than current solutions with respect to communication costs, update rate, and robustness to changes in parameters and is compatible e.g. with X.500 certificates.
On the complexity of managing probabilistic XML data
Authors: Pierre Senellart, Serge Abiteboul
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees where nodes are annotated with conjunctions of probabilistic event variables. We briefly described an implementation and scenarios of usage. We develop here a mathematical foundation for this model. In particular, we present complexity results. We identify a very large class of queries for which simple variations of querying and updating algorithms from [3] compute the correct answer. A main contribution is a full complexity analysis of queries and updates. We also exhibit a decision procedure for the equivalence of probabilistic trees and prove it is in co-RP. Furthermore, we study the issue of removing less probable possible worlds, and that of validating a probabilistic tree against a DTD. We show that these two problems are intractable in the most general case.
A very fast TS/SA algorithm for the job shop scheduling problem
Authors: Chao Yong Zhang, PeiGen Li, YunQing Rao, ZaiLin Guan
Venue: Computers and Operations Research (2008)

The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-complete optimization problems. Over the last 10-15 years, tabu search (TS) has emerged as an effective algorithmic approach for the JSP. However, the quality of solutions found by tabu search approach depends on the initial solution. To overcome this problem and provide a robust and efficient methodology for the JSP, the heuristics search approach combining simulated annealing (SA) and TS strategy is developed. The main principle of this approach is that SA is used to find the elite solutions inside big valley (BV) so that TS can re-intensify search from the promising solutions. This hybrid algorithm is tested on the standard benchmark sets and compared with the other approaches. The computational results show that the proposed algorithm could obtain the high-quality solutions within reasonable computing times. For example, 17 new upper bounds among the unsolved problems are found in a short time.
A Security Framework in RFID Multi-domain System
Authors: Dong Seong Kim, Taek-Hyun Shin, Jong Sou Park
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In previous approaches, it's generally assumed that all Radio Frequency Identification (RFID) tags belong to a single RFID domain system (we name this as RFID single domain system). To date, most researches in the RFID single domain system have been on authentication protocols against a variety of attacks. This paper considers the security and privacy problems regarding that RFID tags used by different two or more RFID domains (we name this as RFID multi-domain system). We divided the security and privacy mechanisms in RFID multi-domain system into 3 conceptual parts: RFID forehand system security, RFID backend system security, and RFID inter-domain system security. First, we review RFID forehand and backend system security issues. Second, we present a security framework in RFID multi-domain system. Third, we propose and evaluate authentication and authorization for RFID inter-domain system with a case study.