ppxscal/embedding_network huggingface dataset:
Surface preparation and coating of metal coils by using a fully integrated manufacturing system
Authors: M. Barletta, L. Santo, V. Tagliaferri
Venue: International Journal of Computer Integrated Manufacturing (2007)

The current paper deals with the definition of a novel fully integrated system for cleaning, pre-treatment and powder coating of metal coils based upon two subsequent fluidized beds: the former employed in items surface preparation by peening with glass beads and the latter in coating process by electrostatic deposition. An approach based upon design of experiments was employed to find the best processing windows for each phase of coil coating processes. Besides, the experimental trends of operative parameters were also sought. Special attention was paid to the influence of leading process parameters on the performance of the starting surface as well as on the aesthetic aspect and some functional properties of the polymeric coatings. Finally, some useful aspects concerning the best way to lead the process were also discussed in detail.
Dynamic Programming and Optimal Control, Vol. II, 3rd edition
Authors: Dimitri P. Bertsekas
Venue:  (2007)

A major revision of the second volume of a textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization. The second volume is oriented towards mathematical analysis and computation, and treats infinite horizon problems extensively. New features of the 3rd edition are: 1) A major enlargement in size and scope: the length has increased by more than 50%, and most of the old material has been restructured and/or revised. 2) Extensive coverage (more than 100 pages) of recent research on simulation-based approximate dynamic programming (neuro-dynamic programming), which allow the practical application of dynamic programming to large and complex problems. 3) An in-depth development of the average cost problem (more than 100 pages), including a full analysis of multichain problems, and an extensive analysis of infinite-spaces problems. 4) An introduction to infinite state space stochastic shortest path problems. 5) Expansion of the theory and use of contraction mappings in infinite state space problems and in neuro-dynamic programming. 6) A substantive appendix on the mathematical measure-theoretic issues that must be addressed for a rigorous theory of stochastic dynamic programming. Much supplementary material can be found in the book's web page: http://www.athenasc.com/dpbook.html
Performance Analysis of Active Target Localization Using TDOA and FDOA Measurements in WSN
Authors: Jiandong Li, Xiaoyan Sun, Pengyu Huang, Jiyong Pang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Target localization is one of the basic functions of wireless sensor networks. In the target localization algorithms, the problem of how many sensors are needed and how they are deployed is what we are concerned about in this paper. The authors of [5] present the mathematical expression of Cramer-Rao lower bound for the localization error, which is the smallest lower bound of any unbiased estimation. However, it is difficult to be used to find out the relation between sensor number and Cramer-Rao lower bound directly. In this paper the relation between sensor number and Cramer-Rao lower bound is revealed by simulation. And how the topology affects the Cramer-Rao lower bound is also presented.
Cooperation Forensic Computing Research
Authors: Youdong Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The network forensic computing is faced with the question of the complex network intrusion analyses. So a new concept of cooperation forensic computing is defined. Through to extend the theory of function dependency, a new method called probability function dependency relationships is proposed. Combined it with the Bayesian network and K2 algorithm, the network forensic computing algorithm called CFA is proposed. For the complex network attack, CFA is able to synthesize the various forensic data resource to reappearance the crime scenario intuitionally and realize the network forensic analysis effectively.
Conditional ordering of generalized order statistics revisited
Authors: Hongmei Xie, Taizhong Hu
Venue: Probability in the Engineering and Informational Sciences (2008)

In this article we investigate less restrictive conditions on the model parameters that enable one to establish the likelihood ratio ordering of one generalized order statistic by conditioning on the right tail of another lower-indexed generalized order statistic. One application of the main results is also presented.
Rich Internet Applications (RIA): AJAX, Ruby on Rails, and PHP: tutorial presentation
Authors: Jithika Thomas
Venue: Journal of Computing Sciences in Colleges (2008)

This tutorial covers dynamic Web applications evelopment with markup languages (XHTML, DHTML, XML), scripting languages (JavaScript, PHP, Ruby on Rails), and AJAX. RIAs (Rich Internet Applications) are applications that offer the responsiveness, rich features, and functionality of desktop applications. RIAs typically transfer the processing necessary for the user interface to the Web client but keep the bulk of the data (i.e., maintaining the state of the program, the data etc) back on the application server.
The gap in circumventing the impossibility of consensus
Authors: Rachid Guerraoui, Petr Kuznetsov
Venue: Journal of Computer and System Sciences (2008)

