ppxscal/embedding_network huggingface dataset:
Location-Dependent Skyline Query
Authors: Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Given a set of data points with both spatial coordinates andnon-spatial attributes, point a location-dependently dominates point b with respect to a query point q if a is closer to q than b and meanwhile a dominates b. A location-dependent skyline query (LDSQ) issued at point q is to retrieve all the points that are not location-dependently dominated by other points with regard to q. In this paper, we focus on the query processing and result validation of LDSQ overstatic objects. Two algorithms, namely brute-forth and δ-scanning, are proposed. The former serves as the baseline algorithm while the latter significantly improves the performance via space pruning. We further conduct a comprehensive simulation to demonstrate the performance of proposed algorithms.
Camera device driver development based on windows CE
Authors: Woonchul Ham, Hyunsok Choi
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Nowadays, camera is an one of most commercial products that are usually found in the market. It means that camera products are popular product and these popularity is likely to remain continue in the near future. In this paper, we describe a method of constructing camera device driver of Windows CE on embedded system. Used product for test is that MBA2440 board of AIJI system company, S3C2440A CPU of Samsung company, PO2030N camera of Pixelplus company. We used Windows CE operating system to operate the embedded board and the camera is operated with a camera device driver of Windows CE. First we describe firmware program which operate camera under a microprocessor level, then we describe a method of constructing camera device driver of Windows CE.
Towards a top-down approach to teaching an undergraduate grid computing course
Authors: Barry Wilkinson, Clayton Ferner
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Early undergraduate Grid computing courses generally took a bottom-up approach to Grid computing education starting with network protocols, client-server concepts, creating Web and Grid services, and then progressing through the underlying Grid computing middleware, security mechanisms and job submission all using a Linux command-line interface. We describe a new approach to teaching Grid computing beginning with a production-style Grid portal, registration process, and job submission, and then leading into infrastructure details. We incorporate seven assignments, several of which require students to install Grid computing software on their own computer or lab computers rather than using centralized servers. Students complete a "capstone" mini-project. Typical projects included creating a JSR 168 portlet user interface for an application. We describe our experiences using this new course structure.
Performance of digital subscriber line spectrum optimization algorithms
Authors: Miroslav Živković, Gerhard Kramer, Carl J. Nuzman, Carl Posthuma, James Wheeler, Phil Whiting, Adriaan J. de Lind van Wijngaarden
Venue: Bell Labs Technical Journal (2008)

A management standard for digital subscriber line (DSL) systems has been defined in order to ensure the spectral compatibility of the signals, services, and technologies that are deployed. Compatibility is typically accomplished by using static spectral masks. This conservative approach may lead to suboptimal performance of DSL systems. Recently, a number of dynamic spectrum management (DSM) solutions were proposed that improve DSL performance by adaptive application of spectral masks, also known as DSM level 2. The masks are calculated taking into account actual performance requirements and impairments, such as crosstalk. We present improved DSM level 2 algorithms that are faster than existing algorithms and demonstrate potential rate-reach gains by numerical simulations for some DSL technologies, such as asymmetric digital subscriber line transceivers. We also present a solution for flexible deployment of DSM spectrum optimization algorithms in the field. &copy; 2008 Alcatel-Lucent.
Bivariate Student t distributions with variable marginal degrees of freedom and independence
Authors: W. T. Shaw, K. T. A. Lee
Venue: Journal of Multivariate Analysis (2008)

We propose a class of bivariate Student t distributions generalizing the standard density. Our generalization allows for differing marginal degrees of freedom and independent marginals. There are several approaches to constructing such distributions, but in the special case of the Student-normal distribution we show that there is a common canonical limit. Our distributions arise from the techniques used in t-copula simulation, rather than the traditional elliptical methodology.
Transmitting Range Assignments Using Steiner Tree in Ad Hoc Wireless Networks
Authors: Rashid Bin Muhammad
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we discuss the problem of assigning transmitting ranges and establishing connectivity in ad hoc wireless networks from the practical perspective. That is, setup a communication links by introducing extraneous nodes to the network in the emergencies. Furthermore, transmitting ranges of nodes must be assigned in such a way that the energy cost is minimum. The main contribution of this work is the O(N log N) algorithm to add relay nodes to the network and 2-approximation to assign transmitting ranges of nodes (original and relay). The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes. The paper also analyzed the complexity and established the correctness of the proposed algorithm.
Scalable OpenGroupware.org
Authors: Francis Lachapelle, Ludovic Marcotte
Venue: Linux Journal (2008)

