ppxscal/embedding_network huggingface dataset:
Efficient query processing for multi-dimensionally clustered tables in DB2
Authors: Bishwaranjan Bhattacharjee, Sriram Padmanabhan, Timothy Malkemus, Tony Lai, Leslie Cranston, Matthew Huras
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We have introduced a Multi-Dimensional Clustering (MDC) physical layout scheme in DB2 version 8.0 for relational tables. Multi-Dimensional Clustering is based on the definition of one or more orthogonal clustering attributes (or expressions) of a table. The table is organized physically by associating records with similar values for the dimension attributes in a cluster. Each clustering key is allocated one or more blocks of physical storage with the aim of storing the multiple records belonging to the cluster in almost contiguous fashion. Block oriented indexes are created to access these blocks. In this paper, we describe novel techniques for query processing operations that provide significant performance improvements for MDC tables. Current database systems employ a repertoire of access methods including table scans, index scans, index ANDing, and index ORing. We have extended these access methods for efficiently processing the block based MDC tables. One important concept at the core of processing MDC tables is the block oriented access technique. In addition, since MDC tables can include regular record oriented indexes, we employ novel techniques to combine block and record indexes. Block oriented processing is extended to nested loop joins and star joins as well. We show results from experiments using a star-schema database to validate our claims of performance with minimal overhead.
A conceptual framework and propositions for the acceptance of mobile services
Authors: Sally Rao, Indrit Troshani
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

Mobile services are heralded to create a tremendous spectrum of business opportunities. User acceptance of these services is of paramount importance. Consequently, a deeper insight into theory-based research is required to better understand the underlying motivations that lead users to adopting mobile services. As mobile services bring additional functional dimensions, including hedonic and experiential aspects, using extant models for predicting mobile services acceptance by individuals may be inadequate. The aim of this paper is to explore, analyse and critically assess the use of existing acceptance theories in the light of the evolving and ubiquitous mobile services and their underlying technologies. Constructs affecting consumer adoption behaviour are discussed and relevant propositions are made. Managerial implications are explored and future research directions are also identified.
Design of VY: A Mini Visual IDE for the Development of GUI in Embedded Devices
Authors: Le Yang, Yongsun Choi, Changjun Seo, Tongfeng Yang, MinSung Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Graphical User Interface (GUI) for applications of Embedded Devices (ED) has been increasingly in demand. Rapid GUI development tools are being required more than ever. However, traditional way of GUI development for ED applications has some limitation in support of visual environment and blocks rapid development. In this paper, we introduce a new mini visual IDE, called VY, which supports rapid development utilizing control library, and simulation of GUI. VY can realize the development of GUI in ED efficiently by means of "What You See Is What You Get"(WYSIWYG). It consists of five modules: Simulator, Control Library, Script Complier, Script Virtual Machine (SVM) and Visual Window. By utilizing the hardware-independent Control Library of graphical interfaces, an attractive GUI can be produced with much less script effort on the Visual Window. Then, the script file is compiled into script data (including instructions) which will be executed by the SVM with visiting system calls in ED, and the Simulator will display the resulting GUI. After all these steps, the final GUI can be downloaded into the ED system. In this way, VY supports rapid development of hardware-independent GUI for ED applications on a visual metaphor.
Preliminary Research on Grid-based Remote Sensing Image distributed Processing
Authors: Jiakui Tang, Aijun Zhang, Shengyang Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Massive remote sensing image fast processing is one of the important tasks for remote sensing image applications, it is not only data intensive but also computation intensive, which arises our interest in distributed parallel processing by grid computing., The novel grid computing technology seeks to aggregate computing resources which are geographically distributed or heterogeneous for computational intensive applications. In this paper, a grid-based image processing testbed is established for remote sensing image distributed processing, and middleware is developed, which was applied to remote sensing image distributed deblurring processing. Preliminary experimental results show the processing efficiency is greatly improved, which demonstrate the promising potential of grid computing technology on remote sensing image distributed processing.
A Selective Interpolation Scheme for Mobile Camera Sensors
Authors: Doowon Paik, Byeung-Soo Kim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Pictures can be taken anywhere with cameras built in mobile phones, but it is not easy to make a good quality of picture with the built-in camera, especially when enough light is not provided. One of the reasons for the degradation is that with little light, noise increases and the interpolation for Bayer patterned image does not produce good quality of image. In this paper we compared the performance of interpolation algorithms for Bayer patterned image sensors under the various lighting conditions and our experimentation showed that performance of interpolation algorithms depend on the lighting conditions heavily. Based on this observation, we proposed an interpolation scheme that selects the best interpolation algorithms according to the input lighting condition. This scheme can be easily implemented and embedded in the signal processor to improve the quality of pictures for mobile cameras.
Directed test generation using symbolic grammars
Authors: Rupak Majumdar, Ru-Gang Xu
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We present CESE, a tool that combines exhaustive enumeration of test inputs from a structured domain with symbolic execution driven test generation. We target programs whose valid inputs are determined by some context free grammar. We abstract the concrete input syntax with symbolic grammars, where some original tokens are replaced with symbolic constants. This reduces the set of input strings that must be enumerated exhaustively. For each enumerated input string, which may contain symbolic constants, symbolic execution based test generation instantiates the constants based on program execution paths. The "template" generated by enumerating valid strings reduces the burden on the symbolic execution to generate syntactically valid inputs and helps exercise interesting code paths. Together, symbolic grammars provide a link between exhaustive enumeration of valid inputs and execution-directed symbolic test generation Preliminary experiments with CESE show that the combination achieves better coverage than both pure enumerative test generation and pure directed symbolic test generation, in orders of magnitude less time and number of generated inputs. In addition, CESE is able to automatically generate inputs that achieve coverage within 10% of manually constructed tests.
Application of Grey Majorized Model in the MSW Settlement Forecasting
Authors: Yu Zhao, Xiaohong Li, Yiyu Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Source grey GM(1,1) model usually be used simulation and prediction of equidistant monitoring data sequent. But to non-equidistant and high growth data sequent, had to build the grey GM(1,1) model through equidistant treatment of non-equidistant data or to build directly nonequidistant grey model through complex transformation , and usually had larger lagging error. In time sequent [k,k+1] interval, in order to majorize and increase accuracy of background value z(1)(k+1), the area of [k,k+1] interval and GM(1,1) function curve envelope had been replaced by n small interval trapezoidal area .The GM(1,1) grey majorized model was built based on majorized grey model background value generally be used simulation and prediction of equidistant or nonequidistant and low or high growth data sequent of the MSW landfill settlement displacement. Data sequent characters of landfill displacement can be simulated and predicted better by the grey majorized model, and the model had higher simulation and prediction accuracy.
Shoeprint Image Retrieval Based on Local Image Features
Authors: H. Su,  D. Crookes, A. Bouridane, M. Gueham
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

