ppxscal/embedding_network huggingface dataset:
Simulation Research on Coupling Vibration of Tramcar-Track
Authors: Wenhai He
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Tramcar is important railway conveying equipment in acclivitous shaft of mine. During conveying, tramcar and track often vibrate because there are some excitements. Intensive vibration often causes run-away tramcar accident, and causes deformation of tramcar body. The present paper develops a coupling vibration model to analyze the vibration characteristics of tramcar and track when tramcar goes through a step between two tracks. In the present paper, tramcar is regarded as two degrees of freedom spring-mass-damper model. And, the Bernoulli-Euler beam locating on continuous and elastic ballast is used as the mechanical model of track. The tramcar and the track couple each other by the nonlinear contact force existing between the wheels of the tramcar and the track. The vertical vibration of the tramcar body and the transversal vibration of the track are simulated dynamically. The coupling vibration characteristics of the tramcar and the track are obtained based on this simulation. The wheel/track impaction force and the vibration amplitude of the tramcar body are controlled if the velocity of the tramcar is 1.5m/s.
Computing professionals in e-governance: policy implications
Authors: P. Vigneswara Ilavarasan, C. M. Malish
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

If a health care delivery system can be compared to e-governance system, computing personnel can be equated with the medical practitioners. Extant literature on professional status of computing workforce is inadequate, especially in the context of e-governance. Present paper fills the gap by examining the Indian computing workforce. Four questions were delineated from the literature and examined using primary and secondary empirical data from India. The study indicates that the computing practice is an occupation not a profession, and discusses the policy implications.
The Price of Resiliency: a Case Study on Sorting with&#x00a0;Memory Faults
Authors: Umberto Ferraro-Petrillo, Irene Finocchi, Giuseppe F. Italiano
Venue: Algorithmica (2009)

We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and on the running times of mergesort-based algorithms. To achieve this goal, we develop a software testbed that simulates different fault injection strategies, and perform a thorough experimental study using a combination of several fault parameters. Our experiments give evidence that simple-minded approaches to this problem are largely impractical, while the design of more sophisticated resilient algorithms seems really worth the effort. Another contribution of our computational study is a carefully engineered implementation of a resilient sorting algorithm, which appears robust to different memory fault patterns.
A Neural Network-Based Approach to Identifying Out-of-Control Variables for Multivariate Control Charts
Authors: Yuehjen E. Shao, Chien-Ho Wu, Bih-Yih Ho, Bo-Sheng Hsu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In practice, many process monitoring and control scenarios involve several related variables. However one of the major problems that arise in using a multivariate control chart is the interpretation of out-of-control signals. Although RAM method is a popular approach for interpreting multivariate control chart signals, the accuracy of this method decreases as the number of out-of-control variables increases. In this paper, we proposed a new approach for multivariate control chart interpretation based on the idea of integrating neural network technology and RAM method. In many multivariate control scenarios, simulation results show that the proposed approach out-performs RAM method.
An algebra of quantum processes
Authors: Mingsheng Ying, Yuan Feng, Runyao Duan, Zhengfeng Ji
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of qCCS is presented in terms of (nonprobabilistic) labeled transition systems. Strong bisimulation between processes modeled in qCCS is defined, and its fundamental algebraic properties are established, including uniqueness of the solutions of recursive equations. To model sequential computation in qCCS, a reduction relation between processes is defined. By combining reduction relation and strong bisimulation we introduce the notion of strong reduction-bisimulation, which is a device for observing interaction of computation and communication in quantum systems. Finally, a notion of strong approximate bisimulation (equivalently, strong bisimulation distance) and its reduction counterpart are introduced. It is proved that both approximate bisimilarity and approximate reduction-bisimilarity are preserved by various constructors of quantum processes. This provides us with a formal tool for observing robustness of quantum processes against inaccuracy in the implementation of its elementary gates.
A Development of the TFT-LCD Image Defect Inspection Method Based on Human Visual System
Authors: Jong-Hwan Oh, Byoung-Ju Yun, Se-Yun Kim, Kil-Houm Park
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The TFT-LCD image has non-uniform brightness that is the major difficulty of finding the visible defect called Mura in the field. To facilitate Mura detection, background signal shading should level off and Mura signal must be amplified. In this paper, Mura signal amplification and background signal flattening method is proposed based on human visual system (HVS). The proposed DC normalized contrast sensitivity function (CSF) is used for the Mura signal amplification and polynomial regression (PR) is used to level off the background signal. In the enhanced image, tri-modal thresholding segmentation technique is used for finding Dark and White Mura at the same time. To select reliable defect, falsely detected invisible region is eliminated based on Weber's Law. By the experimental results of artificially generated 1-d signal and TFT-LCD image, proposed algorithm has novel enhancement results and can be applied to real automated inspection system.
Modelling time in protensional agents
Authors: Alexandru V. Georgescu, Boldur E. Barbat
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Starting from the assumption that a powerful temporal dimension is mandatory for bodiless agents (the rationale and approach is in three recent papers), the target is to develop agent-oriented mechanisms able to implant relevant temporal aspects into generic agent architectures. To be credible, such mechanisms must be validated in experimental models with two roles: a) serve as test-bench for long-range research undertakings (e.g., emulating agent self-awareness); b) set up a framework for designing non-trivial applications (e.g., virtual musicologist) in a dynamic domain (sound-based messages). The paper presents the second model of an agent that is able to interpret protensity-based messages, designed to act as an e-maieut (i.e. virtual guitar teacher). The approach is based on theories of internal representations of external objects (because protensity-based messages are treated as such objects). The focus is on mechanism effectiveness: the agent treats limited aspects of sounds involved in playing guitar (correctness of the scales played by the learner, freely or in the context of various chord progressions).
Adobe Fireworks CS4 How-Tos: 100 Essential Techniques, 1 edition
Authors: Jim Babbage
Venue:  (2008)

