ppxscal/embedding_network huggingface dataset:
A new method for assigning, the eigenvalues sign in equations (Ax = λx) and (Ax = λBx)
Authors: Hashem Saberi Najafi, Maryam Shams Solary
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The inertia of an n × n complex matrix A, is defined to be an integer triple In(A) = (π(A), v(A), δ(A)) where π(A) is the number of eigenvalues of A with positive real parts, v(A) is the number of eigenvalues with negative real parts and δ(A) is the number of eigenvalues with zero real parts. We are interested in computing the Inertia for large unsymmetric generalized eigenproblem (A,B) for equation Aϕ = λBϕ Where A and B are n × n large matrices. For standard eigenvalues problem let B = Identity matrix. An obvious approach for determine Inertia of pair(A,B), is to transform this to a standard eigenproblem by inverting either A or B. In this paper we show that the eigenvalues sign can be computed by assigning the interval that including all the eigenvalues and this method is compared by results in Matlab.
Optical spectra of charged anisotropic quantum boxes
Authors: Anna Trojnar, Arkadiusz Wojs
Venue: Microelectronics Journal (2009)

We have developed a numerical scheme for exact diagonalization of the few-particle electron-hole interaction Hamiltonians with a simultaneous resolution of several discrete conserved quantum numbers such as total electron or hole spins, total angular momentum, or parity. The method was applied to a simple model of a two-dimensional rectangular quantum box of arbitrary size and anisotropy, and containing either several electrons or several electrons and a single valence hole. In this model, effects of box size and anisotropy on the photoluminescence spectra are analyzed. Compared to earlier calculations, we were able to include enough single-particle shells in the many-body Hilbert space to observe the transitions between strong and weak spatial quantization regimes.
An Efficient Hierarchical Method for Image Shadow Detection
Authors: Bin Rao, Gang Zheng, Tiemin Chen, Jian Huang, Xi Shao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Shadow image edge detection by using an adaptive background model is a critical component for many vision-based applications. Most background models were maintained in pixel-based forms, while some approaches began to study block-based representations which are more robust to non-stationary backgrounds. In this paper, a novel method that combines edge growing and granular computing approaches into a single framework is proposed. Efficient hierarchies can be built with these two approaches complementary to each other. In addition, a novel model is proposed for shadow edge using edge growing from the edge nodes in the coarse level of the hierarchy. As can be seen from the experimental analysis, the method we proposed has better performance than existing single-level approaches in edge detection and image segmentation.
On the Qualitative Analysis of Conformon P Systems
Authors: Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Begin
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

We study computational properties of conformon P systems, an extension of P systems in which symbol objects are labeled by their current amount of energy. We focus here our attention to decision problems like reachability and coverability of a configuration and give positive and negative results for the full model and for some of its fragments. Furthermore, we investigate the relation between conformon P systems and other concurrency models like nested Petri nets and constrained multiset rewriting systems.
Objective evaluation of quality of colour reproduction in current LCD monitors
Authors: Dobromir Dochev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

In this paper the colour reproduction of actual mid-level LCD monitors is examined. There are several colour similarity metrics described and an objective methodology for testing is proposed. Results show that different brands and models of LCD monitors have different behaviour towards colour quality factors and that factory default setting rarely work. The paper also justifies the necessity to calibrate every LCD monitor before working with any application that is colour sensitive or human eyes dependent. With this best colour reproduction for every LCD monitor can be achieved.
Low power clock recovery circuit for passive HF RFID tag
Authors: Fan Bo, Dai Yujie, Zhang Xiaoxing, Lu Yingjie
Venue: Analog Integrated Circuits and Signal Processing (2009)

