ppxscal/embedding_network huggingface dataset:
Moving meshes by the deformation method
Authors: Guojun Liao, Jiaxing Xue
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, we describe the deformation method for generation of moving meshes and its applications in computational fluid dynamics (CFD), and potential applications for image representation, segmentation, and landmark matching for image registration. We demonstrate that the deformation method can generate meshes of prescribed cell area. Numerical examples are presented to confirm that.
MDLP--The Resource Allocating Policy for Multi Divisible Loads in Heterogeneous Linear Networks
Authors: Hong Taoliu, Juan Yang, ZhiXing Huang, Yun Bai, YuHui Qiu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Reasonably allocating the resources to the tasks can effectively improve the concurrency ability of the distributed systems.In this paper, we propose a resource allocating policy --MDLP, for multi-divisible loads under heterogeneous linear system. MDLP model the optimizing problem of the divisible loads into a linear programming problem. At the same time, the finish time of the previous loads is no longer need to used to compute the current load's distribution.
Edge Enhancement Color Halftoning by Using Human Visual Characteristics
Authors: Nae-Joung Kwak, Sung-Ja Choi, Gang-Su Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Among the digital halftoning, the error diffusion halftoning gives better subjective quality than other halftoning techniques. But it also makes edges of objects blurred. To overcome the defect, this paper proposes the modified error diffusion halftoning algorithm to enhance the edges using the spatial perceptual characteristics of the human visual system. Using the characteristics that the human vision perceives not the pixel's luminance itself but the local average luminance and that information that human eyes perceive spatial variation, the proposed method computes edge enhancement information(EEI). The EEI is added to the quantizer's input pixel and feeds into the halftoning quantizer. The quantizer produces the halftone image having the enhanced edge. Also this paper proposes the technique that the coefficients of the error diffusion filter are adapted according to the correlation among color components. The computer simulation results show that the proposed method produces finer halftoning images than conventional methods due to the enhanced edges. And the proposed method also preserves similar in edges to original image and reduces some defects such as color impulse and false contours
Automatic Real-Time Moving Target Detection from Infrared Video
Authors: Shahryar Karimi-Ashtiani, C.-C. Jay Kuo
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A novel progressive estimation scheme is proposed to detect moving targets in infrared video sequences in this work. The proposed algorithm does not place constraints on camera motions nor requires rigid backgrounds. The complexity of the algorithm is low so that it can be performed in real time. Computational results of the algorithm applied to a real-world infrared video sequence are given to demonstrate its superior detection performance.
Feedback strategies for telemanipulation with shared control of object handling forces
Authors: Weston B. Griffin, William R. Provancher, Mark R. Cutkosky
Venue: Presence: Teleoperators and Virtual Environments (2005)

Shared control represents a middle ground between supervisory control and traditional bilateral control in which the remote system can exert control over some aspects of the task while the human operator maintains access to low-level forces and motions. In the case of dexterous telemanipulation, a natural approach is to share control of the object handling forces while giving the human operator direct access to remote tactile and force information at the slave fingertips. We describe a set of experiments designed to determine whether shared control can improve the ability of an operator to handle objects delicately and to determine what combinations of force, visual, and audio feedback provide the best level of performance and operator sense of presence. The results demonstrate the benefits of shared control and the need to carefully choose the types and methods of direct and indirect feedback.
A fast SAT solver algorithm best suited to reconfigurable hardware
Authors: Romanelli Zuim, José T. de Sousa, Claudionor N. Coelho
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

The majority of the existing reconfigurable hardware SAT solvers employ some variation of the Davis-Putnam algorithm; we propose a new algorithm for organizing the search in SAT Solvers best suited to reconfigurable architectures due to its vector-like operations. Its essence is to view each negated clause as a cube in the n-dimensional Boolean search space, and realizing that each of these clause-cubes denotes a sub-region of the search space where no satisfying assignments can be found. Starting from the universal cube, which represents the whole space, we systematically subtract all clause-cubes until we end up with a satisfying cube or an empty cube if the SAT formula is unsatisfiable. The algorithm for cube subtraction is the D-Sharp algorithm. We implemented this strategy in the well-known zChaff SAT solver. Improvements in execution time and number of aborted instances have been observed for the new algorithm. The test suite includes several instances from IBM-CNF BMC and Microprocessor's Formal Verification benchmarks. Given the breadth of the experimental software evaluation, we claim that D-Sharp subtraction search is an effective algorithm for improving the performance of SAT solvers and due to its data structure and bit-to-bit operations it is very well suited to reconfigurable hardware implementations. Design Automation (EDA).
Automatic rotation and zooming in mobile roadmaps
Authors: Timo Partala, Mika Luimula, Ossi Saukko
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