This paper deals with the retrieval of scene-of-crime (or scene) shoeprint images from a reference database of shoeprint images by using a new local feature detector and an improved local feature descriptor. Our approach is based on novel modifications and improvements of a few recent techniques in this area: (1) the scale adapted Harris detector, which is an extension to multi-scale domains of the Harris corner detector; (2) automatic scale selection by the characteristic scale of a local structure. (3) SIFT (Scale-Invariant Feature Transform), one of the most widely investigated descriptors in recent years. Like most of other local feature representations, the proposed approach can also be divided into two stages: (i) a set of distinctive local features are selected by first detecting scale adaptive Harris corners where each of them is associated with a scale factor, and then selecting as the final result only those corners whose scale matches the scale of blob-like structures around them. Here, the scale of a blob-like structure is detected by the Laplace-based scale selection. (ii). for each feature detected, an enhanced SIFT descriptor is computed to represent this feature. Our improvements lead two novel methods which we call the Modified Harris-Laplace (MHL) detector, and the enhanced SIFT descriptor. In this paper, we demonstrate the application of the proposed scheme to the shoeprint image retrieval problem using six sets of synthetic scene images, 50 images for each, and a database of 500 reference shoeprint images. The retrieval performance of the proposed approach is significantly better, in terms of cumulative matching score, than the existing methods investigated in this application area, such as edge directional histogram, power spectral distribution, and pattern & topological spectra.
A Genetic System for Cluster Analysis for Hypertext Documents
Authors: Lando M. di Carlantonio
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Due to the increase in the number of WWW home pages, we are facing new challenges for information retrieval and indexing. Some "intelligent" techniques, including neural networks, symbolic learning, and genetic algorithms have been used to group different classes of data in an efficient way. This article describes a system for cluster analysis of hypertext documents based on genetic algorithms. The effectiveness of the system in getting groups with similar documents is evidenced by the experimental results.
Indexing future trajectories of moving objects in a constrained network
Authors: Ji-Dong Chen, Xiao-Feng Meng
Venue: Journal of Computer Science and Technology (2007)

Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.
Self-Testing Computers
Authors: J. B. Clary
Venue: Computer (1979)