Looking for an advanced Web interface, native clients or access through mobiles devices to your groupware platform? SOGo has it all.
Mandarin short message dictation on Symbian series 60 mobile phones
Authors: Jari Alhonen, Yang Cao, Guohong Ding, Ying Liu, Jesper Olsen, Xia Wang, Xinxing Yang
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Despite having limited keypads, mobile phones are nevertheless widely used for composing text messages, and the need to process text on the mobile is growing all the time. Speech dictation is a possible solution, but has until recently not been a viable option due the limited computational resources available on mobile phones. We have previously implemented mobile speech dictation for English and other European languages. Chinese differs in many ways from European languages - Chinese is a tonal, syllabic language and written Chinese is not based on an alphabet. From a UI perspective Chinese text input is arguably more challenging than text input in European languages. In this paper we describe how we have ported our UI and dictation engine to support Mandarin Chinese. The system has been implemented to run in real time on the MCU of Nokia S60 mobile phones (E50, E60, E62 and N73).
Disaster avoidance mechanism for content-delivering service
Authors: Chih-Chin Liang, Chia-Hung Wang, Hsing Luh, Ping-Yu Hsu
Venue: Computers and Operations Research (2009)

Many software applications have been developed on client-server and web-based architectures, with client software installed in numerous clerks' devices spread over the whole of Taiwan along the hierarchical organization of large-scaled service companies. The damage for a large-scaled service company would be caused by an inconsistent system, in which client software fails to receive updated content causing loss of emergency calls and possibility of recovery. Therefore, a reliable content-delivering service is needed for such a large-scaled service company to ensure system consistency whenever a disaster occurs. This study analyses the error situations of a proposed content-delivering service that has been implemented in a large-scaled company in Taiwan. Moreover, its disaster avoidance mechanism provides a reliability model with the waiting-time distribution of disconnected links. The proposed disaster avoidance mechanism prevents damage from terminating operations of a company caused by disasters, such as earthquakes, tsunamis, nuclear plant explosions or wars. Empirical results demonstrate that the proposed design run on 19 servers distributes content with less than 3.4 content-delivery failures per million hours.
Analyses of user rationality and system learnability: performing task variants in user tests
Authors: Effie Lai-Chong Law, Borka Jerman Blazic, Matic Pipan
Venue: Behaviour & Information Technology (2007)

No systematic empirical study on investigating the effects of performing task variants on user cognitive strategy and behaviour in usability tests and on learnability of the system being tested has been documented in the literature. The current use-inspired basic research work aims to identify the underlying cognitive mechanisms and the practical implications of this specific endeavour. The focus of our work was to assess user rationality and system learnability. The software application tested was a multilingual learning resource repository. Eleven German and eleven Slovenian participants were involved in two user tests (UTs). Usability problems (UPs) identified in two quasi-isomorphic tasks were categorized with respect to a scheme of associated skills. Actions of the two tasks of each of the 22 users were segmented and coded according to a scheme of cognitive activities. Results showed that generally the users adopted different strategies for working out the given task and its variant, and that the system could be proved learnable. User Rational Action Model and implications for future research on user tests are inferred.
Sublinear-time parallel algorithms for matching and related problems
Authors: A. V. Goldberg
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The authors present the first sub-linear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. The results are based on a better understanding of the combinatorial structure of the above problems, which lead to new algorithmic techniques. In particular, it is shown how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. It is also shown how to apply the techniques to design parallel algorithms for the weighted versions of the above problems.
Intelligent system for the automated diagnosis of histological images
Authors: J. I. Estévez, J. F. Sigut, J. L. Sánchez, J. D. Piñeiro, S. Alayón, R. L. Marichal, J. M. Torres
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The problem of diagnosing histological/cytological images is the main objective of this work. A system for the analysis of this kind of digital images is proposed. This system aims to systematize the image processing/machine vision/classification procedures needed to reproduce the physician interpretive abilities and collect them in standardized protocols both reproducible and of quantifiable performance. Flexible soft-computing techniques will be needed to reach an adequate performance at the level of image interpretation, while a knowledge-centric, object-oriented implementation approach will be preferable to hide the details of these procedures from the specialist. A case study of pathology diagnosis is proposed as illustration of the difficulties and the techniques that will be used in the system.
Coding of two-dimensional constraints of finite type by substitutions
Authors: Christiane Frougny, Laurent Vuillon
Venue: Journal of Automata, Languages and Combinatorics (2005)