The aim of this research was to explore the navigational effects of two common features in current mobile roadmap systems: automatic rotation based on the vehicle's direction of movement and speed-dependent automatic zooming. 12 subjects tried four different visualization techniques for a mobile map in real traffic: no rotation/constant zooming, no rotation/automatic zooming, automatic rotation/constant zooming, and automatic rotation/automatic zooming. The subjects rated the techniques on four scales: position knowledge support, direction knowledge support, identification of real-world objects based on map objects and an overall score. The results showed that conditions involving automatic rotation and/or zooming got systematically more positive ratings on all scales than the conditions without those features. The implementation of automatic zooming created for this experiment was rated as very close to optimal. These results suggest that both automatic rotation and automatic zooming can enhance navigation when implemented to a mobile roadmap.
An analytical model for loop tiling and its solution
Authors: V. Sarkar
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The authors address the problem of estimating the performance of loop tiling, an important program transformation for improved memory hierarchy utilization. We introduce an analytical model for estimating the memory cost of a loop nest as a rational polynomial in tile size variables. We also present a constant-time algorithm for finding an optimal solution to the model (i.e., for selecting optimal tile sizes) for the case of doubly nested loops. This solution can be applied to tiling of three loops by performing an iterative search on the value of the first tile size variable, and using the constant-time algorithm at each point in the search to obtain optimal tile size values for the remaining two loops. Our solution is efficient enough to be used in production-quality optimizing compilers, and has been implemented in the IBM XL Fortran product compilers. This solution can also be used by processor designers to efficiently predict the performance of a set of tiled loops for a range of memory hierarchy parameters.
On the inferiority of higher-order detection in narrowband processing
Authors: L. M. Garth, Y. Bresler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

In certain scenarios higher-order statistic (HOS)-based detectors for non-Gaussian signals have been shown to have performance superior to widely-used second-order (SOS) techniques, owing to the HOS Gaussian noise rejection property. The authors study the effects of commonly-used narrow-band processing on these detectors. As the processing bandwidth is reduced, they characterize the tradeoff between the HOS and SOS detectors and demonstrate that the performance of the HOS detector deteriorates faster than that of the SOS detector. Distribution wideband detection is considered by a bank of L narrowband detectors whose decisions are fused together. It is shown that, given a fixed-bandwidth input signal, as L increases, the performance of the HOS distributed detector deteriorates faster than that of the SOS detector.
Horn clauses and functional dependencies in complex-value databases
Authors: Sven Hartmann, Sebastian Link
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

We extend Fagin's result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds for functional dependencies in databases that support complex values via nesting of records, lists, sets and multisets.The equivalence has several implications. Firstly, it extends a well-known result from relational databases to databases which are not in first normal form. Secondly, it characterises the implication of functional dependencies in complex-value databases in purely logical terms. The database designer can take advantage of this equivalence to reduce database design problems to simpler problems in propositional logic. An algorithm is presented for such an application. Furthermore, relational database design tools can be reused to solve problems for complex-value databases.
In Brief: Where Wired and Wireless Networks Converge
Authors: Laurianne McLaughlin
Venue: IEEE Distributed Systems Online (2006)

Georgia Tech researchers are developing a hybrid network design to deliver high-speed wired and wireless communications one optical fiber. The technology could be ready for crossover applications within five to seven years.
Conditional must not aliasing for static race detection
Authors: Mayur Naik, Alex Aiken
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

Race detection algorithms for multi-threaded programs using the common lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a proof of race freedom is showing that if two locks are distinct, then the memory locations they guard are also distinct. This is an example of a general property we call conditional must not aliasing: Under the assumption that two objects are not aliased, prove that two other objects are not aliased. This paper introduces and gives an algorithm for conditional must not alias analysis and discusses experimental results for sound race detection of Java programs.
Visualizing the motion of a unicycle on a sphere
Authors: M. P. Hennessey
Venue: International Journal of Modelling and Simulation (2006)

