ppxscal/embedding_network huggingface dataset:
Microfluidic system for electroelution of proteins from a clinical sampling strip
Authors: Sun Min Kim
Venue: Microsystem Technologies (2009)

A clinical methylcellulose sampling strip is one of the popular means for collecting gingival crevicular fluid (GCF) from dental patients for dental disease diagnosis. In this research, a microfluidic device for protein elution from a sampling strip was fabricated with poly (dimethylsiloxane) (PDMS) polymer. Electoelution experiments were performed with fluorescein isothiocyanate (FITC) dye labeled bovine serum albumin (BSA) and ovalbumin (OVA). The total amount of eluted protein is measured by quantitative fluorescence imaging. About 50% of the initial concentration of BSA and OVA was eluted by the ~20&#x00a0;V/cm electric field. Electroelution is an appealing method for protein elution; however, the thickness of the wet strip (~400&#x00a0;&#x03bc;m) introduces interesting practical difficulties. During the electroelution process, unsteady electrokinetic phenomena by the pressure driven flow and the pH change of the reservoirs were observed. Several possible solutions to these problems are still under investigation including modifying reservoirs and thin polymer film coating of PDMS channel surfaces. This electroelution device would be a useful component of a fully integrated micro total analysis system for oral fluid samples. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Microsoft Windows Vista: Illustrated Essentials, Spanish Edition (Serie Libro Visual), 1 edition
Authors: Harry L. Phillips
Venue:  (2008)

Now available in Spanish! This Illustrated Series book covers the essential information that you need to know now for Microsoft Vista 2007. Our signature two-page spread design has been updated and refreshed to take full advantage of the new features of the Windows Vista software. This practical, easy to navigate book provides you with the essential knowledge you need to succeed at both work and beyond.
Wideband noise envelope-transient simulation in radiometers operating with multiple time-scales
Authors: J. P. Pascual, F. J. Casas, M. L. De La Fuente, B. Aja, E. Artal
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

A radiometer simulation procedure with special emphasis on high frequencies and switched system performance is discussed. The whole system simulation is implemented in Envelope-Transient, a combination of frequency domain and time domain, on the same software platform which is used to design separate microwave components, allowing the use of measured S parameters and measured current-voltage characteristics of the detectors. 1/f gain fluctuations are introduced in the simulations and switched differential operation is implemented and validated as a way to minimize their impact. Low frequencies are scaled-up to allow the simulator a reasonable CPU time and memory handling without losing generality. Coupling between a base-band equivalent solution and a complete mm-wave solution is provided by the proposed simulation, providing a step beyond typical separate analysis of RF parts and base-band equivalent in this kind of systems.
A PSO Algorithm with the Improved Diversity for Feedforward Neural Networks
Authors: Tong-Yue Gu, Shi-Guang Ju, Fei Han
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this paper, an improved particle swarm optimization (PSO) with the improved diversity is proposed to train feedforward neural networks (FNN). In this algorithm, first, the PSO algorithm is used to train the FNN. Second, when the particle swarm is trapped into local minima or loses its diversity, each particle in the swarm and its best position (Pb) are interrupted by a random function in order to improve the diversity of population, and the best position (Pg) of all particles remains unchanged. Third, the PSO algorithm with the new population is used to search the better global optimum. The proposed algorithm improves the diversity of the swarm and has good convergence performance. Finally, the experimental results are given to verify the efficiency and effectiveness of our proposed learning algorithm.
Network Planning for Multicast Using Partitioned Virtual User Domains
Authors: Xuezhou Ma, Selcuk Cevher, M. Umit Uyar, Mariusz Fecko, John Sucec, Sunil Samtani
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

We introduce a new network planning approach for management of multicast communications in large data dissemination networks. Our approach, addressing Channelization Problem, considers both the common user interests and geographical dependencies while evaluating multicast configurations. We first perform Global Similarity Classification to partition users into virtual domains based on their characteristics within the same geographical vicinity. Second, based on the resource availability of a given network, Localized Multicast Update mechanism is used to evaluate the benefits of forming a new multicast group and the cost of the management overhead. We evaluate the performance of the proposed approach using our simulation software. Preliminary results show that, using two-stage planning, the performance of our approach is at least 40% better than the existing greedy approaches.
Extracting service features from protocol documents
Authors: John F. Heafner, Frances H. Nielsen, M. Wayne Shiveley
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper describes a manual procedure for itemizing the service features of a computer network protocol. The procedure has been tested and refined several times. The testing is described here, along with analysis of test results and general observations. The authors conclude that, although the procedure now provides only partially satisfying results, such a method is needed to aid in quantifying users' protocol needs.
Bad Head Day
Authors: Karen Weiss
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