We give an automatic method to generate transition matrices associated with two-dimensional contraints of finite type by using squared substitutions of constant dimension.
Spillover-Partitioning Call Admission Control for Revenue Optimization with QoS Guarantees for Multiple Service Classes in Mobile Wireless Networks
Authors: Okan Yilmaz, Ing-Ray Chen, Gregory Kulczycki, William Frakes
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We propose and analyze spillover-partitioning call admission control (CAC) for servicing multiple service classes in mobile wireless networks for revenue optimization with quality of service (QoS) guarantees. We evaluate the performance of spillover-partitioning CAC in terms of execution speed and optimal revenue obtainable by comparing it with existing CAC algorithms, including partitioning, threshold, and partitioning-threshold hybrid admission control algorithms. We also investigate fast spillover-partitioning CAC which effectively trades off solution optimality for solution efficiency. We demonstrate through test cases that spillover-partitioning CAC outperforms existing CAC algorithms for revenue optimization with QoS guarantees in both solution optimality and solution efficiency for serving multiple QoS service classes in wireless networks.
Timely offloading of result-data in HPC centers
Authors: Henry M. Monti, Ali R. Butt, Sudharshan S. Vazhkudai
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

High performance computing is facing an exponential growth in job output dataset sizes. This implies a significant commitment of supercomputing center resources---most notably, precious scratch space---in handling data staging and offloading. However, the scratch area is typically managed using simple "purge policies", without sophisticated "end-user data services" that are required to balance center's resource consumption and user serviceability. End-user data services such as offloading are performed using point-to-point transfers that are unable to reconcile center's purge and users delivery deadlines, unable to adapt to changing dynamics in the end-to-end data path and are not fault-tolerant. We propose a robust framework for the timely, decentralized offload of result data, addressing the aforementioned significant gaps in extant direct-transfer-based offloading. The decentralized offload is achieved using an overlay of user-specified intermediate nodes and well known landmark nodes. These nodes serve as a means both to provide multiple data-flow paths, thereby maximizing bandwidth as well as provide fail-over capabilities for the offload. We have implemented our techniques within a production job scheduler (PBS) and data transfer tool (BitTorrent), and our evaluation shows that the offloading times can be significantly reduced (90.2% for a 2.1 GB file), while also meeting center-user Service Level Agreements.
SIMBA: m&eacute;thodologie et plateforme de prototypage moyenne fid&eacute;lit&eacute; pour les syst&egrave;mes interactifs mixtes
Authors: Wafaa Abou Moussa, Emmanuel Dubois, Christophe Bortolaso, Pascal Salembier, Jean-Pierre Jessel, Cédric Bach
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

In this paper, we present SIMBA, a prototyping approach dedicated to Mixed Interactive Systems (MIS). This approach supports the use of an existing co-design process of MIS. SIMBA combines a &laquo;medium fidelity&raquo; prototyping platform based on simulation, and a model-driven development process. Simulation-based prototyping allows for a fast and inexpensive generation of mixed interactive prototypes. A model-driven development process enables such prototypes to be tightly coupled with design choices established in earlier design phases. It also supports an incremental evolution into the final, not simulated, MIS. The prototyping approach that we present is based on the identification of the roles of the different actors involved in a MIS development process and the collaboration between them. An augmented museum application is used throughout this paper to illustrate the proposed prototyping approach.
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
Authors: Mercedes Merayo, Manuel Núñez, Ismael Rodríguez
Venue: IEEE Transactions on Computers (2008)

