ppxscal/embedding_network huggingface dataset:
Mean Shift Based Collaborative Localization with Dynamically Clustering for Wireless Sensor Networks
Authors: Quan Zhou, Xiaowei Li, Yongjun Xu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Mean shift is a nonparametric method to estimate the density gradient, which iteratively computes the mean of observations and shifts to the centroid until reach a predefined end condition. This paper proposes a mean shift based scheme for localization and tracking in wireless sensor networks.Mean shift is a generalized framework, and range-free Centroid and range-based W-Centrod are both the special cases of this generalized framework. A dynamically clustering protocol is proposed to support the generalized framework. Analysis and simulation results show that the communication overhead and jitter are reduced to 1/3 of traditional algorithms. The positioning accuracy of proposed algorithm with optimal weight increases 28% and 11% in comparison to Centroid and W-Centroid.
Data Interactive Technique in Pro/E and HyperMesh and ANSYS and its Application in Structural Analysis
Authors: Yazhong Sun, Zuobing Chen
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

This paper introduces the data interactive technique and its necessity of application in project fields. To explore the methods of data interactive technique in the process of vertical mill structure design with CAD/CAE 3D softwares. And take the core part of vertical mill—abrasive disc for example, using Pro/E, HyperMesh and ANSYS to complete the structure optimization recommends for the abrasive disc with the data interactive technique, which lay a foundation for the further engineering analysis.
Optical buffer system with service differentiation capability in optical packet switching network: implementation, modeling and analysis
Authors: Xuguang Shao, Ping Shum, Liren Zhang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We propose an optical buffer system that can be realized by implementing the state-of-art optical buffer technology in the near future. This optical buffer system can be used at the output port of an optical router in an optical switching network (OPS), which resembles its electronic equivalent in terms of operational functionality. Analytical modeling is done to investigate the switch with this buffer structure. Results obtained demonstrate the capability of providing service differentiation by using our proposed optical buffer system.
Ghostly images appearing in moving human eyes and still machine eyes
Authors: Hideyuki Ando, Alvaro Cassinelli, Junji Watanabe
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

This saccade-based display is a device capable of presenting two-dimensional images using a unique bar of addressable light sources (a column of LEDs). In a dimly lit environment, each time the saccadic eye movement of the observer is detected, the flashing pattern of the column light expands, and ghostly images appear in midair.
Cross-Language Frame Semantics Transfer in Bilingual Corpora
Authors: Roberto Basili, Diego Cao, Danilo Croce, Bonaventura Coppola, Alessandro Moschitti
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Recent work on the transfer of semantic information across languages has been recently applied to the development of resources annotated with Frame information for different non-English European languages. These works are based on the assumption that parallel corpora annotated for English can be used to transfer the semantic information to the other target languages. In this paper, a robust method based on a statistical machine translation step augmented with simple rule-based post-processing is presented. It alleviates problems related to preprocessing errors and the complex optimization required by syntax-dependent models of the cross-lingual mapping. Different alignment strategies are here investigated against the Europarl corpus. Results suggest that the quality of the derived annotations is surprisingly good and well suited for training semantic role labeling systems.
Comparative analysis of routing protocols for VoIP in a Wireless Mesh Backbone: a user perspective
Authors: Saulo Queiroz, Arlen Nascimento, Edjair Mota, Leandro S. G. Carvalho, Edson Nascimento
Venue: International Journal of Internet Protocol Technology (2008)

In this work we select AODV, OLSR and HWMP routing protocols and focus on how they can affect the Quality of user Experience (QoE) with respect to VoIP on a wireless backbone. We calculated QoE by using a reviewed version of the E-model. Since that parameter is strongly correlated with some stochastic network variables it presents stochastic behaviour too. So, we discuss important issues needed to estimate QoE based parameters in a trusty way. Results showed that the average QoE kept acceptable only under AODV routing as the number of VoIP traffic was increased in the network.
Finders Keepers
Authors: Robb Gibbs
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In the darkness of space, a territorial war ensues. This comical battle is futile. Two species compete to plant the first flag, and the competition escalates to a contest to place the greatest number of flags on a planet and claim it for their home world.
An efficient image-mosaicing method based on multifeature matching
Authors: Ezzeddine Zagrouba, Walid Barhoumi, Slim Amri
Venue: Machine Vision and Applications (2009)