Adobe Fireworks CS4 is back and better than ever. Completely revamped for inclusion in the Adobe Creative Suite, Fireworks is now positioned to be an integral part of Adobe's Web workflow. Designed for manipulating images destined for the Web and developing rapid Web prototypes, Fireworks lets Web designers go from scribbled concept to online framework. Fireworks CS4 has been given new life, so new in fact that a whole new generation of Web designers needs to become acquainted with it. Adobe Fireworks CS4 How-Tos: 100 Essential Techniques gives users quick access to the key features and fundamental techniques to help them come up to speed in Adobe Fireworks CS4. Each technique is presented in a self-contained unit of one or two pages so users can dive in and start working right away, unencumbered by lengthy descriptions or technical detail. Adobe Fireworks CS4 How-Tos: 100 Essential Techniques will be one of the first books available on this software.
Supervisory control of discrete event systems with state-dependent controllability
Authors: Peng Wang, Kai-Yuan Cai
Venue: International Journal of Systems Science (2009)

This article studies the supervisory control problem of discrete event systems (DES) with state-dependent controllability. The new problem is given with the background of operating systems where the processes and the interrupt service routines (ISR) are supervised and coordinated. The new model is novel because the controllability of an event is changeable in the lifetime of system evolution, and dependent on the system state. Two fundamental problems are concerned with the new model: supervisor existence problem and supervisor synthesis problem. We derive a necessary and sufficient condition for the existence of the supervisor, and introduce an algorithm to synthesise the supremal supervisor in a given specification. With the background of process and ISR management in operating systems, some examples are given to show how the new model can be applied to practical computing.
Applying robust multibit watermarks to digital images
Authors: Dimitrios Tsolis, Spiridon Nikolopoulos, Lambros Drossos, Spyros Sioutas, Theodore Papatheodorou
Venue: Journal of Computational and Applied Mathematics (2009)

The current work is focusing on the implementation of a robust multibit watermarking algorithm for digital images, which is based on an innovative spread spectrum technique analysis. The paper presents the watermark embedding and detection algorithms, which use both wavelets and the Discrete Cosine Transform and analyzes the arising issues.
A New Intra-cluster Node Scheduling Algorithm of Clustering Data Collection Protocol in WSNs
Authors: Jian-bo Xu, Li Peng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In clustering wireless sensor networks, cluster-head nodes are backbone network to process and transmit data. Vast intra-cluster nodes obtain sleep, reduce data delay, lighten cluster head burden. In this paper, we derived the smallest active node number K, and achieved a new intra-cluster active nodes scheduling algorithm. The experimental results show that the result of the algorithm in saving energy is very apparent and achieves its design goat.
Lost in cyberspace: ethical decision making in the online environment
Authors: Joan M. Mcmahon, Ronnie Cohen
Venue: Ethics and Information Technology (2009)