The impossibility of reaching deterministic consensus in an asynchronous and crash prone system was established for a weak variant of the problem, usually called weak consensus, where a set of processes need to decide on a common value in {0,1}, so that both 0 and 1 are possible decision values. On the other hand, approaches to circumventing the impossibility focused on a stronger variant of the problem, called consensus, where the processes need to decide on one of the values they initially propose (0 or 1). This paper studies the computational gap between the two problems. We show that any set of deterministic object types that, combined with registers, implements weak consensus, also implements consensus. Then we exhibit a non-deterministic type that implements weak consensus, among any number of processes, but, combined with registers, cannot implement consensus even among two processes. In modern terminology, this type has consensus power 1 and weak consensus power ~.
Toward stochastic anatomy of inter-meeting time distribution under general mobility models
Authors: Han Cai, Do Young Eun
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling and its effect on the network performance. Existing studies on this problem via the average inter-meeting time become insufficient when the inter-meeting time distribution starts to deviate from exponential one. This insufficiency necessarily leads to the increasing difficulty in the performance analysis of forwarding algorithms in mobile ad-hoc networks (MANET). In this paper, we analyze the effect of mobility patterns on the inter-meeting time distribution. We first identify the critical timescale in the inter-meeting distribution, at which the transition from power-law to exponential takes place, in terms of the domain size and the statistics of the mobility pattern. We then prove that stronger correlations in mobility patterns lead to heavier (non-exponential) 'head' of the inter-meeting time distribution. We also prove that there exists an invariance property for several contact-based metrics such as inter-meeting, contact, inter-any-contact time under both distance-based (Boolean) and physical interference (SINR) based models, in that the averages of those contact-based metrics do not depend on the degree of correlations in the mobility patterns. Our results collectively suggest a convex ordering relationship among inter-meeting times of various mobility models indexed by their degrees of correlation, which is in good agreement with the ordering of network performance under a set of mobility patterns whose inter-meeting time distributions have power-law 'head' followed by exponential 'tail'.
Video enhancement using reference photographs
Authors: Cosmin Ancuti, Tom Haber, Tom Mertens, Philippe Bekaert
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Digital video cameras are becoming commonplace in many households, but they still leave something to be desired in terms of image quality. Their poor light sensitivity make images noisy and blurry, and internal storage bandwidth limits the frame resolution. We present a technique for enhancing a low quality video sequence, using a set of high quality reference photographs, taken of the same scene. Our technique generates a high quality frame by copying information from the photographs in a patch-wise fashion. The copying is guided by a sparse set of reliable correspondences between the video frames and photographs. Our technique is purely image-based, and does not require depth estimation. A robust descriptor is employed for establishing valid matches between the video frames and the photographs. Then, the geometric transformation is estimated between every corresponding patch. With only a few reference photographs, we are able to reduce noise and motion blur, and more important, increase resolution by a factor of 6 (see Fig. 1).
Correct Microkernel Primitives
Authors: Artem Starostin, Alexandra Tsyban
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Primitives are basic means provided by a microkernel to implementors of operating system services. Intensively used within every OS and commonly implemented in a mixture of high-level and assembly programming languages, primitives are meaningful and challenging candidates for formal verification. We report on the accomplished correctness proof of academic microkernel primitives. We describe how a novel approach to verification of programs written in C with inline assembler is successfully applied to a piece of realistic system software. Necessary and sufficient criteria covering functional correctness and requirements for the integration into a formal model of memory virtualization are determined and formally proven. The presented results are important milestones on the way to a pervasively verified operating system.
Innovative Test Solutions for Pin-Limited Microcontrollers
Authors: Matthew G. Stout, Kenneth P. Tumin
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A scan-based test methodology was adopted for the Freescale S08 and RS08 (8-bit) families of microcontrollers (MCUs) several years ago. This methodology has been shown to provide high quality testing and is an important part of Freescale’s “ZeroDefect” initiative. One of the difficult restrictions placed on these families of products is the requirement for applications requiring very few pins. For instance, the 9S08QG8 MCU is available in an 8-pin package, and the 9S08KA2 MCU is available in a 6-pin package. Because of these packaging requirements, several test methods have been developed to implement scan-based testing using very few pins. The methods include full single scan chain testing, an internally-generated reset (no dedicated reset pin), test mode latching with no dedicated test mode pins, IDDQ measurement using a single power supply, an indirect method for verifying correct mode entry, and pin multiplexing that combines several signals required for scan-based testing.
Approximate autoregressive modeling for network attack detection
Authors: Harshit Nayyar Ali A. Ghorbani
Venue: Journal of Computer Security (2008)

