ppxscal/embedding_network huggingface dataset:
Research and application of SQLite embedded database based on ARM-linux
Authors: BI Chun-Yue
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

The embedded database SQLite is widely applied in the data management of embedded environment such as mobile devices, industrial control, information appliance etc., for its advantages of stability and reliability, fast and high efficiency, portability and so on. This paper analyses the features, architecture and development technology of SQLite, gives a detailed porting process from SQLite to ARM-Linux platform, and discusses concrete application of SQLite in embedded system through a development case about the home gateway based on ARM-Linux.
Stochastic modeling of evaporating sprays within a consistent hybrid joint PDF framework
Authors: Gaurav Anand, Patrick Jenny
Venue: Journal of Computational Physics (2009)

In the present study, a framework for modeling two-phase evaporating flow is presented, which employs an Eulerian-Lagrangian-Lagrangian approach. For the continuous phase, a joint velocity-composition probability density function (PDF) method is used. Opposed to other approaches, such PDF methods require no modeling for turbulent convection and chemical source terms. For the dispersed phase, the PDF of velocity, diameter, temperature, seen gas velocity and seen gas composition is calculated. This provides a unified formulation, which allows to consistently address the different modeling issues associated with such a system. Because of the high dimensionality, particle methods are employed to solve the PDF transport equations. To further enhance computational efficiency, a local particle time-stepping algorithm is implemented and a particle time-averaging technique is employed to reduce statistical and bias errors. In comparison to previous studies, a significantly smaller number of droplet particles per grid cell can be employed for the computations, which rely on two-way coupling between the droplet and gas phases. The framework was validated using established experimental data and a good overall agreement can be observed.
WebSphere Revolution: The Inside Story of How IBM, Partners, and Customers Came Together to Transform Business
Authors: Jim Hoskins
Venue:  (2008)

IBM WebSphere is a powerful suite of middleware that is central to IBM's success in the software industry... but this book is not about that. WebSphere [R]Evolution is about the human story behind the development of WebSphere. It provides a rare inside look at the inner workings of IBM and the software industry that has never been shared before. Its a story about courageous customers, dedicated business partners, the efforts of over 6,000 IBM developers, and new models of software development. Its a story about the surprising decisions of IBM executives, marketing brilliance, and bold bets placed in a world of dynamic technology trends. But most importantly, its a story about the capacity of the human heart to innovate and achieve.
Fast convolution with the free space Helmholtz Green's function
Authors: Gregory Beylkin, Christopher Kurcz, Lucas Monzón
Venue: Journal of Computational Physics (2009)