A low power clock recovery circuit for passive HF RFID tag is presented. The proposed clock recovery circuit, based on the architecture of Phase Locked Loop (PLL), is used to generate a stable system clock when communication occurs from interrogator to tag with 100% ASK modulation. An envelope detector is designed to detect the incident power from interrogator and control the operating state of the proposed clock recovery circuit. Loop bandwidth of PLL circuits is minimized to reduce the frequency deviation when operating in frequency maintaining state. Furthermore, an initialization circuit for loop filter is also used to speed up locking during initial system power-on-reset. Prototype chips have been fabricated in 0.35 μm 2P4M CMOS technology. A total current consumption of 3 μA has been achieved in the frequency maintaining state. Measurement results show that, when communication occurs from interrogator to tag with 100% ASK modulation, clock recovery circuit generates a stable and consecutive system clock and has an inevitable frequency derivation of 7.5% when operating in frequency maintaining state.
A Shrinkage Approach for Modeling Non-stationary Relational Autocorrelation
Authors: Pelin Angin, Jennifer Neville
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Recent research has shown that collective classification in relational data often exhibit significant performance gains over conventional approaches that classify instances individually. This is primarily due to the presence of autocorrelation in relational datasets, meaning that the class labels of related entities are correlated and inferences about one instance can be used to improve inferences about linked instances. Statistical relational learning techniques exploit relational autocorrelation by modeling global autocorrelation dependencies under the assumption that the level of autocorrelation is stationary throughout the dataset. To date, there has been no work examining the appropriateness of this stationarity assumption. In this paper, we examine two real-world datasets and show that there is significant variance in the autocorrelation dependencies throughout the relational data graphs. We develop a shrinkage technique for modeling this non-stationary autocorrelation and show that it achieves significant accuracy gains over competing techniques that model either local or global autocorrelation dependencies in isolation.
An Optimally Fair Coin Toss
Authors: Tal Moran, Moni Naor, Gil Segev
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of the honest party. A classical result by Cleve [STOC '86] showed that for any two-party r-round coin-flipping protocol there exists an efficient adversary that can bias the output of the honest party by ¿(1/r). However, the best previously known protocol only guarantees $O(1/\sqrt{r})$ bias, and the question of whether Cleve's bound is tight has remained open for more than twenty years.In this paper we establish the optimal trade-off between the round complexity and the bias of two-party coin-flipping protocols. Under standard assumptions (the existence of oblivious transfer), we show that Cleve's lower bound is tight: we construct an r-round protocol with bias O(1/r).
Commerce with MPEG-4 on the Internet with QoS
Authors: Christian Bertin, Irek Defee, Jami Kangasoja, Mika Rustari
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

COMIQS (Commerce with MPEG-4 on the Internet with Quality of Service) is a project within the EU ACTS (Advanced Communication Technologies and Services) program. COMIQS develops a complete networked multimedia system based on new standards coming from the Internet IETF, ISO MPEG and Web3D standardization bodies. COMIQS system is based on full MPEG-4 functionalities including video, audio and 3D graphics. Networking solution uses MPEG-4 DMIF (Delivery Multimedia Integration Framework) and the RTP/RTCP protocols for multimedia data developed by the IETF. COMIQS will integrate media server, network and terminal and will perform technical tests based on two applications in the area of commercial presentations.
Electrodepositing ZnxMnyOz alloys from zinc oxide to manganese oxide
Authors: M. Mollar, M. Tortosa, R. Casasús, B. Marí
Venue: Microelectronics Journal (2009)

Electrodeposition has emerged as a practical and simple method to synthesise semiconductor materials under different forms, thin films or nanostructured layers. This work reports on the cathodic electrodeposition of ZnMnO thin layers using both zinc and manganese chlorides as precursors. The composition of thin films can be varied from binary zinc oxide to manganese oxide varying the Mn/(Mn+Zn) ratio between 0 and 1. The composition of Zn"xMn"yO"z films was obtained by energy dispersive spectroscopy. Zn"1"-"xMn"xO films with Mn/Zn ratio less than 10% exhibit a crystalline wurtzite structure typical of ZnO fully oriented in the (002) direction. Higher Mn content leads to deformation of the ZnO lattice and the wurtzite structure is no longer maintained. X-ray photoelectron spectroscopy points out that Mn"3O"4 tends to be deposited when a high Mn/Zn ratio is used in the starting solution. Magnetic measurements on films with Mn/(Zn+Mn) ratio near 1 reveal magnetic characteristics similar to Mn"3O"4 compounds. The transmission spectra of Zn"xMn"yO"z show the typical absorption edge of crystalline ZnO while the wurtzite structure is maintained and it shifts to higher wavelengths when Mn content increases.
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
Authors: Katsuhisa Yamanaka, Shin-ichi Nakano
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A rectangular drawing is a plane drawing in which every face is a rectangle. In this paper we give a simple encoding scheme for rectangular drawings. Given a rectangular drawing R with maximum degree 3, our scheme encodes R with 5/3m + o(n) bits where n is the number of vertices of R and m is the number of edges of R. Also we give an algorithm to supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.
Optimizing design of two-stage experiments for transcriptional profiling
Authors: Juan P. Steibel, Guilherme J. M. Rosa, Robert J. Tempelman
Venue: Computational Statistics Data Analysis (2009)

Gene expression microarrays are powerful tools for simultaneously screening the transcriptional profile for thousands of genes across different treatments. Despite their continually improving sensitivity and dynamic range, microarrays are commonly regarded as a first screening step, with a level of precision often deemed unacceptable to use as a standalone technology. This limitation has prompted genomics researchers to validate a statistically significant subset of their microarray results using a second technique, typically quantitative reverse transcription polymerase chain reaction (qRT-PCR). The problem of optimizing such two-stage transcriptional profiling experiments in order to maximize sensitivity, while controlling the false discovery rate (FDR), is addressed. This optimization is based on partitioning the set of available biological replicates into two groups, one for each of the microarray (Stage 1) and qRT-PCR (Stage 2) experiments. It is demonstrated how the significance level should be determined for Stage 2, after selecting a fixed percentage of the genes to validate from Stage 1, in order to maximize the sensitivity of detection of differentially expressed genes for a desired overall FDR. The results indicate that most of the available replicates (typically >60%) should be consumed in Stage 1. Even though the optimization scheme assumes independent genes and known variances, simulation results show that this approach is robust to moderate departures from those assumptions. A procedure to optimize a validation experiment, conditional upon an existing microarray assay that was not optimized for two-stage testing, is also introduced. The results indicate that generally liberal significance levels (i.e., alpha > 0.05) could be used for gene-specific Stage 2 tests in typical studies to properly control FDR.
Computational Modelling of Objects Represented in Images. Fundamentals, Methods and Applications: Proceedings of the International Symposium CompIMAGE ... in Engineering, Water and Earth Sciences)
Authors: Joao Manuel Tavares, Jorge R.M. Natal
Venue:  (2007)

