ppxscal/embedding_network huggingface dataset:
Simulation and experimental validation of multiple-step wire drawing processes
Authors: Diego J. Celentano, Mauricio A. Palacios, Ennio L. Rojas, Marcela A. Cruchaga, Alfredo A. Artigas, Alberto E. Monsalve
Venue: Finite Elements in Analysis and Design (2009)

This paper presents an experimental analysis and a numerical simulation of the mechanical behaviour experienced by a steel rod during multiple-step wire cold-drawing processes. To this end, a set of tensile experiments is firstly carried out in order to characterise the material hardening evolution for different consecutive wire reductions. The experimental procedure also encompasses the measurement of drawing forces in a multiple-step process conducted at a laboratory scale under different drawing velocities. Then, this problem is simulated via a finite element formulation that accounts for both large viscoplastic strains and friction effects. The results obtained with the simulation are experimentally validated. Finally, the influence of specific operating conditions, such as the decrease of the number of wire reductions and the presence of back tension, on the material response during the whole process is numerically assessed.
MC-Sim: an efficient simulation tool for MPSoC designs
Authors: Jason Cong, Karthik Gururaj, Guoling Han, Adam Kaplan, Mishali Naik, Glenn Reinman
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The ability to integrate diverse components such as processor cores, memories, custom hardware blocks and complex network-on-chip (NoC) communication frameworks onto a single chip has greatly increased the design space available for system-on-chip (SoC) designers. Efficient and accurate performance estimation tools are needed to assist the designer in making design decisions. In this paper, we present MC-Sim, a heterogeneous multi-core simulator framework which is capable of accurately simulating a variety of processor, memory, NoC configurations and application specific coprocessors. We also describe a methodology to automatically generate fast, cycle-true behavioral, C-based simulators for coprocessors using a high-level synthesis tool and integrate them with MC-Sim, thus augmenting it with the capacity to simulate coprocessors. Our C-based simulators provide on an average 45x improvement in simulation speed over that of RTL descriptions. We have used this framework to simulate a number of real-life applications such as the MPEG4 decoder and litho-simulation, and experimented with a number of design choices. Our simulator framework is able to accurately model the performance of these applications (only 7% off the actual implementation) and allows us to explore the design space rapidly and achieve interesting design implementations
Shrinkage estimation in general linear models
Authors: Lihua An, Sévérien Nkurunziza, Karen Y. Fung, Daniel Krewski, Isaac Luginaah
Venue: Computational Statistics Data Analysis (2009)

We propose a James-Stein-type shrinkage estimator for the parameter vector in a general linear model when it is suspected that some of the parameters may be restricted to a subspace. The James-Stein estimator is shown to demonstrate asymptotically superior risk performance relative to the conventional least squares estimator under quadratic loss. An extensive simulation study based on a multiple linear regression model and a logistic regression model further demonstrates the improved performance of this James-Stein estimator in finite samples. The application of this new estimator is illustrated using Ontario newborn infants data spanning four fiscal years.
Statistical analysis of on-chip power grid networks by variational extended truncated balanced realization method
Authors: Duo Li, Sheldon X.-D. Tan, Gengsheng Chen, Xuan Zeng
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we present a novel statistical analysis approach for large power grid network analysis under process variations. The new algorithm is very efficient and scalable for huge networks with a large number of variational variables. This approach, called varETBR for variational extended truncated balanced realization, is based on model order reduction techniques to reduce the circuit matrices before the variational simulation. It performs the parameterized reduction on the original system using variation-bearing subspaces. varETBR calculates variational response Gramians by Monte-Carlo based numerical integration considering both system and input source variations for generating the projection subspace. varETBR is very scalable for the number of variables and is flexible for different variational distributions and ranges as demonstrated in experimental results. After the reduction, Monte-Carlo based statistical simulation is performed on the reduced system and the statistical responses of the original system are obtained thereafter. Experimental results, on a number of IBM benchmark circuits [15] up to 1.6 million nodes, show that the varETBR can be 4500X faster than the Monte-Carlo method and is much more scalable than one of the recently proposed approaches.
Fast Frame-Based Scene Change Detection in the Compressed Domain for MPEG-4 Video
Authors: Jens Brandt, Jens Trotzky, Lars Wolf
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Detection of scene changes is an elementary step in automatic video processing like indexing, segmentation or transcoding. Video indexing and segmentation allow fast browsing without decoding the complete video. In the case of transcoding, the information about scene changes such as cuts and fades as well as about special movements like rotations or zooms in video frames is helpful to determine suitable transcoding parameters. In the compressed domain only information about DCT values as well as motion information can be used to determine such scene changes and movements. Therefore we defined different measures which use the encoded DCT values and motion vectors of each compressed frame. Based on these measures as well as on motion vector histograms we present a fast approach to detect different kinds of scene changes and special movements in MPEG-4 videos in the compressed domain.
Analytical Model for Expected Packet Delay Evaluation in IEEE 802.11e
Authors: Aphirak Jansang, Anan Phonphoem, Béatrice Paillassa
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

