ppxscal/embedding_network huggingface dataset:
Complete manufacturing process of a parallel kinematics manipulator
Authors: J. Corral, C. Pinto, V. Petuya, D. Del Pozo, E. Ispizua, M. J. López
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

The object of this paper is to outline, describe and solve a parallel kinematics mechanism's manufacturing process. A detailed study of the different options, variants and possible solutions of the design will be carried out, explaining the convenience or not of each one of them and justifying the election of each option, considering the different outlined specifications. To complete this objective, a prototype of a parallel manipulator will be built, which must be able to validate and take out the summations of the whole process. The interest in building a prototype of a parallel manipulator borns in a previous works made by the authors about the kinematic and stiffness analyses of these manipulators.
Formalising device driver interfaces
Authors: Leonid Ryzhyk, Ihor Kuz, Gernot Heiser
Venue: Proceedings of the 4th workshop on Programming languages and operating systems (2007)

The lack of well-defined protocols for interaction with the operating system is a common source of defects in device drivers. In this paper we investigate the use of a formal language to define these protocols unambiguously. We present a language that allows us to convey all important requirements for driver behaviour in a compact specification and that can be readily understood by software engineers. It is intended to close the communication gap between OS and driver developers and enable more reliable device drivers.
A field smoothing stabilization of particle methods in elastodynamics
Authors: Hassan Ostad-Hossein, Soheil Mohammadi
Venue: Finite Elements in Analysis and Design (2008)

One of the most important problems in solution of partial differential equations in their strong form with particle methods is the instability of results. A number of methods have been developed for elimination of this deficiency in past decade. Many of them, however, cannot be efficiently applied to all general engineering problems. In this paper, two new methods for removing the instability in particle methods are presented. The first method is based on an incremental form of the Navier equation in small deformations combined with the Newmark time integration scheme. The second method is based on the concept of field smoothing. This method stabilizes the solution by removing high frequency vibrations of field variables with a number of field smoothing techniques. This method is more general than the first one and may be applied to various engineering problems. The proposed methods have no requirements of considering any stabilizing terms in the main equations. Although the proposed approaches can be applied to any particle method, the CSPM particle method is adopted for detail discussion. Several illustrative examples are analyzed to assess the capability of the proposed approaches to enhance the stability of particle methods.
On the generalized solutions for uncertain systems with applications to optimal control and estimation problems
Authors: Tatiana F. Filippova
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The paper deals with the control and estimation problems for impulsive control system under uncertainty described by differential systems with measures. Uncertainty conditions are of a set-membership type, i.e. uncertain parameters and functional disturbances are taken to be unknown but bounded with given bounds (e.g., the model may contain unpredictable errors without their statistical description). Models of this kind arise in many applications ranging from space navigation to investment problems as well as ecological management. In this paper we consider solution concepts for such measure driven uncertain dynamical systems. The approaches are based on the techniques of approximation of the discontinuous generalized trajectory tubes by the solutions of usual differential systems without measure terms and provide convenient frameworks to derive optimality conditions in the form of either a Maximum Principle or Hamilton-Jacobi-Bellman equations. Another class of problems related to the addressed systems concerns the state estimation. The redesign of the approach for impulsive control systems in the framework of the new solution concept is presented through the characterization of the reachable set as a level set of the value function regarded as a solution of Hamilton-Jacobi-Bellman equations.
A broadband RF 65nm CMOS front-end for cable TV reception
Authors: Marco Pifferi, Fabio Ducati, Hans Brekelmans, Lorenzo Tripodi, Kostas Doris, Mattia Borgarino
Venue: Microelectronics Journal (2008)

A novel broadband RF front-end in 65nm CMOS technology is presented. The front-end serves to precondition the incoming RF spectrum for further processing in a cable TV receiver architecture where RF channel selection and down conversion are done in digital domain. The analog front-end consists of a broadband highly linear low-noise amplifier followed by a variable gain RF amplifier. An original broadband circuit topology for the amplifiers is adopted. The fabricated front-end exhibits a bandwidth of 50-1050MHz, a variable gain, which spans from 12 to 37dB with a 0.2dB step, an OIP3 of 28.4dBm (77.5dBmV), an OIP2 of 65dBm (114dBmV), and a noise figure of 5.8dB, dissipating 125mW at 1.2V supply, and a core silicon area of 0.4mm^2.
A collaborative recommender system based on probabilistic inference from fuzzy observations
Authors: Luis M. de Campos, Juan M. Fernández-Luna, Juan F. Huete
Venue: Fuzzy Sets and Systems (2008)