Mosaicing is connecting two or more images and making a new wide area image with no visible seam-lines. Several algorithms have been proposed to construct mosaics from image sequence where the camera motion is more or less complex. Most of these methods are based either on the interest points matching or on theoretical corner models. This paper describes a fully automated image-mosaicing method based on the regions and the Harris points primitives. Indeed, in order to limit the search window of potential homologous points, for each point of interest, regions segmentation and matching steps are being performed. This enables us to improve the reliability and the robustness of the Harris points matching process by estimating the camera motion. The main originality of the proposed system resides in the preliminary manipulation of regions matching, thus making it possible to estimate the rotation, the translation and the scale factor between two successive images of the input sequence. This estimation allows an initial alignment of the images along with the framing of the interest points search window, and therefore reducing considerably the complexity of the interest points matching algorithm. Then, the resolution of a minimization problem, altogether considering the couples of matched-points, permits us to perform the homography. In order to improve the mosaic continuity around junctions, radiometric corrections are applied. The validity of the herewith described method is illustrated by being tested on several sequences of complex and challenging images captured from real-world indoor and outdoor scenes. These simulations proved the validity of the proposed method against camera motions, illumination variations, acquirement conditions, moving objects and image noise. To determine the importance of the regions matching stage in motion estimation, as well as for the framing of the search window associated to a point of interest, we compared the matching points results of this described method with those produced using the zero-mean normalized cross correlation score (without regions matching). We made this comparison in the case of a simple motion (without the presence of a rotation around optical axis and/or a scale factor), in the case of a rotation and in the general case of an homothety. For justifying the effectiveness of this method, we proposed an objective assessment by defining a reconstruction error.
Structural Properties of Gene Regulatory Networks: Definitions and Connections
Authors: Sridharakumar Narasimhan, Raghunathan Rengaswamy, Rajanikanth Vadigepalli
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

The study of gene regulatory networks is a significant problem in systems biology. Of particular interest is the problem of determining the unknown or hidden higher level regulatory signals by using gene expression data from DNA microarray experiments. Several studies in this area have demonstrated the critical aspect of the network structure in tackling the network modelling problem. Structural analysis of systems has proved useful in a number of contexts, viz., observability, controllability, fault diagnosis, sparse matrix computations etc. In this contribution, we formally define structural properties that are relevant to Gene Regulatory Networks. We explore the structural implications of certain quantitative methods and explain completely the connections between the identifiability conditions and structural criteria of observability and distinguishability. We illustrate these concepts in case studies using representative biologically motivated network examples. The present work bridges the quantitative modelling methods with those based on the structural analysis.
Unease of Use
Authors: Fred Douglis
Venue: IEEE Internet Computing (2009)

Email security is a significant concern, so why don't more people encrypt their email? EIC Fred Douglis takes a stab at using a new privacy guard with Gmail, and describes his experience.
Asymptotic analysis of extrapolation boundary conditions for LBM
Authors: Maddu Shankar, S. Sundar
Venue: Computers Mathematics with Applications (2009)

We present an investigation of extrapolation boundary conditions for lattice Boltzmann method (LBM) using asymptotic analysis. Equilibrium and non-equilibrium extrapolation methods for velocity and pressure boundary conditions proposed in the literature were tested numerically in specific cases. We analyse these boundary conditions using asymptotic expansion techniques and show an improvement in the accuracy of the lattice Boltzmann solution. We also present few numerical examples and simulate fluid flow across an unsymmetrically placed stationary cylinder in a channel with steady and unsteady flow conditions. Thus the article demonstrates application of asymptotic analysis to understand properties of extrapolation boundary conditions for LBM and show the flexibility of these boundary conditions for complex fluid flow applications.
A Quantitative bgl Operon Model for E. coli Requires BglF Conformational Change for Sugar Transport
Authors: Paras Chopra, Andreas Bender
Venue: Transactions on Computational Systems Biology IX (2009)