This book contains keynote lectures and full papers presented at the International Symposium on Computational Modelling of Objects Represented in Images (CompIMAGE), held in Coimbra, Portugal, on 20-21 October 2006. International contributions from nineteen countries provide a comprehensive coverage of the current state-of-the-art in the fields of: Image Processing and Analysis; Image Segmentation; Data Interpolation; Registration, Acquisition and Compression; 3D Reconstruction; Objects Tracking; Motion and Deformation Analysis; Objects Simulation; Medical Imaging; and, Computational Bioimaging and Visualization. Related techniques also covered in this book include the finite element method, modal analyses, stochastic methods, principal and independent components analyses and distribution models. "Computational Modelling of Objects Represented in Images" will be useful to academics, researchers and professionals in Computational Vision (image processing and analysis), Computer Sciences, and Computational Mechanics.
3D Mesh Skeleton Extraction Based on Feature Points
Authors: Faming Gong, Cui Kang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A novel efficient skeleton extraction algorithm is proposed, which is based on feature points extraction and Reeb graph theories. Because of the topological facility of feature points, a model can be divided into several branches according to them. One feature point can present one branch. So we just extract the other point of the branch – that could be skeleton point, connect these points with their corresponding feature points, then we can get all branch skeletons. Finally, connecting branch skeletons through connecting skeleton points according the topological relationship of each skeleton point preserving, then 3D model’s skeleton can be extracted.Without pre-processing stages and without input parameters, this algorithm can automatically extract the skeleton of 3D models. Theoretical analyses and experimental results show that our method has a lower computing complexity, and meets the requirement of extracting nice-looking and affine-invariant skeletons efficiently.
Web Services in the U.S. Geological Survey StreamStats Web Application
Authors: John D. Guthrie, Christine Dartiguenave, Kernell G. Ries III
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

StreamStats is a U.S. Geological Survey Web-based GIS application developed as a tool for water resources planning and management, engineering design, and other applications. StreamStats' primary functionality allows users to obtain drainage-basin boundaries, basin characteristics, and streamflow statistics for gaged and ungaged sites. Recently, Web services have been developed that provide the capability to remote users and applications to access comprehensive GIS tools that are available in StreamStats, including delineating drainage-basin boundaries, computing basin characteristics, estimating streamflow statistics for user-selected locations, and determining point features that coincide with a National Hydrography Dataset (NHD) reach address. For the state of Kentucky, a web service also has been developed that provides users the ability to estimate daily time series of drainage-basin average values of daily precipitation and temperature. The use of web services allows the user to take full advantage of the datasets and processes behind the StreamStats application without having to develop and maintain them.
On using SAT to ordered escape problems
Authors: Lijuan Luo, Martin D. F. Wong
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Routing for high-speed boards is largely a time-consuming manual task today. The ordered escape routing problem is one of the key problems in board-level routing, and Boolean Satisfiability (SAT) based approach [1] is the only solution to this problem so far. In this paper, we first solve the major deficiency of the original SAT formulation so that the escape problem is completely resolved. Then we propose two techniques to extend SAT approach for large-scale problems. Experimental results on industrial benchmarks show that our methods perform well in terms of both speed and routability.
From obscurances to ambient occlusion: A survey
Authors: &#x00c0;lex M&#x00e9;ndez-Feliu, Mateu Sbert
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