This paper presents a technique for creating an ARX model of network signals and using it for detecting network anomalies caused by intrusions. Network signals are non-stationary, highly volatile and hard to model using traditional methods. We present our own modeling technique using a combination of system identification theory and wavelet approximation. We also present the results of a prototype implementation applied to 1999 DARPA intrusion detection evaluation data set. We verify that the technique is viable for anomaly based intrusion detection and can contribute to defense in depth in a network. The technique proposed is online, generic and can be used with many other network signals like bandwidth consumption, rate of flow arrival or SNMP variables. Moreover, it requires minimal expertise for use on the part of the network administrator and automatically adapts to the underlying network behavior.
The DBO database system
Authors: Florin Rusu, Fei Xu, Luis Leopoldo Perez, Mingxi Wu, Ravi Jampani, Chris Jermaine, Alin Dobra
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We demonstrate our prototype of the DBO database system. DBO is designed to facilitate scalable analytic processing over large data archives. DBO's analytic processing performance is competitive with other database systems; however, unlike any other existing research or industrial system, DBO maintains a statistically meaningful guess to the final answer to a query from start to finish during query processing. This guess may be quite accurate after only a few seconds or minutes, while answering a query exactly may take hours. This can result in significant savings in both user and computer time, since a user can abort a query as soon as he or she is happy with the guess' accuracy.
The contradictory nature of knowledge: a challenge for understanding innovation in a local context and workplace development and for doing action research
Authors: Hans Chr Garmann Johnsen, James Karlsen, Roger Normann, Jens Kristian Fosse
Venue: AI Society (2008)

The argument in this article is that knowledge is an important phenomenon to understand in order to discuss development and innovation in modern workplaces. Predominant theories on knowledge in organisation and innovation literature, we argue, are based on a dualist concept of knowledge. The arguments found in these theories argue for one type of knowledge in contrast to another. The most prevailing dualism is that between local and universal knowledge. We believe that arguing along this line does not bring us further in order to understand what knowledge is and what it does. We argue that there are contradictory arguments in the dualist conception of knowledge. We discuss how to move beyond this. We present a framework for discussing what knowledge is. We discuss what type of meta perspective will allow us to compare different knowledge kinds. We argue that insight into this has implications for understanding knowledge generation and innovation.
Reconfigurable architecture for network flow analysis
Authors: S. Yusuf, W. Luk, M. Sloman, N. Dulay, E. C. Lupu, G. Brown
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper describes a reconfigurable architecture based on field-programmable gate-array (FPGA) technology for monitoring and analyzing network traffic at increasingly high network data rates. Our approach maps the performance-critical tasks of packet classification and flow monitoring into reconfigurable hardware, such that multiple flows can be processed in parallel We explore the scalability of our system, showing that it can support flows at multi-gigabit rate; this is faster than most software-based solutions where acceptable data rates are typically no more than 100 million bits per second.
Type-2 Fuzzy System Based Blood Pressure Parameters Estimation
Authors: Moha'med O. Al-Jaafreh, Adel A. Al-Jumaily
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Blood pressure parameters (BPPs); Systolic, Diastolic and Mean Blood Pressures, have high correlation relationship with heart rate( HR), but this relationship is nonlinear, multimode, and ambiguity. Type-2 Fuzzy system has capability to deal with high uncertainty problems and is utilized to deal with BPPs and HR relationship.This paper presents an Interval Type-2 Fuzzy System to estimate Systolic, Diastolic and Mean blood pressures; based on the relationship between systolic, diastolic and mean blood pressures and heart rate. The estimated systolic, diastolic and mean blood pressures’ values are compared with real reading of systolic, diastolic and mean blood pressure. Very encouraging results have achieved; the absolute value of mean of difference between real systolic, diastolic and mean blood pressures and estimated values are less than 5 mmHg.
Measurement of 3D foot shape deformation in motion
Authors: Makoto Kimura, Masaaki Mochimaru, Takeo Kanade
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

Recently, techniques for measuring and modeling of human body are recieving attention, because human models are useful for ergonomic design in manufacturing. We aim to accurately measure the dynamic shape of human foot in motion (i.e. walking or running). Such measurement is profitable for shoe design and sports analysis. In this paper, a projector-camera system is proposed to measure the shape of the naked foot while walking or running. A characteristic pattern is set on the projector, so that correspondence between the projection pattern and the camera captured image can be solved easily. Because pattern switching is not required, the system can measure foot shape even when the foot is in motion. The proposed method trades "density of measurement" for "stability of matching", but the reduced density is sufficient for our purpose.
Color and Position versus Texture Features for Endoscopic Polyp Detection
Authors: Luís A. Alexandre, Nuno Nobre, João Casteleiro
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper presents a comparison of texture based and color and position based methods for polyp detection in endoscopic video images.Two methods for texture feature extraction that presented good results in previous studies were implemented and their performance is compared against a simple combination of color and position features. Although this more simple approach produces a much higher number of features than the other approaches, a SVM with a RBF kernel is able to deal with this high dimensional input space and it turns out that it outperforms the previous approaches on the experiments performed in a database of 4620 images from endoscopic video.
Beyond the screen: designing immersive collaborative experiences for children through digital and physical interaction
Authors: Julia Frederking, Michael Cruz, Mark Baskinger, Kees Overbeeke
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

