ppxscal/embedding_network huggingface dataset:
A retargetable framework for instruction-set architecture simulation
Authors: Mehrdad Reshadi, Nikil Dutt, Prabhat Mishra
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

Instruction-set architecture (ISA) simulators are an integral part of today's processor and software design process. While increasing complexity of the architectures demands high-performance simulation, the increasing variety of available architectures makes retargetability a critical feature of an instruction-set simulator. Retargetability requires generic models while high-performance demands target specific customizations. To address these contradictory requirements, we have developed a generic instruction model and a generic decode algorithm that facilitates easy and efficient retargetability of the ISA-simulator for a wide range of processor architectures, such as RISC, CISC, VLIW, and variable length instruction-set processors. The instruction model is used to generate compact and easy to debug instruction descriptions that are very similar to that of architecture manual. These descriptions are used to generate high-performance simulators. Our retargetable framework combines the flexibility of interpretive simulation with the speed of compiled simulation. The generation of the simulator is completely separate from the simulation engine. Hence, we can incorporate any fast simulation technique in our retargetable framework without introducing any performance penalty. To demonstrate this, we have incorporated fast IS-CS simulation engine in our retargetable framework which has generated 70&percnt; performance improvement over the best known simulators in this category. We illustrate the retargetability of our approach using two popular, yet different, realistic architectures: the SPARC and the ARM.
Robust Estimation in the Presence of Spatially Coherent Outliers
Authors: R. Fransens, C. Strecha, L. Van Gool
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a generative model based approach to deal with spatially coherent outliers. The model assumes that image pixels are generated by either one of two distinct processes: an inlier process which is responsible for the generation of the majority of the data, and an outlier process which generates pixels not adhering to the inlier model. The partitioning into inlier and outlier regions is made explicit by the introduction of a hidden binary map. To account for the coherent nature of outliers this map is modelled as a Markov Random Field, and inference is made tractable by a mean field EM-algorithm. We make a connection with classical robust estimation theory, and derive the analytic expressions of the equivalent M-estimator for two limiting cases of our model. The effectiveness of the proposed method is demonstrated with two examples. First, in a synthetic linear regression problem, we compare our approach with different M-estimators. Next, in a 2D-face recognition experiment, we try to identify people from partially occluded facial images.
GSGCP-FEM: A General Service-Oriented Grid Computing Platform for FEM-Based Simulations
Authors: Kejing He, Shoubin Dong, Jianfei He, Liqun Tang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Finite Element Method (FEM)-based scientific numerical simulations are often computing-extensive and Grid platform can speed up the simulation progress significantly. However, the coupling of FEM-based simulation tasks with Grid platform isn't so straightforward. Adopting the Service-oriented Architecture (SOA), we develop a General Service-oriented Grid Computing Platform for FEM-based Simulations (GSGCP-FEM). GSGCP-FEM provides users with the ability to make a general FEM-based simulation to be service-oriented. Basing on the services provided by GSGCP-FEM and Grid middleware, users can deploy new scientific simulation applications easily. In this paper, we explain the design, architecture, and implementation of GSGCP-FEM in detail. We also deploy two practical applications based on GSGCP-FEM to demonstrate its usefulness.
Handling Heterogeneous Academic Curricula
Authors: Richard Hackelbusch
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Academic programs follow very heterogeneous curricula. A first roadmap to overcome this still unsolved problem was stated in the Bologna-Process. In this paper, we propose a framework heading this goal. It will enable students to integrate classes from other institutions into their own curriculum even if the curriculum at the corresponding institution differs. In order to allow class substitutions, we propose the development of an ontology describing the required metadata. Methods for indexing texts as well as case-based reasoning techniques will be used in order to identify interchangeable, organizational and semantical equivalent classes. Interoperability between participating institutions will be accomplished using Web Services and peer-to-peer nets. Existing learning management systems can be integrated. As a result, it will be transparent to students where they take their classes in order to reach their degree. Furthermore, educational institutions can broaden their offerings by integrating additional programs.
Efficient, realistic method for animating dynamic behaviors of 3D botanical trees
Authors: H. Kanda, J. Ohya
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper proposes a new efficient method that can animate botanical trees in 3D realistically. In this paper, a 3D botanical tree model consists of a set of branch segments, to which leaf models are attached. To reduce the amount of computation, instead of calculating the motions of all the branch segments, only the representative segment in each branch is numerically analyzed. The numerical analysis is constrained to a 2D plane so that 3D numerical analysis need not be performed. Concerning the leaf model, a set of four leaves is systematically attached to each branch segment. Experimental results clarify the conditions for real-time, realistic animations of dynamic behaviors of trees.
Facilitating Collaboration and Application Sharing with MAST and the Access Grid Development Infrastructures
Authors: Gareth Lewis, S Mehmood Hasan, Vassil N. Alexandrov, Martin T. Dove
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Multicast Application Sharing Tool (MAST) allows geographically distributed participants to share arbitrary legacy applications. MAST supports scalable group to group collaboration by using Multicast. It is being used within the eMinerals project to augment the Access Grid functionality. In this paper we describe how MAST has taken advantage of the Node Service and Shared Application infrastructure provided by the Access Grid Toolkit to facilitate flexible and convenient sharing of applications within the eMinerals Virtual Organisation.
Performance and Reliability Analysis ofWeb Server Software Architectures
Authors: Swapna S. Gokhale, Paul J. Vandal, Jijun Lu
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Our increasing reliance on the information and services provided by modern Web servers mandates that these services be offered with superior performance and reliability. The architecture of a Web server has a profound impact on its performance and reliability. One of the dimensions used to characterize the architecture of a Web server is the processing model employed in the server, which describes the type of process or threading model used to support a Web server operation. The main options for a processing model are process-based, thread-based or a hybrid of the process-based and the thread-based models. These options have unique advantages and disadvantages in terms of their performance and reliability tradeoffs. In this paper we propose an analysis methodology based on the Stochastic Reward Net (SRN) modeling paradigm to quantify the performance and the reliability tradeoffs in the process-based and the thread-basedWeb server software architectures. We demonstrate the capability of the methodology to facilitate systematic, quantitative tradeoffs using several examples.
Using Indexing Functions to Reduce Conflict Aliasing in Branch Prediction Tables
Authors: Yi Ma Hongliang Gao Huiyang Zhou
Venue: IEEE Transactions on Computers (2006)