Built-in-test techniques exploit hardware redundancy to provide continuous on-line monitoring of computer performance. Hardware's declining cost makes these techniques attractive, especially for modular computers.
Large Vocabulary Mandarin Continuous Speech Recognition under Noisy Environment
Authors: Qingwei Zhao, Yonghong Yan, Jielin Pan, Qiang Fu, Jianping Zhang, Ping Lv, Fuping Pan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Noise environment and natural spoken speech, is still a challenging issue for speech recognition. In this paper, study on this field is explored on Mandarin speech, from aspects of signal processing, acoustic model, language model, decoding algorithm, and post processing. The two-phase mel-warped wiener filter algorithm is improved for obtaining noise-robust feature. Segmentation algorithm and gender determination algorithm is proposed based on phone decoder. MMIE training algorithm and noise-adding training technology is exploited. One-pass search algorithm is adopted based on cross-word acoustic model, compact search space is constructed which can accurately describe the acoustic context. New fusing technology of multiple sub-systems is proposed which adopt different acoustic feature. Experiments on three testing sets of Mandarin continuous speech show that, the new system obtains relative error reduction of 39.28% in contrast to the baseline system. And the performance of multiple algorithm modules has also been analyzed in detail.
Subchannelization Performance for the Downlink of a Multi-cell OFDMA System
Authors: Carle Lengoumbi, Philippe Godlewski, Philippe Martins
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

the downlink of a multi-cell OFDMA system are investigated. The frequency reuse factor is one. The subchannelization mode FUSC adopted in 802.16 is considered: frequency collision problem and partial loading are addressed. For a full loading factor, performances are compared with dynamic subcarrier allocation algorithms. Index Terms-- IEEE 802.16, multi-cell, OFDMA, partial loading, subchannelization.
The eyes remember it: Oculography and pupillometry during recollection in three amnesic patients
Authors: Bruno Laeng, Knut Waterloo, Stein Harald Johnsen, Søren Jacob Bakke, Torstein Låg, Synnøve Steiro Simonsen, Jørgen Høgsæt
Venue: Journal of Cognitive Neuroscience (2007)

Two patients (TC and SS) with lesions that included the hippocampal regions (predominantly on the left side) were severely impaired in their recall of simple, verbally stated facts. However, both patients remembered spatial information that was temporally associated with semantic information. Specifically, TC and SS could not recall explicitly the content of an episode, but their spontaneous oculomotor behavior showed that they retained some information about the event as their gaze automatically returned to the locations on the computer screen where visual information had been paired to verbally presented information. Thus, this spatial information is implicit, automatically retrieved, and eye-based, as when one patient (TC) was asked to point with the finger to the same positions he was impaired. In addition, in an old/new recognition task, TC and SS and an additional patient, OB, showed significant changes in eye pupil diameter when viewing novel visual stimuli compared to stimuli that they had previously seen, also when they (incorrectly) declared with confidence that an old item was new. The spared memory of these patients, despite severe amnesia for the learning episodes, is characterized by a re-enactment of previous eye fixations that were associated with each (forgotten) episode and physiological responses (as indexed by pupillometry) to previously seen stimuli. Such spared memory can be seen as a type of “snapshot” memory, which automatically processes eye-based spatial information and whose content remains implicit. Finally, we surmise on the basis of the neuroanatomical findings of these patients, that neural substrates in the spared (right) hemisphere might support both the eye fixations' re-enactment and implicit visual pattern recognition.
An Access Control Metamodel for Web Service-Oriented Architecture
Authors: Christian Emig, Frank Brandt, Sebastian Abeck, Jurgen Biermann, Heiko Klarl
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