The bgl operon is responsible for the metabolism of ß-glucoside sugars such as salicin or arbutin in E. coli. Its regulatory system involves both positive and negative feedback mechanisms and it can be assumed to be more complex than that of the more closely studied lac and trp operons. We have developed a quantitative model for the regulation of the bgl operon which is subject to in silico experiments investigating its behavior under different hypothetical conditions. Upon administration of 5mM salicin as an inducer our model shows 80-fold induction, which compares well with the 60-fold induction measured experimentally. Under practical conditions 5-10mM inducer are employed, which is in line with the minimum inducer concentration of 1mM required by our model. The necessity of BglF conformational change for sugar transport has been hypothesized previously, and in line with those hypotheses our model shows only minor induction if conformational change is not allowed. Overall, this first quantitative model for the bgl operon gives reasonable predictions that are close to experimental results (where measured). It will be further refined as values of the parameters are determined experimentally. The model was developed in Systems Biology Markup Language (SBML) and it is available from the authors and from the Biomodels repository [www.ebi.ac.uk/biomodels].
An integrated CAD and simulation model for concrete operations
Authors: Aly Abdel Fattah, Janaka Y. Ruwanpura
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Pouring a concrete raft slab is a classic problem in downtown projects because it requires special arrangements to be made with city authorities to close the area around the project during the operation. City authorities allow this only during the weekends that puts a lot of pressure on construction staff to finish pouring the concrete in a limited amount of time. In this paper, a simulation model for predicating the pouring time is introduced. This integrated model consists of: Special Purpose Simulation (Simphony), Microsoft Access, Visual Basic for Application (VBA) and AutoCAD software. Moreover, in this paper the sensitive parameters are analyzed and recommendations for choosing pouring concrete subcontractors are provided. Additionally the proposed model is applied to a practical case for defining the required time for pouring a lower raft slab for "The Bow" project in downtown Calgary.
Extracting Facial Features and Face Inpainting
Authors: Lin Chun Yu, Nick C. Tang, Huang Bo Jun, Timothy K. Shih
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In recent years, facial recognition techniques can be applicable in varies fields and has significant results. In obtaining facial images, if the face image were covered or damaged, the degree of error and inaccuracy will increase significantly. Therefore, the purpose of this paper is not only for extracting facial features, but also to recover the damaged regions. This paper uses Feature-based methodology to detect facial feature points and build up the face database. And the recovering procedure, the system will be to compare with the faces within the face database to find the applicable face, and reconstruct it.
Adaptive Tracking Control of Nonlinear Systems Using Neural Networks
Authors: Lin Niu, Liaoyuan Ye
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

An adaptive neural network control strategy for a class of nonlinear system is proposed, which combines the technique in generalized predictive control theory and the gradient descent rule to accelerate learning and improve convergence with neural network’s capability of approximating to nonlinear function, Taking the neural network as a model of the system, control signals are directly obtained by minimizing the cumulative differences between a setpoint and output of the model. The effectiveness of the proposed control scheme is illustrated through simulations.
Seamless classified information protection capability
Authors: Subhashini Ganapathy, Michael Amirfathi, Ken Layton, Acosta Saadia
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

With increasing push towards privacy and intellectual property protection, the area of computing has been receiving increasing attention in the security arena. There is a lack of enterprise-wide system that can provide persistent protection for classified information in multiple formats and the entire life cycle of the document. Also, under-classification of information, because of complexity of existing solutions, is prevalent. These findings led us to develop a classified information protection capability (CiPC) application that allows a seamless, transparent human computer interaction to protect classified information.
A dynamic QoS control based on optimistic processor reservation
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: The paper proposes a dynamic QOS control scheme using a processor reservation system. In our scheme, a system allocates processor capacity for each application, then the application increases or decreases the current resource usage by using a feedback mechanism. This scheme allows the application to reserve resources optimistically. This means that a system can allocate all processor resources to respective applications every time. Our approach makes it easy to build a continuous media application with a dynamic QOS control scheme, and allocates processor capacity very efficiently without unexpected degradation of a media stream's quality.
Extending fieldbus standards to food processing and packaging industry: A review
Authors: N. P. Mahalik, Matthew Yen
Venue: Computer Standards Interfaces (2009)