In this study, a 20-item questionnaire was used to elicit undergraduates' (N = 93) ethical judgment and behavioral intention regarding a number of behaviors involving computers and internet usage. Machiavellianism was found to be uncorrelated with both ethical judgment and behavioral intention. Gender was found to be negatively correlated with both ethical judgment and behavioral intention, such that females judged the behaviors as being less ethical than males, and were less likely to engage in the behaviors than males. A disconnect was found between ethical judgment and behavioral intention, for both males and females, such that the ethical judgment mean for a number of issues was significantly lower (towards the "unethical" end of the continuum) than the behavioral intention mean (towards the "more likely to engage in" end of the continuum). The study raises questions regarding ethical awareness of technology-related issues, and the authors make suggestions for future research.
On Lagrangian Relaxation and Subset Selection Problems
Authors: Ariel Kulik, Hadas Shachnai
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small &epsilon;&thinsp;&isin;&thinsp;(0,1), we show that if there exists a &rho;-approximation algorithm for the Lagrangian relaxation of the problem, for some &rho;&thinsp;&isin;&thinsp;(0,1), then our technique achieves a ratio of $\frac{\rho}{\rho+1} -\! \varepsilon$ to the optimal, and this ratio is tight. The number of calls to the &rho;-approximation algorithm, used by our algorithms, is linear in the input size and in log(1 / &epsilon;) for inputs with cardinality constraint, and polynomial in the input size and in log(1 / &epsilon;) for inputs with arbitrary linear constraint. Using the technique we obtain approximation algorithms for natural variants of classic subset selection problems, including real-time scheduling, the maximum generalized assignment problem (GAP) and maximum weight independent set.
A robust ratio estimator of gene expression via inverse-variance weighting for cDNA microarray images
Authors: Shih-Huang Chan, Wan-Chi Chang
Venue: Computational Statistics Data Analysis (2009)

In microarray processing, the appearance of artifacts, donuts, and irregularly shaped spots is a problem. In current microarray analysis, most approaches stress the segmentation of pixel intensities rather than emphasizing ratio estimators. To avoid segmenting spot target areas and to minimize sensitivity to aberrant pixels, we propose a robust ratio estimator of gene expression via inverse-variance weighting. Moreover, a metric is proposed to evaluate the spot quality. Both the simulation and numerical examples explored reveal that the proposed algorithm is superior to existing approaches with respect to mean square error. The acceptance quality measure recommended confirms the validity of the proposed ratio estimator.
Discrete spectrum in the gaps for perturbations of periodic Jacobi matrices
Authors: P. A. Cojuhari
Venue: Journal of Computational and Applied Mathematics (2009)

In the paper we study the problem of the finiteness of the discrete spectrum for operators generated by perturbations of periodic Jacobi matrices. In particular, estimate formulae for the number of the eigenvalues created by perturbations in the gaps of the unperturbed operator are established.
Text Mining Grid Services for Multiple Environments
Authors: Antonio Anddre Serpa, Valeriana G. Roncero, Myrian C. Costa, Nelson F. Ebecken
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The objective of this paper is to describe the implementation of text mining grid services for Aîuri Project, which is a framework that includes a friendly user interface, data and text mining tasks, database access and a visualization tool integrated with various grid environments. The focus is the development and test of components for analysis and evaluation of unstructured data into distinct grid environments. These components are grid services for text mining processes using several approaches of execution, depending on which grid environment the user choose to submit his jobs. All components are open source and are freely available to the scientific community, providing access to existing services as well as encouraging the addition of new ones.
Study of Bluetooth technology and its impacts
Authors: Waqqas ur Rehman Butt, Sohail Abbas
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In recent years with the massive rise in popularity of mobile and fixed electronic computing devices (PCs, PDAs, Laptops, Mobile phones, etc.), there has been a growing demand for high-speed digital wireless communication facilities. Bluetooth is a promising new technology that is aimed at supporting wireless connectivity among cell phones, headsets, PDAs, digital cameras and laptop computers. The name Bluetooth has been borrowed from, The king of Denmark king. With the increasing penetration of wireless communications systems (wcs), customers are expecting the same level of service, reliability and performance from the wireless communication systems. Initially, Bluetooth was proposed as a replacement to cables, but it evolved as a solution for forming Personal Area Networks. After comparing IEEE 802.11 it is observed that Bluetooth is more secure due to its short range. A model of Bluetooth was studied using OPNET (Optimized Network Engineering Tool) in which behavior of Bluetooth network environment has been analyzed. Different stages of Bluetooth technology model and topology formation is also discussed.
Comparison of fuzzy implication operators by means of fuzzy relational products used for intelligent local path-planning of AUVs
Authors: Young-il Lee, Yong-Gi Kim
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