With the mutual consent to use WSDL (Web Service Description Language) to describe web service interfaces and SOAP as the basic communication protocol, the cornerstone for web service-oriented architecture (WSOA) has been established. Considering the momentum observable by the growing number of specifications in the web service domain for the indispensable cross-cutting concern of identity management (IdM) it is still an open issue how a WSOA-aware IdM architecture is built and how it is linked with WSOA's main elements, the web services providing functional core concerns. In this paper we present an access control model for WSOA and a blueprint of a WSOAaware authorization verification service which is part of the IdM architecture. We show the integration of this service with WSOA consisting of both basic and composite web services. Our solution has been tested and evaluated in an implementation case study.
The Variant of Gaussian Kernel and Its Model Selection Method
Authors: Shui-Sheng Zhou, Hong-Wei Liu, Feng Ye
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The classification problem by nonlinear support vector machine with kernel function is discussed in this paper. The stretching ratio is defined in order to analyze the performance of the kernel function. A new type of kernel function is introduced by modifying the Gaussian kernel, and it has many properties as good as or better than Gaussian function. For example, the map of the new kernel function magnifies the distance between vectors in local because the stretching ratio is always lager than one without enlarging the radius of the circumscribed hypersphere that includes the whole mapping vectors in feature space, which gets the bigger margin. Two criterions are proposed to choose a good spread parameter for a given kernel function approximately but easily. Some experiments are given to compare the classification performances between the proposed kernel function and Gaussian kernel function.
An Energy-Efficient Scheme of Deploying Nodes in Wireless Sensor Networks
Authors: KeZhong Lu, XiaoHui Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In wireless sensor networks, sensor nodes collect local data and transfer to the base station often relayed by other nodes. If deploying sensor nodes evenly, sensor nodes nearer to the base station will consume more energy and use up their energy faster that reduces system lifetime. By analyzing energy consumption, a density formula of deploying nodes is proposed. The ratio of whole energy of sensor nodes to energy consumption speed of sensor nodes in every area can get consistent if deploying nodes by the density formula, therefore system lifetime is prolonged. Analysis and simulation results show that when communication dominates whole energy consumption and the monitored region is big compared with radio range of sensor node, system lifetime under this scheme can be 3R/(2t) times of that under deploying nodes evenly, where R is radius of the monitored region and t is radio range of sensor node.
Ensuring consistency in long running transactions
Authors: Jeffrey Fischer, Rupak Majumdar
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Flow composition languages permit the construction of long-running transactions from collections of independent atomic services. Due to environmental limitations, such transactions usually cannot be made to conform to standard ACID semantics. We propose set consistency, a powerful, yet intuitive, notion of consistency for long-running transactions. Set consistency considers the collection of permanent (non-intermittent) changes made by a process, when viewed at the end of its execution. Consistency requirements for such collections of changes are specified as predicates over the atomic actions of a process. Set consistency generalizes self-cancellation, a standard consistency requirement for long-running transactions, where failed processes are responsible for undoing any partially completed work. Set consistency can also express strictly stronger requirements, such as mutual exclusion or dependency. We show that the set consistency verification problem for processes is co-NP complete and present an algorithm for verifying set consistency by reduction to propositional validity. We have implemented this algorithm and demonstrate the value and tractability of our approach on three real-world case studies. In each case, the consistency requirements can be verified within a second, demonstrating the practicality of our approach.
A Basic-Unit Size Based Adaptive Rate Control Algorithm
Authors: Wen Lu, Xinbo Gao, Qingeng Deng, Tisheng Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In order to transmit video efficiently object bandwidth, the rate fluctuation should be controlled to make it as close to the target bandwidth as possible. So, although rate-control is not a part of the standard of H.264/AVC, it has been playing an important role in the standard all the time. For this purpose, on the basis of JVT-G012 algorithm, a new rate-control algorithm based on the Spatial Temporal Gradient Scale (STGS) image is presented for H.264/AVC coding to select the size of basic-unit adaptively. The rate fluctuation resulted from the proposed algorithm is always close to the best case of JVT-G012 algorithm. Moreover, for the low computational complexity, the proposed algorithm is easy to implement in real time.