This survey deals with obscurances and ambient occlusion. These are relatively cheap techniques that simulate diffuse indirect illumination in a way that looks realistic, though they are not global illumination techniques. The concept of obscurances first appeared in the late 1990s in the context of videogames and a few years later the idea was simplified and used in production rendering of movies under the name of ambient occlusion. In recent years many articles with ideas to improve or accelerate these techniques have appeared, while ambient occlusion has been included in commercial renderers and popularized in videogames and the movie industry. This survey reviews the birth and evolution of obscurances and ambient occlusion techniques in recent years.
Locating a minisum circle in the plane
Authors: Jack Brimberg, Henrik Juel, Anita Schöbel
Venue: Discrete Applied Mathematics (2009)

We consider the problem of locating a circle with respect to existing facilities in the plane such that the sum of weighted distances between the circle and the facilities is minimized, i.e., we approximate a set of given points by a circle regarding the sum of weighted distances. If the radius of the circle is a variable we show that there always exists an optimal circle passing through two of the existing facilities. For the case of a fixed radius we provide characterizations of optimal circles in special cases. Solution procedures are suggested.
Weaknesses of MB2
Authors: Christian Ullerich, Andreas Westfeld
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

Model-based steganography is a promising approach for hidden communication in JPEG images with high steganographic capacity and competitive security. In this paper we propose an attack, which is based on coefficient types that can be derived from the blockiness adjustment of MB2. We derive 30 new features to be used in combination with existing blind feature sets leading to a remarkable reduction of the false positive rate (about 10:1) for very low embedding rates (0.02 bpc). We adapt Sallee's model-based approach for steganalysis where the Cauchy model itself is used to detect Cauchy model-based embedded messages. We apply a gradient aware blockiness measure for improved reliability in the detection of MB1. We evaluate our proposed methods based on a set of about 3000 images.
Adaptation and application of multi-objective evolutionary algorithms for rule reduction and parameter tuning of fuzzy rule-based systems
Authors: Mar&#x00ed;a Jos&#x00e9; Gacto, Rafael Alcal&#x00e1;, Francisco Herrera
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Recently, multi-objective evolutionary algorithms have been applied to improve the difficult tradeoff between interpretability and accuracy of fuzzy rule-based systems. It is known that both requirements are usually contradictory, however, these kinds of algorithms can obtain a set of solutions with different trade-offs. This contribution analyzes different application alternatives in order to attain the desired accuracy/interpr-etability balance by maintaining the improved accuracy that a tuning of membership functions could give but trying to obtain more compact models. In this way, we propose the use of multi-objective evolutionary algorithms as a tool to get&#x00a0;almost one improved solution with respect to a classic single objective approach (a solution that could dominate the one obtained by such algorithm in terms of the system error and number of rules). To do that, this work presents and analyzes the application of six different multi-objective evolutionary algorithms to obtain simpler and still accurate linguistic fuzzy models by performing rule selection and a tuning of the membership functions. The results on two different scenarios show that the use of expert knowledge in the algorithm design process significantly improves the search ability of these algorithms and that they are able to improve both objectives together, obtaining more accurate and at the same time simpler models with respect to the single objective based approach.
A simplified modeling approach for human system interaction
Authors: Torbjörn P. E. Ilar
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Despite increasing dependency on technology, the importance of humans is expected to increase and to provide a realistic basis for decision support; both technical and organizational processes must be included in simulation models. In a rapidly changing environment, skill development is also important and should be considered when developing simulation models. This paper describes a three step straightforward method that support the implementation of supporting (human dependent) processes, operators competence and competence development using learning curves to obtain a more representative simulation of system performance. The effect on the performance measures are also demonstrated based on a case study of a highly automated press line. The advantages and disadvantages with the proposed method are also discussed.