We construct an approximation of the free space Green's function for the Helmholtz equation that splits the application of this operator between the spatial and the Fourier domains, as in Ewald's method for evaluating lattice sums. In the spatial domain we convolve with a sum of decaying Gaussians with positive coefficients and, in the Fourier domain, we multiply by a band-limited kernel. As a part of our approach, we develop new quadratures appropriate for the singularity of Green's function in the Fourier domain. The approximation and quadratures yield a fast algorithm for computing volumetric convolutions with Green's function in dimensions two and three. The algorithmic complexity scales as , where is selected accuracy, &kappa; is the number of wavelengths in the problem, d is the dimension, and C is a constant. The algorithm maintains its efficiency when applied to functions with singularities. In contrast to the Fast Multipole Method, as , our approximation makes a transition to that of the free space Green's function for the Poisson equation. We illustrate our approach with examples.
A human computer integrated approach for content based image retrieval
Authors: Phani Kidambi, S. Narayanan
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Advances in digital photography accompanied by the overwhelming usage of internet in the past few years have resulted in millions of images being uploaded on the Web (internet) every day. Most of the information is not readily accessible as the images are not organized to allow efficient browsing, searching and retrieval. The image search engines have been largely based on the annotations, as the process of image retrieval by the features and contents of the image is still in its infancy. Humans and computers have their own strengths and limitations. While the human cognitive skills limit themselves when voluminous data has to be interpreted and analyzed, computer algorithms can fail when the need for semantic knowledge is required from the image. Research in other areas has supported the claim that a hybrid computer aided and operator guided solution can potentially improve the performance of the system. Very little research has been done on the area of human computer interaction with respect to image retrieval based on annotations and image content. This paper mainly focuses on the use of human computer interaction with respect to image retrieval and also discusses the issues of semantic gap, indexing and correlation of images. A sports image data base will be used to demonstrate and evaluate our approach.
Role-based access control: past, present and future
Authors: Sylvia Osborn
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Role-based access control (RBAC) first appeared in the early 1990s. Since then, a lot of theoretical and practical research has been completed. We will discuss the origins of RBAC, survey some of the variations of RBAC and the research results obtained. we will then look at how it is being used today, and speculate on its future.
Some Constrained Notions of Planarity
Authors: Peter Eades
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Graph Drawing is the art and science of making pictures of graphs. Planarity has always played a central role in graph drawing research. Effective, efficient and elegant methods for drawing planar graphs were developed over the course of the last century by Wagner, Hopcroft and Tarjan, Read, de Frassieux, Pach and Pollack, amongst others.
Parallel Integer Motion Estimation Method by Using Reference Blocks Shared for HD Video Encloding
Authors: JinSeon Youn, JunRim Choi, Seung-Soo Han
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, we propose a parallel integer motion estimation method using reference blocks shared for HD video encoding. The proposed method uses a reference block to perform motion estimation with several current blocks. We achieved 100 times lower memory access rate than a full search algorithm and we demonstrated that the proposed method is a 30-fps solution of HD video at 106MHz with 600K gate counts and 80Kbit on-chip memory
"Pimp My Roomba": designing for personalization
Authors: JaYoung Sung, Rebecca E. Grinter, Henrik I. Christensen
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present a study of how householders personalize their domestic vacuuming robot, iRobot's Roomba". In particular, we build on Blom and Monk's [3] theory of personalization that argues that personalization does not only occur naturally but can also be induced by design choices. In this study, we created a personalization toolkit, which allowed people to customize their Roomba's appearance and distributed it to 15 households. Our observations of these households provide empirical support that personalization can facilitate positive experiences with a Roomba, and having materials to hand can increase the odds of customization. We conclude by discussing design implications for personalization.
Small World Topology-Aware Geographic Routing in Wireless Sensor Networks
Authors: Feng Xi, Zhong Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Geographic routing, based on greedy forwarding, relies on topology knowledge of the node's neighbors and achieves short path in the well-connected sensor networks. However, because of the absence of the topology knowledge outside of the neighborhood, the forwarding technique fails in the presence of void area. With the void-handling techniques, the geographic routing will experience non-short path and thus consume a large amount of energy. In this paper, a new concept of the topology knowledge, topological awareness, is proposed, which provides a node with myopic topology knowledge (neighbor nodes) and non-myopic topology knowledge (non-neighbor nodes). These non-neighbor nodes are discovered based on a small world model, such that a logical small world network is constructed. A novel geographic routing, called Small World Topology-Aware Routing (SWTAR) is proposed. It is demonstrated that SWTAR greatly enhance the packet delivery ratio without the need of the void-handling techniques and experience nearly shortest forwarding path, especially in the network seriously obstructed by obstacles.
Games on Multi-stack Pushdown Systems
Authors: Anil Seth
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

Bounded phase multi-stack pushdown automata have been studied recently. In this paper we show that parity games over bounded phase multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized. We show some applications of our result, including a new proof of a known result that emptiness problem for bounded phase multi-stack automata is decidable. 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
Effective IR-drop reduction in at-speed scan testing using Distribution-Controlling X-Identification
Authors: Kohei Miyase, Kenji Noda, Hideaki Ito, Kazumi Hatayama, Takashi Aikyo, Yuta Yamato, Hiroshi Furukawa, Xiaoqing Wen, Seiji Kajihara
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Test data modification based on test relaxation and X-filling is the preferable approach for reducing excessive IR-drop in at-speed scan testing to avoid test-induced yield loss. However, none of the existing test relaxation methods can control the distribution of identified don't care bits (X-bits), thus adversely affecting the effectiveness of IR-drop reduction. In this paper, we propose a novel test relaxation method, called Distribution-Controlling X-Identification (DC-XID), which controls the distribution of X-bits identified from a set of fully-specified test vectors for the purpose of effectively reducing IR-drop. Experimental results on large industrial circuits demonstrate the effectiveness and practicality of the proposed method in reducing IR-drop, without any impact on fault coverage, test data volume, or test circuit size.
The Organization and Scheduling of Massive Grid Geographic Data
Authors: XianGang Luo, Qi Ma, Zhong Xie
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

To solve the problem of organization and maintenance of massive grid geographic data, this paper present a multi-pyramid mixed organization model basing on the research of original pyramid model. In multi-pyramid model, a main pyramid could include some sub pyramid. Each sub pyramid is independent and can be deployed to different host. The paper also discusses the schedule method of grid data in different data organization model when grid data are displayed in the window, and achieved good effect in practice.
Estimating multivariate ARCH parameters by two-stage least-squares method
Authors: Saman Mousazadeh, Mahmood Karimi
Venue: Signal Processing (2009)