The kinematics, dynamics, and control of a unicycle (with yaw and roll inputs) moving without slip on a planar surface has been studied extensively in the geometric mechanics and nonholonomic literature. This paper considers the kinematic extension to the case of a unicycle moving on a nonplanar surface: specifically, a spherical surface and the associated visualization, including use of computer-aided design (CAD) software packages (e.g., SolidWorks® & MATLAB®). Such a scenario allows one to move closer to an understanding of the motion of an actual multiwheeled vehicle traversing nonplanar surfaces that may be approximated as spherical surface patches as well the realistic portrayal of virtual vehicles in computer graphics environments, in addition to other applications, such as those that employ kinematic inversion (e.g., industrial web handling). Differential equations of motion are derived based on the nonholonomic no-slip constraint and spherical trigonometry from which the associated Lie algebra is revealed and a related example foliation formulation is illustrated that ofers further generalization. For a fixed body yaw rate it is shown that a circular trajectory of a specific radius results--this can also form the basis of an instantaneous centre integration (ICI) algorithm. Numerical studies designed to exercise the equations of motion (using MATLAB® and SIMULINK®) were performed based on combinations of several different types of input trajectories: constant, non-infinitesimal Lie bracket manoeuvres, sinusoidal, and that induced by a prescribed contact point trajectory. Finally, the resulting interesting motions were plotted in 2D and 3D and provide a source of qualitative corroboration of the equations in addition to computer-generated artwork.
A matrix analytical method for the discrete time Lindley equation using the generalized Schur decomposition
Authors: Nail Akar
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

In this paper, we study the discrete time Lindley equation governing an infinite size GI/GI/1 queue. In this queuing system, the arrivals and services are independent and identically distributed but they obey a discrete time matrix geometric distribution not necessarily with finite support. Our GI/GI/1 model allows geometric batch arrivals and also treats late, early, and hybrid arrival models in a unified manner. We reduce the problem of finding the steady state probabilities for the Lindley equation to finding the generalized ordered Schur form of a matrix pair (E, A) where the size of these matrices are the sum, not the product, of the orders of individual arrival and service distributions. The approach taken in this paper is purely matrix analytical and we obtain a matrix geometric representation for the related quantities (queue lengths or waiting times) for the discrete time GI/GI/1 queue using this approach.
XML Based CBR for Adaptive Educational Hypermedia
Authors: Henda Chorfi, Mohamed Jemni
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we present an Adaptive Educational Hypermedia (AEH) based on Case Based Reasoning (CBR) approach and XML language. CBR may be very useful in e-Learning technologies. It should be viewed as a medium to be used in conjunction with the majority shared information system. In this context, we think that a standard way of marking up cases will facilitate this use. We suggest XML as the likely candidate to provide such standard. XML is used in order to represent the domain model, the user model and the case in the CBR system. CBR is used to simplify the process of personalization by reusing previous experiences.
Compositional dynamic test generation
Authors: Patrice Godefroid
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

Dynamic test generation is a form of dynamic program analysis that attempts to compute test inputs to drive a program along a specific program path. Directed Automated Random Testing, or DART for short, blends dynamic test generation with model checking techniques with the goal of systematically executing all feasible program paths of a program while detecting various types of errors using run-time checking tools (like Purify, for instance). Unfortunately, systematically executing all feasible program paths does not scale to large, realistic programs.This paper addresses this major limitation and proposes to perform dynamic test generation compositionally, by adapting known techniques for interprocedural static analysis. Specifically, we introduce a new algorithm, dubbed SMART for Systematic Modular Automated Random Testing, that extends DART by testing functions in isolation, encoding test results as function summaries expressed using input preconditions and output postconditions, and then re-using those summaries when testing higher-level functions. We show that, for a fixed reasoning capability, our compositional approach to dynamic test generation (SMART) is both sound and complete compared to monolithic dynamic test generation (DART). In other words, SMART can perform dynamic test generation compositionally without any reduction in program path coverage. We also show that, given a bound on the maximum number of feasible paths in individual program functions, the number of program executions explored by SMART is linear in that bound, while the number of program executions explored by DART can be exponential in that bound. We present examples of C programs and preliminary experimental results that illustrate and validate empirically these properties.
Abstract Application Modeling for System Design Space Exploration
Authors: Muhammad Waseem, Ludovic Apvrille, Rabea Ameur-Boulifa, Sophie Coudert, Renaud Pacalet
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The increasing complexity of System-on-Chip (SoC) requires a complete reexamination of design and validation methods prior to final implementation whereas faster system design space exploration is today's requirement to speed up the design process in order to cope with 'timeto- market' constraint. We have introduced SoC modeling approach which mixes simulation and formal modeling and verification methods for efficient design space exploration phase of SoC design cycle. The applications are described as a network of communicating tasks whose behaviors are abstracted. Because applications are abstract, it is possible to significantly increase the speed of simulation, to perform a quick performance analysis and apply static formal analysis techniques at higher level of abstraction. The proposed methodology has been employed in the design of a telecommunication system. A part of the application is modeled as a set of tasks in a modeling language and their behavior is monitored as a waveform of events in a simulation environment.
A multimedia traffic modeling framework for simulation-based performance evaluation studies
Authors: Assen Golaup, Hamid Aghvami
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