This short film is a self-portrait depicting those impossible days when nothing fits us, and nothing pleases us. On those days we have to pay attention to the things life tells us without words.
Exploiting Spatial Locality for Objects Layout in Virtual Environments
Authors: Ching-Shun Hsieh, Hui-Ling Lin, Shao-Shin Hung, Shih-Hao Shen, Ching-Hung Yeh
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

On-disk sequentiality of requested data, or their spatial locality, is critical to disk performance. Unfornately, spatial locality of cached data is largely ignored, and only temporal locality is considered in current system buffer cache managments. Besides, an individual object might induce different relations in different applications. A novel hypergraph scheme was proposed to represent the complex relations among the objects. Instead of a local measure that depends only on common objects among patterns, we propose a global measure that is based on the semantic properties of these patterns in the overall data set. The experiments show the effectiveness of the proposed framework.
Graph-based semi-supervised learning with multiple labels
Authors: Zheng-Jun Zha, Tao Mei, Jingdong Wang, Zengfu Wang, Xian-Sheng Hua
Venue: Journal of Visual Communication and Image Representation (2009)

Conventional graph-based semi-supervised learning methods predominantly focus on single label problem. However, it is more popular in real-world applications that an example is associated with multiple labels simultaneously. In this paper, we propose a novel graph-based learning framework in the setting of semi-supervised learning with multiple labels. This framework is characterized by simultaneously exploiting the inherent correlations among multiple labels and the label consistency over the graph. Based on the proposed framework, we further develop two novel graph-based algorithms. We apply the proposed methods to video concept detection over TRECVID 2006 corpus and report superior performance compared to the state-of-the-art graph-based approaches and the representative semi-supervised multi-label learning methods.
Estimating 3D Flow for Driver Assistance Applications
Authors: Jorge A. Sánchez, Reinhard Klette, Eduardo Destefanis
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper proposes a technique for estimating 3D flow vectors, by combining a KLT tracker with subsequent scale-space analysis of tracked points. A tracked point defines a 2D vector, which is mapped into 3D space based on ratios of maxima of scale-space characteristics. The approach is tested for night-vision sequences as recorded (at Daimler AG, Germany) for driver assistance projects. Those image sequences (at 25Hz) are characterized by being slightly blurry and of low contrast.
Seam Framework: Experience the Evolution of Java EE, 2nd edition
Authors: Michael Juntao Yuan, Jacob Orshalick, Thomas Heute
Venue:  (2009)