High-accuracy branch prediction is crucial for high-performance processors. Inspired by the work on indexing functions to eliminate conflict-misses in memory hierarchy, this paper explores different indexing approaches to reduce conflict aliasing in branch-prediction tables. Our results show that indexing functions provide a highly complexity-effective way to enhance prediction accuracy.
Functional analysis for operating emergency department of a general hospital
Authors: Soemon Takakuwa, Hiroko Shiozaki
Venue: Proceedings of the 36th conference on Winter simulation (2004)

An entire emergency department of a general hospital is simulated to examine patient flows. First, times needed for both outpatients and patients arriving via ambulance to be processed in the emergency department are examined. A special-purpose data-generator is designed and developed to create experimental data for executing a simulation. It is found that the patients spend the longer part of their time waiting, depending on the number of patients to be processed. In addition, it is found that the waiting time for available emergency-treatment beds, doctors, drips, and stretchers accounts for the major part of all the waiting time in the emergency department. A stepwise procedure of operations planning is proposed to minimize the patient waiting times, and numerical examples are shown to illustrate the procedure.
Architectures for distributed smart cameras
Authors: W. Wolf, B. Ozer, T. Lv
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper describes our new multiple-camera architecture for real-time video analysis. This architecture uses an array of relatively inexpensive cameras to gather images in order to provide high resolution at low cost. The system also uses a hierarchy of cameras, including both wide-angle and telephoto views. Wide-angle cameras are responsible for camera coordination while telephoto cameras are primarily responsible for detailed processing of parts of the scene.
H \infty Gain-Scheduled Missile Controller Design Using Linear Parameter-Varying Feedback
Authors: Jianqiao Yu, Li Liu, Hongxia Zhao, Chengdong Xu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The dynamic characteristics of missile vary substantially with flight conditions such as flight Mach number, altitude and angle of attack. Therefore, in order to achieve adequate levels of robustness and performance, a controller that also varies during operation has to be designed in missile control. This paper is concerned with the application of advanced mixed linear parameter-varying (LPV)/\mu techniques to global control of a missile. The techniques can produce an H \infty based LPV controller, which is automatically "gain scheduled" with respect to the flight conditions and adapts to the variation of the missil'se dynamic characteristics. The power and effectiveness of the resulting controller are demonstrated by nonlinear simulations.
On the logic of coalitional games
Authors: Thomas Ågotnes, Wiebe van der Hoek, Michael Wooldridge
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We develop a logic for representing and reasoning about coalitional games without transferable payoffs. Although a number of logics of cooperation have been proposed over the past decade (notably Coalition Logic [14] and Alternating-time Temporal Logic [1]), these logics focused primarily on the issue of strategic cooperative ability -- what states a coalition can effectively enforce - and have tended to ignore the essential issue of the preferences that agents have over such states; in addition, the connection between such logics and coalitional games, in the sense of cooperative game theory, is left implicit. The Coalitional Game Logic (CGL) that we develop in this paper differs from such previous logics in two important respects. First, CGL includes operators that make it directly possible to represent an agent's preferences over outcomes. Second, we interpret formulae of CGL directly with respect to coalitional games without transferable payoff, thereby establishing an explicit link between formulae of the logic and properties of coalitional games. We show that these coalitional games cannot be seen directly as models for Coalition Logic. We give a complete axiomatization of CGL, prove that it is expressively complete with respect to coalitional games without transferable payoff, show that the satisfiability problem for the logic is NP-complete, and to illustrate its use, we show how the logic can be used to characterise axiomatically a number of well-known solution concepts for coalitional games, including for example non-emptiness of the core.
Integrating Spatial and Discriminant Strength for Feature Selection and Linear Dimensionality Reduction
Authors: Qi Li, Chandra Kambhamettu, Jieping Ye
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Interest strength assignment to image points is important for selecting good features. Strength assignments using spatial information aim to detect interest points repeatable across different image/illumination transformations, and have been widely adopted in many interest point detectors. Recently, strength assignment schemes using discriminant information received attention, and studies showed the superiority of discriminant strength. In this paper, we introduce a strength assignment scheme integrating spatial and discriminant information, with the motivation that strong spatial information can be helpful in improving the robustness of the discriminant strength estimation, e.g., in undersampled training scenario. Our integrated strength uses a new discriminant strength assignment, so-called locality oriented Fisher criterion score. The integrated strength leads to new methods for feature selection and weighted linear dimensionality reduction. Experimental results in two case studies (embryo developmental stage classification and face recognition) show the favorable performance of the proposed methods.
Structure and automorphism groups of Hadamard designs
Authors: Eric Merchant
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