This paper discusses the asymptotic properties of the two-stage least-squares (TSLS) estimator of the parameters of multivariate autoregressive conditional heteroscedasticity (ARCH) model. The estimator is easy to obtain since it involves solving sets of linear equations. It will be shown that, under some conditions, this TSLS estimator is asymptotically consistent and its rate of convergence is the same as that of the quasi maximum likelihood estimator (QMLE). At the same time, the computational load of the TSLS estimator is extremely lower than that of the QMLE. The performance of the TSLS estimator will be evaluated and compared with QMLE using simulations. Simulation results show that the performances of the two estimators are comparable, even for small data records.
Design and Study on Salinity Controller
Authors: Lizong Lin, Zhiqin Qian, Xiaolin Wang, Zhiling Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A new kind of salinity controller of seawater desalination is presented. The calibration and circuit of the sensor are mainly discussed. Circuit design mainly introduced the analog circuit. Parameter calibration introduced the application of binary algebra interpolation method. Finally an improved method for raising measure accuracy is put forward.
Utility computing-based framework for e-governance
Authors: Jaijit Bhattacharya, Sushant Vashistha
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Developing countries are witnessing an upsurge in the number of e-Governance projects being undertaken. This has presented a lot of issues and challenges in efficiently using ICT in delivering effective governance at the lowest societal costs. One of the critical areas where there is duplication of infrastructure and manpower in e-governance is the data center. There are several approaches to e-Governance but most of them require the different government agencies to procure and maintain the entire IT infrastructure themselves. Utility Based Computing (UBC) offers tremendous potential to develop a sustainable e-Governance framework wherein a common data center infrastructure can be setup to provide the e-governance solutions, with different departments being billed as per the usage of the infrastructure. The combined potential of UBC to deliver computing on demand and to pay as you go paradigm offer a new approach to deliver cost-effective and efficient governance to the citizens. However, this framework has also its risks and issues.
Dynamic Spectrum Management: Optimization and Game Theoretic Formulations
Authors: Zhi-Quan (Tom) Luo
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Achieving efficient spectrum usage is a major challenge in the management of a complex communication system. With multiple users having conflicting objectives who share a common spectrum, some of whom may be hostile, careful resource allocation is essential for the effective utilization of the available frequency. Conventionally, spectrum sharing is achieved via orthogonal transmission schemes whereby the available frequency band is divided into multiple tones (or bands) which are pre-assigned to all the users on a non-overlapping basis. However, such "static orthogonal spectrum sharing" approach can lead to low bandwidth utilization. In fact, various recent spectrum occupancy studies have demonstrated that a typical geographical region has wide swathes of frequencies (up to 2/3 of the allocated radio spectrum) that are not used at any given time. While the utilization of spectrum varies with time, a significant amount of spectrum is available for opportunistic wireless applications among secondary users.Spectrum-sensing cognitive radio technology allows devices to dynamically and automatically seek out and use the optimum frequencies and bandwidth. To take advantage of the unused spectrum capacity, the users dynamically adapt to the spectral environment and change transmission or reception parameters on the fly. This allows for more efficient wireless communication without causing harmful interference with legacy systems or other devices using the same frequency bands. In these systems all users are allowed to use all the tones simultaneously. In comparison with the static spectrum sharing policies, this setup offers significantly greater freedom in utilizing the spectrum. A major challenge in the development of opportunistic spectrum sharing technology is to devise efficient algorithms for the distributed management of frequency slots and transmit power.This tutorial will describe various optimization and game theoretic formulations of the dynamic spectrum management and present some recent results on its complexity, duality and approximation. 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
New Quasi-Deadbeat FIR Smoother for Discrete-Time State-Space Signal Models: An LMI Approach
Authors: ChoonKi Ahn
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, we propose a new H2 smoother (H2S) with a finite impulse response (FIR) structure for discrete-time state-space signal models. This smoother is called an H2 FIR smoother (H2FS). Constraints such as linearity, quasi-deadbeat property, FIR structure, and independence of the initial state information are required in advance to design H2FS that is optimal in the sense of H2 performance criterion. It is shown that H2FS design problem can be converted into the convex programming problem written in terms of a linear matrix inequality (LMI) with a linear equality constraint. Simulation study illustrates that the proposed H2FS is more robust against uncertainties and faster in convergence than the conventional H2S.
The maximum size of hypergraphs without generalized 4-cycles
Authors: Oleg Pikhurko, Jacques Verstraëte
Venue: Journal of Combinatorial Theory Series A (2009)