In this paper we introduce a timed extension of the extended finite state machines model. On the one hand, we consider that (output) actions take time to be performed. This time may depend on several factors such as the value of variables. On the other hand, our formalism allows to specify timeouts. In addition to present our language, we develop a testing theory. First, we define ten timed conformance relations and relate them. Second, we introduce a notion of timed test and define how to apply tests to implementations. Finally, we give an algorithm to derive sound and complete test suites with respect to the implementation relations presented in the paper.
Support Vector Machinery for Infinite Ensemble Learning
Authors: Hsuan-Tien Lin, Ling Li
Venue: The Journal of Machine Learning Research (2008)

Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are limited to combining only a finite number of hypotheses, and the generated ensemble is usually sparse. Thus, it is not clear whether we should construct an ensemble classifier with a larger or even an infinite number of hypotheses. In addition, constructing an infinite ensemble itself is a challenging task. In this paper, we formulate an infinite ensemble learning framework based on the support vector machine (SVM). The framework can output an infinite and nonsparse ensemble through embedding infinitely many hypotheses into an SVM kernel. We use the framework to derive two novel kernels, the stump kernel and the perceptron kernel. The stump kernel embodies infinitely many decision stumps, and the perceptron kernel embodies infinitely many perceptrons. We also show that the Laplacian radial basis function kernel embodies infinitely many decision trees, and can thus be explained through infinite ensemble learning. Experimental results show that SVM with these kernels is superior to boosting with the same base hypothesis set. In addition, SVM with the stump kernel or the perceptron kernel performs similarly to SVM with the Gaussian radial basis function kernel, but enjoys the benefit of faster parameter selection. These properties make the novel kernels favorable choices in practice.
An improved method of speech compression using warped LPC and MLT-SPIHT algorithm
Authors: Maitreyee Dutta, Renu Vig
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Frequency -warped signal processing techniques are attractive to many wideband speech and audio applications since they have a clear connection to the frequency resolution of human hearing. A warped version of the linear predictive coding (LPC) for speech compression is implemented in this paper and an analysis of the application of Set Partitioning In Hierarchical Trees (SPIHT) algorithm to the compression of speech signals is performed. It has been shown that the proposed scheme i.e. Warped LPC with MLT_SPIHT algorithm produces an enhancement in speech quality. The proposed scheme is based on the combination of the Modulated Lapped Transform(MLT) and SPIHT. Comparisons are made with Plain LPC Coder, Voice Excited LPC Coder with the coding of the residual signal with DCT, Voice Excited LPC Coder with the coding of the residual signal with MLT and SPIHT. The performance of the coders described has been assessed by computer simulation in terms of a) Signal -to -noise ratio (SNR) b) Compression ratio c) Informal subjective listening test.
Increasing soft classification accuracy through the use of an ensemble of classifiers
Authors: H. T. X. Doan, G. M. Foody
Venue: International Journal of Remote Sensing (2007)

Although soft classification analyses can reduce problems such as those associated with mixed pixels that impact negatively on conventional hard classifications their accuracy is often low. One approach to increasing the accuracy of soft classifications is the use of an ensemble of classifiers, an approach which has been successful for hard classifications but rarely applied for soft classifications. Four methods for combining soft classifications to increase soft classification accuracy were assessed. These methods were based on (i) the selection of the most accurate predictions on a class-specific basis, (ii) the average of the outputs of the individual classifications for each case, (iii) the direct combination of classifications using evidential reasoning and (iv) the adaptation of the outputs to enable the use of a conventional (hard classification) ensemble approach. These four approaches were assessed with classifications of National Oceanic and Atmospheric Administration (NOAA) Advanced Very High-Resolution Radiometer (AVHRR) imagery of Australia. The data were classified using two neural networks and a probabilistic classifier. All four ensemble approaches applied to the outputs of these three classifiers were found to increase classification accuracy. Relative to the most accurate individual classification, the increases in overall accuracy derived ranged from 2.20% to 4.45%, increases that were statistically significant at 95% level of confidence. The results highlight that ensemble approaches may be used to significantly increase soft classification accuracy.
Gray Hat Hacking, Second Edition, 2 edition
Authors: Shon Harris, Allen Harper, Chris Eagle, Jonathan Ness
Venue:  (2007)

"A fantastic book for anyone looking to learn the tools and techniques needed to break in and stay in." --Bruce Potter, Founder, The Shmoo Group"Very highly recommended whether you are a seasoned professional or just starting out in the security business." --Simple Nomad, HackerTable of contentsPart I: Introduction to Ethical DisclosureChapter 1. Ethics of Ethical HackingChapter 2. Ethical Hacking and the Legal SystemChapter 3. Proper and Ethical DisclosurePart II: Penetration Testing and ToolsChapter 4. Using MetasploitChapter 5. Using the BackTrack LiveCD Linux DistributionPart III: Exploits 101Chapter 6. Programming Survival SkillsChapter 7. Basic Linux ExploitsChapter 8. Advanced Linux ExploitsChapter 9. Shellcode StrategiesChapter 10. Writing Linux ShellcodeChapter 11. Basic Windows ExploitsPart IV: Vulnerability AnalysisChapter 12. Passive AnalysisChapter 13. Advanced Static Analysis with IDA ProChapter 14. Advanced Reverse EngineeringChapter 15. Client-Side Browser ExploitsChapter 16. Exploiting Windows Access Control Model for Local Elevation of PrivilegeChapter 17. Intelligent Fuzzing with SulleyChapter 18. From Vulnerability to ExploitChapter 19. Closing the Holes: MitigationPart V: Malware AnalysisChapter 20. Collecting Malware and Initial AnalysisChapter 21. Hacking MalwareIndex