Fully Updated to Cover Major Enhancements to Seam 2.x In Seam Framework, Second Edition, the authors of the leading guide to Seam programming have systematically updated their text to reflect the major improvements introduced with Seam 2.x. This author teamall key Seam project contributorsteach Seam 2.x through detailed example applications that reveal how Seam simplifies many tasks that were previously difficult or impractical. Their robust descriptions are complemented by in-depth feature discussions that demonstrate how to use Seams power to the fullest. Whether youre new to Seam programming or a seasoned Seam developer who wants to achieve deeper mastery of Seam 2.x, this book will be an indispensable resource. Coverage includes Using improvements to Seams conversation model, transaction management, and other features Enhancing security, performing end-to-end validation, and providing custom exception pages Using Quartz to execute timer jobs in your application Generating bookmarkable RESTful Web pages the easy way Developing highly scalable applications with Seam 2.xs new multilayer caching Simplifying development with Groovy, the scripting language that runs directly on the JVM Using jBPM business processes to improve page flow Previewing Web Beans (JSR-299), the future core of Seam that will transform Java EE Web development *Download source code for this books case study application at solutionsfit.com/seam.
Graph-Based Rare Category Detection
Authors: Jingrui He, Yan Liu, Richard Lawrence
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Rare category detection is the task of identifying examples from rare classes in an unlabeled data set. It is an open challenge in machine learning and plays key roles in real applications such as financial fraud detection, network intrusion detection, astronomy, spam image detection, etc. In this paper, we develop a new graph-based method for rare category detection named GRADE. It makes use of the global similarity matrix motivated by the manifold ranking algorithm, which results in more compact clusters for the minority classes; by selecting examples from the regions where probability density changes the most, it relaxes the assumption that the majority classes and the minority classes are separable. Furthermore, when detailed information about the data set is not available, we develop a modified version of GRADE named GRADE-LI, which only needs an upper bound on the proportion of each minority class as input. Besides working with data with structured features, both GRADE and GRADE-LI can also work with graph data, which can not be handled by existing rare category detection methods. Experimental results on both synthetic and real data sets demonstrate the effectiveness of the GRADE and GRADE-LI algorithms.
Using image processing as a measuring device in close loop control system and system behavior analysis
Authors: Majid Alitavoli, Salar Basiri, Ahmad Bagheri
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this paper, the common principles of digital image processing are investigated. By using these principles, one can deploy simple devices such as a PC or webcam to establish a system based on Image processing techniques in order to test different algorithms. The use of color software filters increases the need for processing power of image processor, but based on the ease of a capability and inexpensiveness of modern computers can reduce the total system expenses. Further in this research, several image processing systems in which cameras are used as feedback sensor in close loop control systems. These cameras can aid in obtaining kinematic parameters such as speed and position. In some cases the use of this method, due to its system physical status can be the best method. In some other situation this method could be used alongside of other choices. The chief advantage of this technique is that the instrumentation tools can not affect the case under study.
A Subsampling-Based Digital Image Watermarking Scheme Resistant to Permutation Attack
Authors: Chuang Lin, Jeng-Shyang Pan, Chia-An Huang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The letter proposes a novel subsampling-based digital image watermarking scheme resisting the permutation attack. The subsampling-based watermarking schemes have drawn great attention for their convenience and effectiveness in recent years, but the traditional subsampling-based watermarking schemes are very vulnerable to the permutation attack. In this letter, the watermark information is embedded in the average values of the 1-level DWT coefficients to resist the permutation attack. The concrete embedding process is achieved by the quantization-based method. Experimental results show that the proposed scheme can resist not only the permutation attack but also some common image processing attacks.
DUCHESS: a high level information system
Authors: Bruce J. Taylor, S. C. Lloyd
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The amount of time which has elapsed between Liebritz's first theoretical description of a computing machine and today's commonplace use of digital computers as extensions of Man's intellectual faculties is a little more than three hundred years. This period has witnessed the birth and death of many trends in the art of mechanical computing, some no more than fads and others becoming established as fundamental truths which are now accepted as axioms of computer science. One of the most firmly established of these latter trends is the quest for generality. As early as 1833, Charles Babbage discerned that in the ideal computing machine, the human operator should have completely flexible control not only over the data to be processed, but also over the algorithms.
Using Wikipedia-Based Conceptual Contexts to Calculate Document Similarity
Authors: Fabian Kaiser, Holger Schwarz, Mihály Jakob
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Rating the similarity of two or more text documents is an essential task in information retrieval. For example, document similarity can be used to rank search engine results, cluster documents according to topics etc. A major challenge in calculating document similarity originates from the fact that two documents can have the same topic or even mean the same, while they use different wording to describe the content. A sophisticated algorithm therefore will not directly operate on the texts but will have to find a more abstract representation that captures the texts' meaning. In this paper, we propose a novel approach for calculating the similarity of text documents. It builds on conceptual contexts that are derived from content and structure of the Wikipedia hypertext corpus.
pRPL: an open-source general-purpose parallel raster processing programming library
Authors: Qingfeng Guan
Venue: SIGSPATIAL Special (2009)

pRPL is an open-source general-purpose programming library developed by the author to parallelize almost any raster-processing algorithm with any arbitrary neighborhood configuration, and support any data type. This paper introduces the advanced features of pRPL, compares it with other similar programming libraries, and demonstrates the performance of a parallel geographic Cellular Automata (CA) model developed using pRPL with real-world datasets. In conclusion, pRPL effectively reduces the development complexity of parallel programming, and efficiently reduces the computing time.
(2,1)-Lagged Fibonacci Generators Using Elliptic Curves over Finite Fields
Authors: B. R. Shankar, Kamath K. Karuna
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A novel pseudorandom sequence generator is presented in this paper. The genesis of this new generator is evolved from the concept of Lagged Fibonacci generator[1] applied to points on elliptic curves over a finite field. It is observed that the generator has a long period. Also a successful statistical testing of the randomness attributes of the given generator, in accordance with the National Institute of Standards and Technology test suite, admits to a key stream source that is in conformance with the Advanced Encryption Standard for data encryption
Extending the Engagement Taxonomy: Software Visualization and Collaborative Learning
Authors: Niko Myller, Roman Bednarik, Erkki Sutinen, Mordechai Ben-Ari
Venue: ACM Transactions on Computing Education (TOCE) (2009)