IEEE 802.11e has been released to provide Quality of Service (QoS) support for Wireless LAN. The Call Admission Control (CAC) reference scheme in HCF Controlled Channel Access (HCCA) supports only Constant Bit Rate (CBR) traffic. In this paper, a queueing analytical model for evaluating the expected packet delay of Variable Bit Rate (VBR) has been proposed. The numerical results show that regular acceptance method cannot guarantee the QoS. The paper also shows that accepting a VBR flow with a small amount over mean data rate should be able to handle the problem without degradation of accepted flows.
Remote experimentation system on industrial controllers
Authors: A. Etxebarria, R. Bárcena, J. J. Valera
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Nowadays, it is frequent that engineering companies use Internet as the main working environment for the complementary services offered to their customers. Furthermore, Internet allow the development of powerful tools dedicated to the remote maintenance, on-line supervision and performance optimisation of the industrial machinery. In this paper, a extensive set of complementary services via Internet denominated IngeRAS™ that provide rapid and effective access to industrial machinery, supplied by the Basque company Ingelectric S. A., is described. Additionally, a new remote system dedicated to the hardware-in-the-loop (HIL) experimentation concerning the optimisation of the performance of industrial controllers installed by the company, is presented. Such a system, now under construction, exploits the rapid prototyping strategy of real-time computer controlled systems and is expected to be added to IngeRAS™ in the near future in order to be used remotely by the engineers by means of virtual instrumentation.
Enhancing the Stability of Spectral Ordering with Sparsification and Partial Supervision: Application to Paleontological Data
Authors: Dimitrios Mavroeidis, Ella Bingham
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Recent studies have demonstrated the prospects of data mining algorithms for addressing the task of seriation in paleontological data (i.e. the age-based ordering of the sites of excavation). A prominent approach is spectral ordering that computes a similarity measure between the sites and orders them such that similar sites become adjacent and dissimilar sites are placed far apart. In the paleontological domain, the similarity measure is based on the mammal genera whose remains are retrieved at each site of excavation. Although spectral ordering achieves good performance in the seriation task, it ignores the background knowledge that is naturally present in the domain, as paleontologists can derive the ages of the sites of excavation within some accuracy. On the other hand, the age information is uncertain, so the best approach would be to combine the background knowledge with the information on mammal co-occurrences. Motivated by this kind of partial supervision we propose a novel semi-supervised spectral ordering algorithm. Our algorithm modifies the Laplacian matrix used in spectral ordering, such that domain knowledge of the ordering is taken into account. Also, it performs feature selection (sparsification) by discarding features that contribute most to the unwanted variability of the data in bootstrap sampling. The theoretical properties of the proposed algorithm are thoroughly analyzed and it is demonstrated that the proposed framework enhances the stability of the spectral ordering output and induces computational gains.
Influence of the traffic engineering scheme and QoS in the dimensioning of broadband access networks
Authors: L. Rodríguez de lope, A. E. García, K. Hackbarth
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

Most network operators and Internet Service providers are offering "Triple Play" products that integrate several services with different QoS requirements, but current dimensioning methods do not have mechanisms to guarantee the QoS of certain services maximizing the usage degree of the network elements. This paper analyses three traffic engineering methods: Over-engineering, separate virtual tunnels and priority queuing, and provides a model based on a G/G/1 queuing system for the dimensioning of a network element maximizing the number of users aggregated considering the QoS requirements of the different services offered. The model is applied to the dimensioning of a connection in an NGN based aggregation network and analyses the influence of the traffic engineering method in the dimensioning of the network.
M-solid varieties of languages
Authors: Pedro Baltazar
Venue: Acta Cybernetica (2008)