This paper summarizes key points and findings of an interaction design research project coordinated between Carnegie Mellon University's School of Design (USA) and Technische Universiteit Eindhoven (The Netherlands). The interactive system concept introduced in this paper reflects focused research on collaborative play and presents an opportunity for children of various ages to cooperatively explore shape grammar, cause and effect, and story telling through interdependent digital and physical interaction. This concept named "Lila," embodies the notion of "purposeless play," and promotes inquiry, spontaneity, and causality as children explore the relationships of physical components with their subsequent digital visualizations. "Lila" is a continuing research project that serves as a link to joint ventures between these two universities that deal with digital interaction beyond a screenbased format.
Fast estimation of first-order clause coverage through randomization and maximum likelihood
Authors: Ondřej Kuželka, Filip Železný
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In inductive logic programming, &theta;-subsumption is a widely used coverage test. Unfortunately, testing &theta;-subsumption is NP-complete, which represents a crucial efficiency bottleneck for many relational learners. In this paper, we present a probabilistic estimator of clause coverage, based on a randomized restarted search strategy. Under a distribution assumption, our algorithm can estimate clause coverage without having to decide subsumption for all examples. We implement this algorithm in program ReCovEr. On generated graph data and real-world datasets, we show that ReCovEr provides reasonably accurate estimates while achieving dramatic runtimes improvements compared to a state-of-the-art algorithm.
A Common Function of Different Union Bounds for Optimization and BER Evaluation of Space---Time codes
Authors: Z. Zhang, X. G. Dai, S. W. Cheung, T. I. Yuk
Venue: Wireless Personal Communications: An International Journal (2008)

Optimizing Space-Time (S---T) codes, in terms of minimum error rates, based on Union bounds often produces results which vary with signal-to-noise ratio (SNR) and so are not easy to use. Error-rate evaluation of S---T codes using Union bounds sometimes requires very heavy computational loads and so is impractical. In this paper, a Common function shared by different Union bounds is derived and proposed for optimization of S---T codes. The Common function produces the optimization results which are SNR independent and so requires a substantially lower computation load. Results of Monte-Carlo simulation on two 2 × 2 rotation-based diagonal S---T codes (D codes) and two Linear-Dispersion codes (LDCs) show that the bit-error-rate (BER) performances using the optimization results based on the Common function, the exact Union bound (EUB) and Chernoff Union bound (CUB) are all nearly identical. The Common function is subsequently used to develop a modified Union bound (MUB) and modified Chernoff Union bound (MCUB). Results of numerical calculations show that the MUB can provide a good compromise between the accuracy and computational load for BER evaluation.
Towards development of a 3-state self-paced brain-computer interface
Authors: Ali Bashashati, Rabab K. Ward, Gary E. Birch
Venue: Computational Intelligence and Neuroscience (2007)

Most existing brain-computer interfaces (BCIs) detect specific mental activity in a so-called synchronous paradigm. Unlike synchronous systems which are operational at specific system-defined periods, self-paced (asynchronous) interfaces have the advantage of being operational at all times. The low-frequency asynchronous switch design (LF-ASD) is a 2-state self-paced BCI that detects the presence of a specific finger movement in the ongoing EEG. Recent evaluations of the 2-state LF-ASD show an average true positive rate of 41% at the fixed false positive rate of 1%. This paper proposes two designs for a 3-state self-paced BCI that is capable of handling idle brain state. The two proposed designs aim at detecting right- and left-hand extensions from the ongoing EEG. They are formed of two consecutive detectors. The first detects the presence of a right- or a left-hand movement and the second classifies the detected movement as a right or a left one. In an offline analysis of the EEG data collected from four able-bodied individuals, the 3-state brain-computer interface shows a comparable performance with a 2-state system and significant performance improvement if used as a 2-state BCI, that is, in detecting the presence of a right- or a left-hand movement (regardless of the type of movement). It has an average true positive rate of 37.5% and 42.8% (at false positives rate of 1%) in detecting right- and left-hand extensions, respectively, in the context of a 3-state self-paced BCI and average detection rate of 58.1% (at false positive rate of 1%) in the context of a 2-state self-paced BCI.