Let n be the order of a Hadamard design, and G any finite group. Then there exists many non-isomorphic Hadamard designs of order 212|G| + 13 n with automorphism group isomorphic to G.
Where you point is where the robot is
Authors: Hokyoung Ryu, Woohun Lee
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

It is virtually envisioned that in the near future home-service robots will be assisting people in their daily lives. While a wide spectrum of utility of home-service robots has been proposed, i.e., cleaning, surveillance or go-and-fetch jobs, usability studies of the home-service robots have been less undertaken. This paper explores the usability issues, in particular, a map-based user interface for instructing home-service robots in the home environment. It focused on how the different map representation of the co-located environment would affect task performance of locating the home-service robots. The effectiveness of the map-based human-robot interface was thus analysed according to the dimensionality of the map, the location information of the elements in the co-located workspace. The experimental results showed that task performance was varied by the different map representation, providing a better understanding of what characteristics of the map representation were able to effectively support the human operator in instructing the home-service robots in the home environment.
An Algebra for Multidimensional Documents as Abstraction Mechanism for Cross Media Publishing
Authors: Ulrike Lucke
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The concept of multidimensionality allows to specify contrary variants of a content object on a common, abstract level. This prevents redundancy, simplifies the maintenance and increases the adaptability of content. This is crucial for automated cross media delivery. Though some implementations of multidimensional document systems are available, existing formalisms do not yet cover this concept. This article presents the multidimensional extension of a document algebra, as well as a reference implementation of this algebra in an authoring tool. The algebraic approach is a valuable basis for interoperability of formats and tools in order to realize the whole content workflow in cross media publishing.
Element-Free Elastic Models for Volume Fitting and Capture
Authors: Jaeil Choi, Andrzej Szymczak, Greg Turk, Irfan Essa
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a new method of fitting an element-free volumetric model to a sequence of deforming surfaces of a moving object. Given a sequence of visual hulls, we iteratively fit an element-free elastic model to the visual hull in order to extract the optimal pose of the captured volume. The fitting of the volumetric model is acheived by minimizing a combination of elastic potential energy, a surface distance measure, and a self-intersection penalty for each frame. A unique aspect of our work is that the model is mesh free -since the model is represented as a point cloud, it is easy to construct, manipulate and update the model as needed. Additionally, linear elasicity with rotation compensation makes it possible to handle local deformations and large rotations of body parts much more efficiently than other volume fitting approaches. Our experimental results for volume fitting and capture in a multi-view camera setting demonstrate the robustness of element-free elastic models against noise and self-occlusions.
N400-like Semantic Incongruity Effect in 19-Month-Olds: Processing Known Words in Picture Contexts
Authors: Manuela Friedrich, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2004)