In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of pseudovarieties corresponds to a complete sublattice of language varieties, as well as another one of congruence varieties. For the varieties of tree language, we present the complete sublattices of varieties of languages and the complete sublattice of varieties of congruences isomorphic to the complete sublattice of all M-solid pseudovarieties.
Study of the method of steam wetness measuring by laser scattering devices
Authors: Guizhen He, Haibo Liu, Huimin Zhou, Chengqiang Mei
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, the moisture measurement in LP cylinder of turbine had been reported by Laser light scattering Mie Theory. A method of inversion for data-fitting had been used based on the phase-function curves by calculating Mie scattering coefficient. And the influence of the real part and imaginary part of optical refractive index had been researched. We reported a sensitive light scattering structure and a circuit design for detecting wetness in turbine. The paper's finding laid the theoretical and experimental basis for further research and design of integrated intelligent sensor system. A new method of detecting online for the vapor-liquid two-phase flow of moisture vapor content has been provided to solving the technological problems of the wetness measuring of the enthalpy - entropy map.
Large time behavior of solutions and finite difference scheme to a nonlinear integro-differential equation
Authors: Temur Jangveladze, Zurab Kiguradze, Beny Neta
Venue: Computers Mathematics with Applications (2009)

The large-time behavior of solutions and finite difference approximations of the nonlinear integro-differential equation associated with the penetration of a magnetic field into a substance are studied. Asymptotic properties of solutions for the initial-boundary value problem with homogeneous Dirichlet boundary conditions is considered. The rates of convergence are given too. The convergence of the semidiscrete and the finite difference schemes are also proved.
Routing Protocol of Semantics-Based Publish/Subscribe Systems over Kademlia Network
Authors: Wen Zhao, Dianxing Liu, Xueyang Liu, Kaimu Huang, Lifu Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Based on the routing protocol of Kademlia network and the characteristics of semantics-based publish/subscribe systems, a new type of routing protocol for semantics-based publish/subscribe systems is designed, which is called intersection concept based routing protocol (ICBRP). In ICBRP, user's subscriptions are classified by minimal intersection concepts and one type of subscriptions is forwarded to the event brokers taking charge of this type. Since event publishing is also based on intersection concepts, every event can be forwarded to the brokers storing the subscriptions which the event may be matched with, and the events is able to be forwarded to all the interested subscribers. The result of simulation experiments shows that the performance of our routing protocol can satisfy the need of application.
Where Do We Grasp Objects? --- An Experimental Verification of the Selective Attention for Action Model (SAAM)
Authors: Christoph Böhme, Dietmar Heinke
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Classically, visual attention is assumed to be influenced by visual properties of objects, e.g. as assessed in visual search tasks. However, recent experimental evidence suggests that visual attention is also guided by action-related properties of objects ("affordances",[1,2]), e.g. the handle of a cup affords grasping the cup; therefore attention is drawn towards the handle (see [3] for example). In a first step towards modelling this interaction between attention and action, we implemented the Selective Attention for Action model (SAAM). The design of SAAM is based on the Selective Attention for Identification model (SAIM [4]). For instance, we also followed a soft-constraint satisfaction approach in a connectionist framework. However, SAAM's selection process is guided by locations within objects suitable for grasping them whereas SAIM selects objects based on their visual properties. In order to implement SAAM's selection mechanism two sets of constraints were implemented. The first set of constraints took into account the anatomy of the hand, e.g. maximal possible distances between fingers. The second set of constraints (geometrical constraints) considered suitable contact points on objects by using simple edge detectors. At first, we demonstrate here that SAAM can successfully mimic human behaviour by comparing simulated contact points with experimental data. Secondly, we show that SAAM simulates affordance-guided attentional behaviour as it successfully generates contact points for only one object in two-object images.
Dynamic mapping of physical controls for tabletop groupware
Authors: Rebecca Fiebrink, Dan Morris, Meredith Ringel Morris
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Multi-touch interactions are a promising means of control for interactive tabletops. However, a lack of precision and tactile feedback makes multi-touch controls a poor fit for tasks where precision and feedback are crucial. We present an approach that offers precise control and tactile feedback for tabletop systems through the integration of dynamically re-mappable physical controllers with the multi-touch environment, and we demonstrate this approach in our collaborative tabletop audio editing environment. An observational user study demonstrates that our approach can provide needed precision and feedback, while preserving the collaborative benefits of a shared direct-manipulation surface. Our observations also suggest that direct touch and physical controllers can offer complementary benefits, and that providing both allows users to adjust their control strategy based on considerations including precision, convenience, visibility, and user role.
Robust layer assignment for via optimization in multi-layer global routing
Authors: Tsung-Hsien Lee, Ting-Chi Wang
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