As collaborative learning in general, and pair programming in particular, has become widely adopted in computer science education, so has the use of pedagogical visualization tools for facilitating collaboration. However, there is little theory on collaborative learning with visualization, and few studies on their effect on each other. We build on the concept of the engagement taxonomy and extend it to classify finer variations in the engagement that result from the use of a visualization tool. We analyze the applicability of the taxonomy to the description of the differences in the collaboration process when visualization is used. Our hypothesis is that increasing the level of engagement between learners and the visualization tool results in a higher positive impact of the visualization on the collaboration process. This article describes an empirical investigation designed to test the hypothesis. The results provide support for our extended engagement taxonomy and hypothesis by showing that the collaborative activities of the students and the engagement levels are correlated.
A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium
Authors: Zhisu Zhu, Chuangyin Dang, Yinyu Ye
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We consider a linear complementarity problem (LCP) arisen from the Arrow-Debreu-Leontief competitive economy equilibrium where the LCP coefficient matrix is symmetric. We prove that the decision problem, to decide whether or not there exists a complementary solution, is NP-complete. Under certain conditions, an LCP solution is guaranteed to exist and we present a fully polynomial-time approximation scheme (FPTAS) for computing such a solution, although the LCP solution set can be non-convex or non-connected. Our method is based on solving a quadratic social utility optimization problem (QP) and showing that a certain KKT point of the QP problem is an LCP solution. Then, we further show that such a KKT point can be approximated with running time $\mathcal{O}((\frac{1}{\epsilon})\log (\frac{1}{\epsilon})\log( \log(\frac{1}{\epsilon}))$ in accuracy &epsilon;&thinsp;&isin;&thinsp;(0,1) and a polynomial in problem dimensions. We also report preliminary computational results which show that the method is highly effective.
Introducing mobility concepts into geographic information systems
Authors: Dejan Rancic, Bratislav Predic
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This paper presents mobile GIS solution intended for field work. Mobile GIS is an extension of central enterprise GIS maintained by a company involved in any kind of field work characterized by usage of spatial data. Mobile GIS operating on mobile computer platform is substituting thematic paper maps widely used today. It is enabling field work personnel to always have access to most accurate and up to date spatial data. Also, this system automates the process of updating central enterprise GIS with data acquired in the field, process which has been up to date tedious and error prone.
An Efficient Handoff Scheme Based on Intelligent Scan in IEEE 802.11 Wireless LANs
Authors: Chang Liang, Zhao Yuning, Chen Jing
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper, a simple and efficient handoff scheme based on intelligent scan is proposed. Based on the intelligent scan scheme, a selection scheme is presented to help a mobile node select a desired next AP to handoff effectively. The analytical model and simulation are elaborated to show performance of the approaches. Detailed simulation results show that the proposed handoff scheme can not only handoff efficiently, but also provide considerable high hit ratio on the selection of the nearest AP among the next-AP candidates discovered by a mobile node.
Covariate selection in mixture models with the censored response variable
Authors: Zeng-Hua Lu
Venue: Computational Statistics Data Analysis (2009)

This paper formulates a mixture model for modeling unobserved heterogeneity of explanatory mechanism. Our model allows for different sets of regressors and/or different interactions among the same regressors in different regression regimes. The model is demonstrated with particular interest to the censored dependent variable. A two-step procedure is proposed for model identification. The first step is to identify the number of regression regimes with each regime, including all regressors. The second step is to select regressors in the regression regimes. The results of our simulation studies suggest that the procedure works well. Two microeconometric applications are provided.
All Languages in NP Have Very Short Quantum Proofs
Authors: Hugue Blier, Alain Tapp
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

In this paper, we show that all languages in NP have logarithmic-size quantum proofs which can be verified provided that two unentangled copies are given. More formally, we introduce the complexity class QMAlog(2) and show that 3COL E QMAlog(2). To obtain this strong and surprising result we have to relax the usual requirements: the completeness is one but the soundness is 1-1/poly. Since the natural classical equivalent of QMAlog(2) is uninteresting (it would be equal to P), this result, like many others, stresses the fact that quantum information is fundamentally different from classical information. It also contributes to our understanding of entanglement since QMAlog = BQP[7].