To understand mechanisms of early language acquisition, it is important to know whether the child's brain acts in an adult-like manner when processing words in meaningful contexts. The N400, a negative component in the eventrelated potential (ERP) of adults, is a sensitive index of semantic processing reflecting neural mechanisms of semantic integration into context. In the present study, we investigated whether the mechanisms indexed by the N400 are already working during early language acquisition. While 19-month-olds were looking at sequentially presented pictures, they were acoustically presented with words that were either congruous or incongruous to the picture content. The ERP averaged across the group of 55 children revealed an N400-like semantic incongruity effect in addition to an early phonological&ndash;lexical priming effect. The results suggest that both lexical expectations facilitating early phonological processing and mechanisms of semantic priming facilitating integration into semantic context are already present in 19-month-olds. The child's specific comprehension abilities are reflected in strength, latency, and hemispheric differences of the semantic incongruity effect. Spatio-temporal differences in that effect, thus, indicate changes in the organization of brain activity correlated with the child's behavioral development.
2005 Special issue: Robust self-localisation and navigation based on hippocampal place cells
Authors: Thomas Strösslin, Denis Sheynikhovich, Ricardo Chavarriaga, Wulfram Gerstner
Venue: Neural Networks (2005)

A computational model of the hippocampal function in spatial learning is presented. A spatial representation is incrementally acquired during exploration. Visual and self-motion information is fed into a network of rate-coded neurons. A consistent and stable place code emerges by unsupervised Hebbian learning between place- and head direction cells. Based on this representation, goal-oriented navigation is learnt by applying a reward-based learning mechanism between the hippocampus and nucleus accumbens. The model, validated on a real and simulated robot, successfully localises itself by recalibrating its path integrator using visual input. A navigation map is learnt after about 20 trials, comparable to rats in the water maze. In contrast to previous works, this system processes realistic visual input. No compass is needed for localisation and the reward-based learning mechanism extends discrete navigation models to continuous space. The model reproduces experimental findings and suggests several neurophysiological and behavioural predictions in the rat.
Multiple Mobile Robots Path-Planning with MCA
Authors: Fabio M. Marchese
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

In this paper is described a fast Path-Planner for Multi-robot composed by mobile robots having generic shapes and sizes (user defined) and different kinematics. We have developed an algorithm that computes the shortest collision-free path for each robot, from the starting pose to the goal pose, while considering their real shapes, avoiding the collisions with the static obstacles and the other robots. It is based on a directional (anisotropic) propagation of attracting potential values in a 4D Space-Time, using a Multilayered Cellular Automata (MCA) architecture. This algorithm makes a search for all the optimal collision-free trajectories following the minimum valley of a potential hypersurface embedded in a 5D space.
Reversible Data Hiding for 3D Meshes in the PVQ-Compressed Domain
Authors: Zhen Sun, Zhe-Ming Lu, Zhen Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we present a new data hiding method for 3D triangle meshes. While most of the existing data hiding schemes introduce some small amount of nonreversible distortion to the cover mesh, the new method is reversible and enables the cover mesh data to be completely restored when the payload is removed from the stego mesh. A noticeable difference between our method and others is that we embed data in the predictive vector quantization (PVQ) compressed domain by modifying the prediction mechanism during the compression process. Experimental results demonstrate the effectiveness of the proposed scheme.