Let f"r(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not contain four distinct edges A, B, C, D with A@?B=C@?D and A@?B=C@?D=@A. This problem was stated by Erdos [P. Erdos, Problems and results in combinatorial analysis, Congr. Numer. 19 (1977) 3-12]. It can be viewed as a generalization of the Turan problem for the 4-cycle to hypergraphs. Let @f"r=lim@?sup"n"->"~f"r(n)/(nr-1). Furedi [Z. Furedi, Hypergraphs in which all disjoint pairs have distinct unions, Combinatorica 4 (1984) 161-168] observed that @f"r>=1 and conjectured that this is equality for every r>=3. The best known upper bound @f"r==3, and @f"3=1 as r->~.
CMV: File consistency maintenance through virtual servers in peer-to-peer systems
Authors: Zhijun Wang, Anwitaman Datta, Sajal K. Das, Mohan Kumar
Venue: Journal of Parallel and Distributed Computing (2009)

Peer-to-peer (P2P) has become a mainstream architecture in numerous diverse distributed applications. However current P2P systems do not provide consistency guarantees under multiple reader multiple writer scenarios. Such a feature is desirable as well as necessary for supporting more diverse applications than merely file-sharing systems. In this paper, we develop a highly scalable and efficient algorithm, called Consistency Maintenance through Virtual servers (CMV), in P2P systems. In this algorithm, consistency of each dynamic file is maintained by a Virtual Server (VS). A file update can only be accepted through the VS to ensure one-copy serializability consistency. The VS of a file is a logical network composed of multiple Replica Peers (RPs) that have replicas of the file. Mathematical analysis is performed for optimal parameter selections that achieve minimum overhead messages for maintaining file consistency. Simulation experiments are conducted to compare the performance of the proposed CMV algorithm with two existing schemes, namely the rumor spreading based scheme and the Update Propagation Through Replica Chain (UPTReC) scheme. Our results show that CMV can quickly commit update to the system and significantly reduce (by more than 90%) overhead messages compared to these schemes under various system conditions.
Scalable Tensor Decompositions for Multi-aspect Data Mining
Authors: Tamara G. Kolda, Jimeng Sun
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensionalities. Tensors (i.e., multi-way arrays) provide a natural representation for such data. Consequently, tensor decompositions such as Tucker become important tools for summarization and analysis.One major challenge is how to deal with high-dimensional, sparse data. In other words, how do we compute decompositions of tensors where most of the entries of the tensor are zero. Specialized techniques are needed for computing the Tucker decompositions for sparse tensors because standard algorithms do not account for the sparsity of the data. As a result, a surprising phenomenon is observed by practitioners: Despite the fact that there is enough memory to store both the input tensors and the factorized output tensors, memory overflows occur during the tensor factorization process. To address this intermediate blowup problem, we propose Memory-Efficient Tucker (MET). Based on the available memory, MET adaptively selects the right execution strategy during the decomposition. We provide quantitative and qualitative evaluation of MET on real tensors. It achieves over 1000X space reduction without sacrificing speed; it also allows us to work with much larger tensors that were too big to handle before. Finally, we demonstrate a data mining case-study using MET.
FPGA implementation of real-time skin color detection with mean-based surface flattening
Authors: Seunghun Jin, Dongkyun Kim, Thien Cong Pham, Jae Wook Jeon
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Skin color is widely used in many applications because of its merit in human-machine interactions. However, detecting skin color requires repetitive operations on all pixels in the image, similar to other vision-based applications. Since the per-pixel processing is difficult to perform efficiently in conventional computers, many real-time image processing applications have problems with performance. In this paper, we propose FPGA implementation of a real-time skin color detection system. Among the various skin color detection methods, we chose a parametric skin distribution modeling method based on a Gaussian mixture, due to its acceptable training amount and skin detection performance. In addition, a mean-based surface flattening method was also proposed and implemented to improve the detection performance. The proposed method flattens the surface of objects in the scene by replacing the pixel value with the mean of its similar neighborhoods to remove the color noise. After this flattening process, the pixel values of the analogous adjacent pixels are located within a narrow range and are easily segmented to a different region. To consider the inherent parallelism of local image processing, all these functions are implemented within the FPGA to meet the demands of real-time performance.