The problem of building recommender systems has attracted considerable attention in recent years. The objective of this paper is to automatically suggest and rank a list of new items to a user based on the past voting patterns of other users with similar tastes. The proposed model can be considered as a Soft Computing-based collaborative recommender system. The combination of Bayesian networks, which enables an intuitive representation of the mechanisms that govern the relationships between the users, and the Fuzzy Set Theory, enabling us to represent ambiguity or vagueness in the description of the ratings, improves the accuracy of the system.
Math information retrieval: user requirements and prototype implementation
Authors: Jin Zhao, Min-Yen Kan, Yin Leng Theng
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We report on the user requirements study and preliminary implementation phases in creating a digital library that indexes and retrieves educational materials on math. We first review the current approaches and resources for math retrieval, then report on the interviews of a small group of potential users to properly ascertain their needs. While preliminary, the results suggest that meta-search and resource categorization are two basic requirements for a math search engine. In addition, we implement a prototype categorization system and show that the generic features work well in identifying the math contents from the webpage but perform less well at categorizing them. We discuss our long term goals, where we plan to investigate how math expressions and text search may be best integrated.
Influence of fibrin glue on proliferation and differentiation of human bone marrow stromal cells seeded on a biologic 3-dimensional matrix
Authors: Carl Haasper, Astrid Breitbart, Stefan Hankemeier, Michael Wehmeier, Eric Hesse, Musa Citak, Christian Krettek, Johannes Zeichen, Michael Jagodzinski
Venue: Technology and Health Care (2008)

For tissue engineering of bone, a carrier matrix and efficient cell seeding are desirable. This study analysed the effect of fibrin glue on bone marrow stromal cells (BMSC) adhesion, proliferation (MTS-Test), differentiation (alkaline phosphatase (AP), osteocalcin (OC), ELISA) and compared the results with cells seeded within culture media on a decellularized, xenogenic bone matrix. There was no significant difference regarding cell adhesion. Proliferation after one week was significantly increased without fibrin glue. AP was increased in both groups when compared with porous scaffolds without cells. OC secretion was increased under both seeding conditions. Microscopic investigation of the cells with fibrin-glue showed less cell-cell contacts. This study reveals that cell seeding with medium demonstrates similar adherence rates compared with fibrin glue. Fibrin glue significantly decreases cell proliferation. Cell differentiation with respect to ALP and OC is not affected. Further studies are required to assess the long term and in vivo effects of both methods with respect to BMSC viability and differentiation. Fibrin sealants seem not necessary to achieve cell adherence when using a porous bone matrix.
A static analysis for quantifying information flow in a simple imperative language
Authors: David Clark, Sebastian Hunt, Pasquale Malacaria
Venue: Journal of Computer Security (2007)

We propose an approach to quantify interference in a simple imperative language that includes a looping construct. In this paper we focus on a particular case of this definition of interference: leakage of information from private variables to public ones via a Trojan Horse attack. We quantify leakage in terms of Shannon's information theory and we motivate our definition by proving a result relating this definition of leakage and the classical notion of programming language interference. The major contribution of the paper is a quantitative static analysis based on this definition for such a language. The analysis uses some non-trivial information theory results like Fano's inequality and the &Lscr; 1 inequality to provide reasonable bounds for conditional statements. While-loops are handled by integrating a qualitative flow-sensitive dependency analysis into the quantitative analysis.
Robust Packet Detection Algorithm for DBO-CSS
Authors: Seong-hyun Jang, Sang-hun Yoon, Jong-wha Chong
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we propose a robust packet detection algorithm for the differentially bi-orthogonal chirp-spread-spectrum (DBO-CSS). The conventional packet detection algorithms based on auto-correlation cannot avoid side band noise because of the band hopping property of the DBO-CSS. If we, therefore, use the conventional packet detection algorithms in the DBO-CSS, the performance degradation of the packet detector will break out. First, the proposed detector includes matched filters to eliminate the side band noise. Second, the proposed detector also includes auto-correlators in order to make outputs of matched filters inphase. Finally, the proposed detector gathers the energy of all sub-chirps by the summation. When we use the Permutator, the proposed detector works regardless of piconet. Simulation results show that we can detect packets in -4 dB SNR in AWGN channel and also in 0 dB in multipath channel.
Towards a Better Understanding of Semantic Ontology-Based Home Service Modelling
Authors: Julia Kantorovitch, Jarmo Kalaoja, Ilkka Niskanen, Toni Piirainen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