Several fieldbus systems based on different standards are in use since a decade. Bearing in mind that a dedicated fieldbus for food plant operation and management (FOAM) does not exist, this paper highlights their applications in this sector. In recent years, such pressures as operational flexibility, state-of-the-art technology, regulations, quality control, productivity, and last but not the least the environmental issues have motivated the food processing and packaging industry to search for strategic ways to fulfill factory-wide automation, control, and management requirements. However, the acceptance of fieldbus technology especially for the food processing and packaging applications has been minimal. Because, new processing plants small to large including renovation and modernization sites are emerging almost everyday, there is a pressing need to extensively disseminate the characteristic features, so that the fieldbus revolution can spread to serve the food industries in a bigger way. This paper critically reviews the characteristic features of some popular fieldbus systems while advocating modern networked automation tools and systems scenarios that can meet the FPOM (food plant operation and management) requirements. In particular, the characteristic features of some contemporary fieldbus standards have been comprehensively described. Some applications are highlighted. A suggestion is made to develop a dedicated fieldbus for the food industry. Conceptual specification of requirements framework is outlined.
Feature Selection Based on Neighborhood Systems and Rough Set Theory
Authors: Ming He
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Attribute reduction is an important issue in data mining and knowledge acquisition. It has been proven that computing all reductions and optimal (minimal) reduction is a NP-hard problem. This paper proposed a hybrid approach using the rough set theory and neighborhood systems for feature selection. Two neighborhood approximation operators are defined based on rough set. A neighborhood rough model is constructed subsequently and the heuristic information is introduced according to the significance of attributes respectively. Experimental results indicate that the proposed method can reduce attributes effectively.
Query languages for data exchange: beyond unions of conjunctive queries
Authors: Marcelo Arenas, Pablo Barceló, Juan Reutter
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms of data complexity). However, this is not the only class with this property; the certain answers to any Datalog program can also can be computed in polynomial time. The problem is that both UCQ and Datalog do not allow negated atoms, as adding an unrestricted form of negation to these languages yields to intractability. In this paper, we propose a language called DatalogC(&ne;) that extends Datalog with a restricted form of negation, and study some of its fundamental properties. In particular, we show that the certain answers to a DatalogC(&ne;) program can be computed in polynomial time (in terms of data complexity), and that every union of conjunctive queries with at most one inequality or negated relational atom per disjunct, can be efficiently rewritten as a DatalogC(&ne;) program in the context of data exchange. Furthermore, we show that this is also the case for a syntactic restriction of the class of unions of conjunctive queries with at most two inequalities per disjunct. This syntactic restriction is given by two conditions that are optimal, in the sense that computing certain answers becomes intractable if one removes any of them. Finally, we provide a thorough analysis of the combined complexity of computing certain answers to DatalogC(&ne;) programs and other related query languages. In particular, we show that this problem is Exptime-complete for DatalogC(&ne;), even if one restricts to conjunctive queries with single inequalities, which is a fragment of DatalogC(&ne;) by the result mentioned above. Furthermore, we show that the combined complexity is CoNexptime-complete for the case of conjunctive queries with k inequalities, for every k &ge; 2.
Privacy Interests in Prescription Data, Part I: Prescriber Privacy
Authors: Patricia Kosseim, Khaled El Emam
Venue: IEEE Security and Privacy (2009)

For several years, concern has been growing about privacy implications that arise from using and disclosing prescription data. Some patterns or practices provide pharmaceutical companies with the historical trends they need to better target their marketing efforts aimed at individual physicians through more intense, precise, and unique detailing strategies. In the first of a two part-article, the authors focus the privacy implications arising from the sale or transfer of prescription data, in respect to prescribers in Canada and the US.
Color features comparison for retrieval in personal photo collections
Authors: Daniele Borghesani, Costantino Grana, Rita Cucchiara
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Search and retrieval based on perceptual similarity will be a key issue for photo manager tools, indeed the majority of the thousand of photos collected day by day by users are not annotated or are associated with few meaningful keywords, making ontology or keyword based search not always affordable. In this paper, a complete performance analysis on similarity retrieval with common color features is proposed, focusing on the specific application scenario of personal photo collections. The analysis includes an enhancement of the standard HSV color space (aHSV), that provides performance improvements at no cost in practice. Tests are carried out on 25 variations of the UCID v2 database.
Recognition of Facial Expressions Based on the Hopfield Memory Model
Authors: Ying Dai, Yoshitaka Shibata, Yasuaki Nakano, Kozi Hashimoto
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, a new method for recognizing the facial expressions by utilizing the Hopfield model is presented.In this method, the Hopfield memory model with recall capability is constructed. When a facial image is given to the Hopfield memory as an input, the all units which are at the stable states yield its associate recall pattern. Based on the composed Hopfield memory model, the relation between the reliability of the recalls and the number of faces which are memorized in the Hopfield memory is analyzed. Based on the performance of the Hopfield memory model, the scheme for the facial expressions recognition combined with the pattern matching is presented. The experimental results are shown and analyzed.