The emergence of high-speed communication systems has enabled the support of complex multimedia applications. The traffic patterns generated by such applications are likely to be more complicated than those of simple voice and data traffic sources. Source traffic models are very important in the performance evaluation of traffic control algorithms in communications networks. In this paper, a multimedia traffic modeling framework is presented. The framework dissociates the traffic generated by a multimedia application into a number of basic components and derives a traffic model for each component. These components are then integrated into a multimedia traffic source model. A Graphical User Interface (GUI) is presented to facilitate the traffic modeling process. These multimedia traffic models can be easily integrated into simulation studies. In order to illustrate the usefulness of the framework, a performance evaluation study of scheduling algorithms for the High Speed Downlink Packet Access (HSDPA) feature of UMTS (Universal Mobile Telecommunications System) is presented. It was found that a Cost Function-based scheduling algorithm that takes into account the head-of-line packet delays of all components of the multimedia application achieved a higher average user throughput.
Sensibility Control of Redundant Robots: Position Control by Image Trajectories
Authors: G. Boiadjiev, D. Vassileva, H. Kawasaki, T. Mouri
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This work is dedicated to position control of redundant robots, realized with the help of the sensibility theory. The control method allows controlling the robot position following some working trajectory, and at the same time maintaining its orientation state unchanged or vice-versa. The latter is achieved by using the features of the four robot configuration space orthogonal fibrations. Their characteristics and role are clarified. A concept of robot image trajectories is formulated and its application is analyzed. The proposed method is going to be applied for a real-time control to a 7 d.o.f. robot, based on Puma type construction. Simulations have been done for it, taking into account its dynamics and sensibility models and also by applying the position control method. The results and conclusions are presented.
Where physically is the optical center?
Authors: Peter Peer, Franc Solina
Venue: Pattern Recognition Letters (2006)

A simple and fast method of determining the position of the optical center without any specialized equipment is presented. The position of the optical center is a depth determining parameter in a panoramic depth imaging system [Peer, P., Solina, F., 2002. Panoramic depth imaging: single standard camera approach. Internat. J. Comput. Vision 47 (1/2/3), 149-160; Peer, P., Solina, F., 2005. Multiperspective panoramic depth imaging. In: Computer Vision and Robotics. Nova Science Publishers]. The reconstructed distances correspond well to the actual measured distances on the scene. ne.
The implementation of IT-project at Tumaini University, Iringa in 2001-2003
Authors: Jyri Kemppainen
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

Since 2000, Tumaini University, Iringa University College (IUCO) has been implementing an ICT plan which was aimed to create a stronger learning environment by use of ICT. The plan was divided into separate subprojects for its implementation. One of those subprojects called IPSP 2001-2003 is the object of this study. The phases of this technical subproject involved creation of the local area network and an upto- date computer classroom in the college campus.
Independence From Obfuscation: A Semantic Framework for Dive
Authors: Riccardo Pucella, Fred B. Schneider
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

A set of replicas is diverse to the extent that all implement the same functionality but differ in their implementation details. Diverse replicas are less prone to having vulnerabilities in common, because attacks typically depend on memory layout and/or instruction-sequence specifics. Recent work advocates using mechanical means, such as program rewriting, to create such diversity. A correspondence between the specific transformations being employed and the attacks they defend against is often provided, but little has been said about the overall effectiveness of diversity per se in defending against attacks. With this broader goal in mind, we here give a precise characterization of attacks, applicable to viewing diversity as a defense, and also show how mechanically-generated diversity compares to a wellunderstood defense: strong typing.