With rapid advances in the enabling technologies for pervasive computing and with the requirements for communication systems autonomy, ontology-based semantic approaches as applied to contextual application scenarios have recently received a great deal of attention from the research community. However, service modelling using semantic knowledge sources and the available service semantic description languages can be a time and effort consuming process, which thus leads to the poor acceptance of semantic technologies. The semantic support environment presented in this research addresses this shortcoming providing a more illustrative and understandable way to view ontology instances associated with complex contextual information. It enables semantic modelling and the interactive simulation of physical real-world contextual environments of interest (i.e. devices, services, functional capabilities of service, contexts). It provides support for the design of applications or middleware level services.
A framework for adaptive collective communications for heterogeneous hierarchical computing systems
Authors: Luiz Angelo Steffenel, Grégory Mounié
Venue: Journal of Computer and System Sciences (2008)

Collective communication operations are widely used in MPI applications and play an important role in their performance. However, the network heterogeneity inherent to grid environments represent a great challenge to develop efficient high performance computing applications. In this work we propose a generic framework based on communication models and adaptive techniques for dealing with collective communication patterns on grid platforms. Toward this goal, we address the hierarchical organization of the grid, selecting the most efficient communication algorithms at each network level. Our framework is also adaptive to grid load dynamics since it considers transient network characteristics for dividing the nodes into clusters. Our experiments with the broadcast operation on a real-grid setup indicate that an adaptive framework allows significant performance improvements on MPI collective communications.
Validation of satellite rainfall products over East Africa's complex topography
Authors: T. Dinku, P. Ceccato, E. Grover-Kopec, M. Lemma, S. J. Connor, C. F. Ropelewski
Venue: International Journal of Remote Sensing (2007)