In this paper, we study a layer assignment problem which arises during multi-layer global routing. Our layer assignment problem takes the total wire overflow and the maximum wire overflow of a given 2D global routing solution to form the wire congestion constraints, and asks to find a 3D counterpart through layer assignment such that the total via overflow and the total via count of the 3D result are both as small as possible while the wire congestion constraints are satisfied. To solve this layer assignment problem, we present an algorithm which first determines a net order, then applies a dynamic programming technique to perform layer assignment in a net-by-net manner according to the net order, and finally refines the solution iteratively until convergence. Our algorithm is guaranteed to always generate a layer assignment solution satisfying the wire congestion constraints. We tested our layer assignment algorithm on the ISPD'07 and ISPD'08 benchmarks and the results are very encouraging.
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
Authors: Bassem Jarboui, Mansour Eddaly, Patrick Siarry
Venue: Computers and Operations Research (2009)

In this work we propose an estimation of distribution algorithm (EDA) as a new tool aiming at minimizing the total flowtime in permutation flowshop scheduling problems. A variable neighbourhood search is added to the algorithm as an improvement procedure after creating a new offspring. The experiments show that our approach outperforms all existing techniques employed for the problem and can provide new upper bounds.
A Study on Information Throughput of Inter-vehicle Communications in a Unidirectional Traffic Stream
Authors: Zhe Wang, Wei Lu, Wenlong Jin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Inter-vehicle communications (IVC) based on mobile ad hoc networks have drawn increasing research interests in recent years. In this paper, we study throughput in an IVC system along a unidirectional traffic for different traffic conditions and transmission ranges of wireless units. Here, whether a vehicle is equipped or not is random, and the probability is assumed to be the market penetration rate. We first briefly introduce the communication performance measures and our simulation platform based on network simulator 2 and traffic flow theories. We then present Monte Carlo simulation results of communication performance measures for traffic flows of two congestion levels, information source and destination at different distances, and three transmission ranges. We compare our results with those obtained through simple connectivity analysis and find that the results are consistent for low connectivity, but the throughputs by ns-2 simulations are significantly lower than the theoretical results, due to packet losses caused by signal interferences. Together with further investigations, the study could be helpful for determining and designing appropriate communication hardware and software and intelligent transportation applications.
Interactive Video Description on the Network
Authors: Tomoyuki Yatabe, Hiroshi Kawasaki, Masao Sakauchi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Owing to the recent development of digital broadcasting technology such as Satellite, CATV, the Internet and the expansion of the network systems, the amount of video data we can obtain is increasing day by day. In this paper, we propose Advanced Database TV (ADTV), an interactive video database system which lets us share video data on the network, as an application for future Interactive TV service. We propose an interactive video database system to process real-world video data as a further example of ADTV. On its implementation, we propose an automatic organization method focusing on video objects in each frames to describe video data in an efficient way. The prototype system provide three basic services, "Description", "Question and Answer" and "Image and Information Retrieval", about buildings as real-world video objects linked with digital city maps.
Enhancing network based intrusion detection for imbalanced data
Authors: Vegard Engen, Jonathan Vincent, Keith Phalp
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

The application of machine learning to intrusion detection has been researched for several decades, however, with varying degrees of success. This paper focuses on two common techniques: Multi Layer Perceptrons (MLPs) and Decision Trees (DTs). Previous research on these techniques has produced contradictory results concerning their ability to detect particular classes of intrusion. Some of these contradictions are argued to be a result of properties of the data set used for empirical study, the KDD Cup '99 data set, which poses several challenges to learning algorithms. One particular challenge is considered here, learning from imbalanced data, which is an intrinsic problem to intrusion detection. Empirical results show that both the DT and MLP trained with back propagation obtain very poor classification rates of the minor classes, particularly U2R (User to Root) intrusions; the MLP often being unable to detect this class. An evolutionary neural network is employed, in which several evaluation functions are examined. Two general fitness measures are used, which lead to similar behaviour to training an MLP with back propagation. However, when employing evaluation functions that calculate the fitness proportionally to the instances of each class, thereby avoiding a bias towards the major class(es) in the data set, significantly improved true positive rates are obtained whilst maintaining a low false positive rate.