This paper describes the best choice to fuzzy implication operator and &#x03b1;-cut that are proper to the heuristic search technique for real-time collision avoidance of autonomous underwater vehicles (AUVs). A fuzzy implication operator is applied to the computation of fuzzy triangle product that constructs a new fuzzy relation between two fuzzy relations. An &#x03b1;-cut transforms a fuzzy relation into a crisp relation which is represented as a matrix. Those are the theoretical basis of heuristic search technique. In this paper, we review briefly our previous work&#x2014;a heuristic search technique using fuzzy relational products for the collision avoidance system of AUVs, and propose the selection of a fuzzy implication operator and &#x03b1;-cut which are the most suitable for the search technique. In order to verify the optimality and the efficiency of the selected fuzzy implication operator and &#x03b1;-cut, we simulate every case of &#x03b1;-cut for each fuzzy implication operator in view of the cost of path and the number of &#x03b1; -cut generating acceptable path to the goal.
Vanishing Moment Method and Moment Solutions for Fully Nonlinear Second Order Partial Differential Equations
Authors: Xiaobing Feng, Michael Neilan
Venue: Journal of Scientific Computing (2009)

This paper concerns with numerical approximations of solutions of fully nonlinear second order partial differential equations (PDEs). A new notion of weak solutions, called moment solutions, is introduced for fully nonlinear second order PDEs. Unlike viscosity solutions, moment solutions are defined by a constructive method, called the vanishing moment method, and hence, they can be readily computed by existing numerical methods such as finite difference, finite element, spectral Galerkin, and discontinuous Galerkin methods. The main idea of the proposed vanishing moment method is to approximate a fully nonlinear second order PDE by a higher order, in particular, a quasilinear fourth order PDE. We show by various numerical experiments the viability of the proposed vanishing moment method. All our numerical experiments show the convergence of the vanishing moment method, and they also show that moment solutions coincide with viscosity solutions whenever the latter exist.
Automatic bus macro placement for partially reconfigurable FPGA designs
Authors: Jeffrey M. Carver, Richard Neil Pittman, Alessandro Forin
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Dynamic Partial Reconfiguration of FPGAs partitions the configurable logic fabric into static and reconfigurable regions. The reconfigurable regions' functionality changes at run time while the static regions continue unperturbed. The reconfigurable and static regions interface via fixed connection points ("bus macros"). We introduce the notion of a fitness score as the measure of how well the combined designs meet their timing constraints, subject to a given bus macro placement. We present a tool that uses design-space exploration to obtain automatic, near-optimal placements. The tool achieves 76% better fitness scores over manual placements. The location of the bus macros around a region has a noticeable impact on the timings, and we found that this is accurately reflected on our fitness score. We also found that following the accepted best design practices leads to quantifiably sub-optimal placements, underscoring the need for such a tool.
Enabling Opportunistic Navigation in Location-Based Notification Systems
Authors: Scott Kelly, Ben Hood, Jason Chong Lee, Miten Sampat, Leigh Lally, D. Scott McCrickard
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Device-assisted navigation is rapidly becoming a major topic in computer science. PDAs and other small devices are enabling the introduction of navigational assistants to many different spaces. These areas are generally filled with points of interest with which users may choose to interact with. The natural behavior of users in such a space is to explore, interacting with objects the user deems worthy of further interaction. We call this behavior 'opportunistic navigation.' In this paper we define the challenges associated with and put forward several criteria for enabling opportunistic navigation in Location-Based Notification Systems. Our criteria have been implemented in the form of a prototype navigational assistant, SeeVT-ART, and have undergone a preliminary field test.
Note: Target tracking with incomplete detection
Authors: Yunqian Ma, Qian Yu, Isaac Cohen
Venue: Computer Vision and Image Understanding (2009)

In this paper, we address the multiple target tracking problem as a maximum a posteriori problem. We adopt a graph representation of all observations over time. To make full use of the visual observations from the image sequence, we introduce both motion and appearance likelihood. The multiple target tracking problem is formulated as finding multiple optimal paths in the graph. Due to the noisy foreground segmentation, an object may be represented by several foreground regions and similarly one foreground region may correspond to multiple objects. To deal with this problem, we propose merge, split and mean shift operations to generate new hypotheses to the measurement graph. The proposed approach uses a sliding window framework, that aggregates information across a fixed number of frames. Experimental results on both indoor and outdoor data sets are reported. Furthermore, we provide a comparison between the proposed approach with the existing methods that do not merge/split detected blobs.