An extensive evaluation of 10 different satellite rainfall products was performed using station network over a complex topography, where elevation varies from below sea level to 4620 m. Evaluation was for two groups of products. The first group had low spatial (2.5°) and temporal (monthly) resolution and included the Global Precipitation Climatology Project (GPCP), the National Oceanographic and Atmospheric Administration Climate Prediction Center (NOAA-CPC) merged analysis (CMAP), and the Tropical Rainfall Measuring Mission (TRMM-3B43). The second group comprised products with relatively high spatial (0.1° to 1°) and temporal (3-hourly to 10-daily) resolution. These included the NOAA-CPC African rainfall estimation algorithm, GPCP one-degree-daily (1DD), TRMM-3B42, Tropical Applications of Meteorology using SATellite and other data (TAMSAT) estimates, and the CPC morphing technique (CMORPH). These products were aggregated to a 10-day total and remapped to spatial resolutions of 1°, 0.5° and 0.25°. TRMM-3B43 and CMAP from the first group and CMORPH, TAMSAT and TRMM-3B42 from the second group performed reasonably well.
A fast, analytical estimator for the SEU-induced pulse width in combinational designs
Authors: Rajesh Garg, Charu Nagpal, Sunil P. Khatri
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Single event upsets (SEUs) are becoming increasingly problematic for both combinational and sequential circuits with device scaling, lower supply voltages and higher operating frequencies. To design radiation tolerant circuits efficiently, techniques are required to analyze the effects of a particle strike on a circuit early in the design flow and also to evaluate the circuit's resilience to SEU events. In this paper, we present an analytical model for SEU induced transients in combinational circuits. The pulse width of the voltage glitch due to an SEU event is a good measure of SEU robustness and our model efficiently computes it for any combinational gate. The experimental results demonstrate that our model is very accurate with a very low pulse width estimation error of 4% compared to SPICE. Our model gains its accuracy by using a non-linear transistor current model, and by considering the effect of &tau;&beta; of the radiation induced current pulse. Our analytical model is very fast and accurate, and can therefore be easily incorporated in a design flow to implement SEU tolerant circuits.
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
Authors: Feng Pan, Xiang Zhang, Wei Wang
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The problem of simultaneously clustering columns and rows (co-clustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system analysis. Compared with the classical clustering algorithms, co-clustering algorithms have been shown to be more effective in discovering hidden clustering structures in the data matrix. The complexity of previous co-clustering algorithms is usually O(m X n), where m and n are the numbers of rows and columns in the data matrix respectively. This limits their applicability to data matrices involving a large number of columns and rows. Moreover, some huge datasets can not be entirely held in main memory during co-clustering which violates the assumption made by the previous algorithms. In this paper, we propose a general framework for fast co-clustering large datasets, CRD. By utilizing recently developed sampling-based matrix decomposition methods, CRD achieves an execution time linear in m and n. Also, CRD does not require the whole data matrix be in the main memory. We conducted extensive experiments on both real and synthetic data. Compared with previous co-clustering algorithms, CRD achieves competitive accuracy but with much less computational cost.
FAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
Authors: Mark Cummins, Paul Newman
Venue: International Journal of Robotics Research (2008)

This paper describes a probabilistic approach to the problem of recognizing places based on their appearance. The system we present is not limited to localization, but can determine that a new observation comes from a previously unseen place, and so augment its map. Effectively this is a SLAM system in the space of appearance. Our probabilistic approach allows us to explicitly account for perceptual aliasing in the environment&#x2014;identical but indistinctive observations receive a low probability of having come from the same place. We achieve this by learning a generative model of place appearance. By partitioning the learning problem into two parts, new place models can be learned online from only a single observation of a place. The algorithm complexity is linear in the number of places in the map, and is particularly suitable for online loop closure detection in mobile robotics.
Phase-adjustable error detection flip-flops with 2-stage hold driven optimization and slack based grouping scheme for dynamic voltage scaling
Authors: Masanori Kurimoto, Hiroaki Suzuki, Rei Akiyama, Tadao Yamanaka, Haruyuki Ohkuma, Hidehiro Takata, Hirofumi Shinohara
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Error Detection FFs for Dynamic Voltage Scaling (DVS) has been proposed. This technique controls the clock phase based on the timing slack, and reduces the energy consumption by 19.8% compared to non-DVS. The error signal latency is shortened to 6.3%, the area and power penalties for delay buffers on short paths become 35.0% and 40.6% lower compared to the conventional DVS.
Light paths in 4-connected graphs in the plane and other surfaces
Authors: Bojan Mohar
Venue: Journal of Graph Theory (2000)

Several results concerning existence of k-paths, for which the sum of their vertex degrees is small, are presented. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 170&ndash;179, 2000
Finding Evidence of Antedating in Digital Investigations
Authors: Svein Yngvar Willassen
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Finding evidence of antedating is an important goal in many digital investigations. This paper explores how causality can expose antedating by investigating storage systems for causality and correlate causality with stored timestamps. Causality is determined in two different system types; storage systems using sequence numbers and storage systems using the first-fit allocation strategy. Causality found in these systems was used to implement a timestamp consistency checker for the NTFS file system. The implementation was then tested in an experiment, in which four subjects were asked to antedate a document on a given computer in such a way that the antedating could not be determined by an investigator. The results from this experiment show that the implemented consistency checker can be used to expose antedating. Investigators can use this method to find evidence of antedating to be presented to fact-finders in real cases.
Queuing Network Performance Model for Evaluation of CMP-Based VoIP SPS
Authors: Jiuzhen Jin, Jianmin Pang, Zheng Shan, Rongcai Zhao
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper we describe our experience in performance evaluation of CMP-based VoIP SPS (signaling parse system). We also present a performance model of the system using GI/G/m-FCFS multi-class open QNs(queuing networks). And deal with approximate performance analysis of open non-product-form QNs, based on the method of decomposition. Our approach predicts the major performance evaluation parameters of the system under the workloads and also identifies bottlenecks in the system. Performance results are inserted back into the QN model as initial values associated to the relevant model elements. The theoretical estimates are shown to be in excellent consistence with testing results. It shows the effectiveness of the proposed model. This work explores performance issues of CMP-based applications by means of performance modeling. In this way we may get an immediate feedback on the system performances. The use of QN model allows us to achieve better multi-core application performance.
Exploiting unidirectional links for key establishment protocols in heterogeneous sensor networks
Authors: Yuanyuan Zhang, Dawu Gu, Juanru Li
Venue: Computer Communications (2008)

Wireless sensor networks are designed for outdoor environment surveillance and require benign coverage, steady working status and long lifetime, so they require efficient security services eagerly. Most security schemes work efficiently only when bidirectional links exist. So does key establishment protocols in WSNs. However, unidirectional links may emerge frequently. In traditional key establishment schemes, designers delete all the unidirectional links from the network. Hence, the sensors covered only by unidirectional links are excluded from the collaborating network, even if they are stable and energetic. The schemes shorten the lifetime and shrink the connectivity of the whole network. To improve the network connectivity and increase the number of useable sensors in the network, we design a key establishment protocol for heterogeneous sensor networks exploiting unidirectional links. We propose inter-cluster and intra-cluster key establishment schemes for clusters and their members, respectively. Intra-cluster scheme adopts key pre-distribution mechanism, where cluster members and the cluster heads choose different number of keys. The results show that it greatly increases the resiliency against node compromise. Inter-cluster scheme adopts ID-based cryptographic algorithm using pairing and obtain identity authentication and perfect resilience against node compromise. Finally, the simulation reveals our scheme can greatly increase the proportion of available sensor nodes and network connectivity, which will efficiently prolong the network lifetime.