ppxscal/embedding_network huggingface dataset:
Performance of the combining received differential encoding transmit diversity with imperfect carrier recovery over correlated Nakagami fading channels: Research Articles
Authors: Guoping Fan, Pingyi Fan, Zhigang Cao
Venue: Wireless Communications Mobile Computing (2004)

A differential detection scheme for transmit diversity was proposed by Tarokh, which can achieve full diversity order without the requirement to estimate the channel state at the receiver. This paper investigates the potential of using multiple receive antennas for differential space time coded MPSK signals over correlated Nakagami fading channels. We also investigate the effect of the carrier frequency offset (CFO) and channel correlation on its performance and present some results on its maximal tolerable frequency offsets for different MPSK signals. The results have shown that the differential encoding transmit diversity is very robust to the CFO and channel correlation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An asynchronous middleware for Grid resource monitoring: Research Articles
Authors: V. Quéma, R. Lachaize, E. Cecchet
Venue: Concurrency and Computation: Practice Experience (2004)

Resource management in a Grid computing environment raises several technical issues. The monitoring infrastructure must be scalable, flexible, configurable and adaptable to support thousands of devices in a highly dynamic environment where operational conditions are constantly changing.We propose to address these challenges by combining asynchronous communications with reflective component-based technologies. We introduce D REAM (Dynamic REflective Asynchronous Middleware), a Java component-based message oriented middleware. Asynchronous communications are used to achieve the scalability and flexibility objectives, whereas the reflective component technology provides the complementary configurability and adaptability features.We argue that this infrastructure is a viable approach to build a resource monitoring infrastructure for Grid computing. Moreover, D REAM makes the monitoring logic accessible from J2EE application servers. This allows the monitoring information to be presented as a Grid service and to integrate within the Open Grid Software Architecture. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The Continuous Newton--Raphson Method Can Look Ahead
Authors: Raphael Hauser, Jelena Nedic
Venue: SIAM Journal on Optimization (2005)

This paper is about an intriguing property of the continuous Newton--Raphson method for the minimization of a continuous objective function f: if x is a point in the domain of attraction of a strict local minimizer x*, then the flux line of the Newton--Raphson flow that starts in x approaches x* from a direction that depends only on the behavior of f in arbitrarily small neighborhoods around x and x*. In fact, if $\hat{f}$ is a sufficiently benign perturbation of f on an open region D not containing x, then the two flux lines through x defined by the Newton--Raphson vector fields that correspond to f and $\hat{f}$ differ from one another only within D.
Fingerprint Center Point Location Using Directional Field
Authors: Y. H. Chan, S. A. R. Abu-Bakar
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a reliable fingerprint center point (CP) location algorithm for the alignment of fingerprints to construct a shift invariant fingerprint recognition system. The proposed algorithm is based on Alteration Tracking (AT) and CP estimation (CPE). AT is proposed to extract a track that records the transition from one quantized direction to another. CPE is aimed to find the bending point with highest transition of direction from the transition track. This algorithm is tested against fingerprints captured from SAGEM MSO100 optical scanner and the second database from University of Bologna. Experimental result shows that the proposed algorithm is capable of reliably locating fingerprint CP.
A new strategy for querying priced information
Authors: Ferdinando Cicalese, Eduardo Sany Laber
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. The cost cx has to be paid to read the value of x. The problem is to design algorithms that query the values of the variables sequentially in order to compute the function while trying to minimize the total cost incurred. Competitive analysis is employed to evaluate the performance of the algorithms. We describe a novel approach for devising efficient algorithms in this setting. We apply our approach to several classes of functions which have been studied in the literature of computing with priced information. In all cases considered, our approach provides algorithms that achieve better bounds than the best known algorithm for the same class of functions.More precisely, for the class of monotone boolean functions, we give a polynomial time algorithm with extremal competitiveness (k+l - √ min(k,l)) where k (l) denotes the minimum number of variables that one must read, in the worst case, in order to prove that the function under consideration evaluates to 1 (0). This dramatically improves upon the best known result which is an exponential time 2 max(k, l)-competitive algorithm. For the subclass of monotone boolean functions known as Threshold Trees we further improve our bounds and give a polynomial time algorithm with extremal competitive ratio 1.618 max(k, l).We then apply our methodology to classes of non-boolean functions. We consider the case of the so called Game Trees. We improve upon previously published results for this class of functions providing a polynomial time algorithm with extremal competitive ratio 1.5 γ(f), where γ(f) is a lower bound on the extremal competitive ratio of any deterministic algorithm.Finally, we consider the case when f is the function min (minimum). In this case, we are able to determine the optimal competitiveness for the problem. In fact we provide an algorithm with an (n-2)-competitive ratio, which matches the known lower bound.
Characteristics of scientific web publications: preliminary data gathering and analysis
Authors: Erik Thorlund Jepsen, Piet Seiden, Peter Ingwersen, Lennart Björneborn, Pia Borlund
Venue: Journal of the American Society for Information Science and Technology (2004)

Because of the increasing presence of scientific publications on the Web, combined with the existing difficulties in easily verifying and retrieving these publications, research on techniques and methods for retrieval of scientific Web publications is called for. In this article, we report on the initial steps taken toward the construction of a test collection of scientific Web publications within the subject domain of plant biology. The steps reported are those of data gathering and data analysis aiming at identifying characteristics of scientific Web publications. The data used in this article were generated based on specifically selected domain topics that are searched for in three publicly accessible search engines (Google, AllTheWeb, and AltaVista). A sample of the retrieved hits was analyzed with regard to how various publication attributes correlated with the scientific quality of the content and whether this information could be employed to harvest, filter, and rank Web publications. The attributes analyzed were inlinks, outlinks, bibliographic references, file format, language, search engine overlap, structural position (according to site structure), and the occurrence of various types of metadata. As could be expected, the ranked output differs between the three search engines. Apparently, this is caused by differences in ranking algorithms rather than the databases themselves. In fact, because scientific Web content in this subject domain receives few inlinks, both AltaVista and AllTheWeb retrieved a higher degree of accessible scientific content than Google. Because of the search engine cutoffs of accessible URLs, the feasibility of using search engine output for Web content analysis is also discussed.
Book review: The First Book of PC-Write by Rebecca Kenyon (Howard W. Sams & Co., 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

The First Book of PC-Write, covers the full range of PC-Write topics, from installation, to formatting paragraphs and pages, to checking spelling, to merging documents, and much more. The book provides explanations of the essential features of this word processor. It includes an appendix of questions, with explanations, that are asked when first installing the program.
Path partition for graphs with special blocks
Authors: Jun-Jie Pan, Gerard J. Chang
Venue: Discrete Applied Mathematics (2005)

The path-partition problem is to find a minimum number of vertex-disjoint paths that cover all vertices of a given graph. This paper studies the path-partition problem from an algorithmic point of view. As the Hamiltonian path problem is NP-complete for many classes of graphs, so is the path-partition problem. The main result of this paper is to present a linear-time algorithm for the path-partition problem in graphs whose blocks are complete graphs, cycles or complete bipartite graphs.
FPGA implementation of a modular and pipelined WF scheduler for high speed OC192 networks
Authors: Abdallah Merhebi, Otmane Ait Mohamed
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algorithm able to handle variable length packets targeted for Packet Over Sonet (POS) interfaces and ideal for the design of hybrid IP/ATM switches. Our contributions is an extension to an existing 4 channel scheduler architecture that combines the Highest Value First scheme and Round Robin scheme, to a modular multi channel scheduler design. The improvement we offer here compared to the previuous implementation is that we have used the existing 4 channel core module to build a higher order WF queuing system without decreasing its overall performance . As a result, our scheduler is general enough to accommodate ATM (UTOPIA Level3/4) , POS Phy Level3 (or PL3 for OC48) as well as POS Phy Level4 (or PL4 for OC192) interfaces.
Evaluation of Rate-Based Adaptivity in Asynchronous Data Stream Joins
Authors: Beth Plale, Nithya Vijayakumar
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Continuous query systems are an intuitive way for users to access streaming data in large-scale scientific applications containing many hundreds of streams. A challenge in these systems is to join streams in such a way that memory is conserved. Storing events that could not possibly participate in a join any longer wastes memory and limits scalability of the query processing system. This paper reports an experimentwe conducted to validate an algorithm we developed for adaptive rate, adjustable join windows. We posit that a rate-based strategy can result in memory savings, can be sufficiently responsive to rapid changes in stream rates, and can execute with suitably low overhead. Based on the results, we conclude that the algorithm adds between 0.007% and 2.6% overhead, with significant gains in memory utilization possible depending on the particular workload.
On-Demand Routing for Bluetooth Scatternets Subject to Device Mobility
Authors: Chorng-Horng Yang, Jian-Wei Ruan
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Bluetooth scatternet is a platform for realizing wireless personal area networks (WPANs), in which the portable Bluetooth devices may move in the range of a scatternet. This paper presents an on-demand routing protocol for the Bluetooth scatternet with mobile Bluetooth devices. We first discuss the approach of scatternet backbone formation. With the scatternet backbone, the static on-demand routing can be done easily. Furthermore, we propose an on-demand routing protocol, which can detect device movement and establish routes in a mobile scatternet. Moreover, we conduct simulation study to evaluate the performance of the proposed routing protocol.
Development of Security Scanner with High Portability and Usability
Authors: Michitaka Yoshimoto, Bhed Bahadur Bista, Toyoo Takata
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we propose and develop a security scanner with high portability and usability. Recently, illegal access has been increasing explosively. Not only experts but also beginners need to cope up with vulnerability of a system promptly and properly. In such cases, a security scanner is an efficient tool to point out the vulnerability. However, for general users, most of the presently available security scanners are hard to install and operate because they have considerably poor usability. We have developed a security scanner with high usability, called USAGI. USAGI is a Web based security scanner, therefore it should not depend on operating systems, and should not need any installation. However, web based scanners cannot inspect a host which cannot issue a scan request such as internet appliance. Moreover, a web based scanner is not effective for a host inside firewall, if one would like to check vulnerability against insider threat. To overcome these problems, we design a portable version of USAGI, while keeping high usability. We adopted Perl and Macromedia Flash for development of the security scanner to realize portability. Since all the scanning processes are performed only by a few mouse clicks, our security scanner can be implemented on a small handheld computer without keyboard. In functionality, we have realized high extensionality and reliability by using the external script of Nessus.
Information security education in the UK: a proposed course in secure e-commerce systems
Authors: Siraj A. Shaikh
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

The paper discusses briefly the available academic programs in the subject area of Information Security in the United Kingdom (UK). We then present our experience of designing a module the purpose of which is to train students in the concepts of Information Security. We discuss the rationale behind our choice of teaching methods and the structure of the module in detail.
Answering what-is questions by Virtual Annotation
Authors: John Prager, Dragomir Radev, Krzysztof Czuba
Venue: Proceedings of the first international conference on Human language technology research (2001)

We present the technique of Virtual Annotation as a specialization of Predictive Annotation for answering definitional What is questions. These questions generally have the property that the type of the answer is not given away by the question, which poses problems for a system which has to select answer strings from suggested passages. Virtual Annotation uses a combination of knowledge-based techniques using an ontology, and statistical techniques using a large corpus to achieve high precision.
On the Small Sample Performance of Boosted Classifiers
Authors: Weiliang Li, Xiang Gao, Ying Zhu, Visvanathan Ramesh, Terrance E. Boult
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Boosting algorithms have been widely applied in the machine vision systems. Two fundamental issues that have to be solved in these systems are how much training data and how many Boosting rounds are needed to achieve a desired performance. We view the Boosting algorithm as a nonlinear estimation scheme that estimates a strong classifier from a given training sample set (that is generated by sampling a true unknown distribution), the weak classifiers, and the number of Boosting rounds T . The performance characterization of this estimator involves the derivation of the classification error statistics of the trained strong classifier as a function of the training set and the collection of the weak classifiers. Although the convergence and the error bounds for the training error and generalization error of the algorithms have been studied for several years, the estimated bounds are still loose bounds that are only meaningful for large training sets. With no effective tools for determining the error bounds, users are now collecting training samples with as much data as they can afford, with no good way to know if they are sufficient. In this paper, we characterize the classification error statistics of the trained strong classifier as a function of the true distributions of classes, the collection of the weak classifiers, and the size of the training set. We show that the statistics can be numerically computed and the results are more accurate than previous bounds in the literature. Theoretical results are verified through the simulations. Face detection is used as a case study to illustrate the application of the theory on real data.
On state equations of two-level quantum systems in a thermal environment: Research Articles
Authors: Pier Paolo Civalleri, Marco Gilli
Venue: International Journal of Circuit Theory and Applications (2004)

The state equations of open two-level quantum systems, which form the building blocks of quantum cellular neural networks, are studied in arbitrary representations. It is shown that the dissipation matrix, that under the usual assumptions is diagonal in the energy representation, such remains if and only if the coupling between the states induced by an external field is real and infinitesimal. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Solution of the Falkner-Skan equation by recursive evaluation of Taylor coefficients
Authors: Asai Asaithambi
Venue: Journal of Computational and Applied Mathematics (2005)

We present a computational method for the solution of the third-order boundary value problem characterized by the well-known Falkner-Skan equation on a semi-infinite domain. Numerical treatments of this problem reported in the literature thus far are based on shooting and finite differences. While maintaining the simplicity of the shooting approach, the method presented in this paper uses a technique known as automatic differentiation, which is neither numerical nor symbolic. Using automatic differentiation, a Taylor series solution is constructed for the initial value problems by calculating the Taylor coefficients recursively. The effectiveness of the method is illustrated by applying it successfully to various instances of the Falkner-Skan equation.
Multi-Modal Information Retrieval with a Semantic View Mechanism
Authors: Qing Li, Jun Yang, Yueting Zhuang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The explosive growth of multimedia information on the Web in recent years calls for an elegant means to model and manage multimedia content to facilitate semantic-level access and sharing across diversified applications. From the perspective of retrieval, the semantics of multimedia data features context-dependency and media-independency; both are inadequately supported by the state-of-the-art data modeling technology. In this paper, we address this problem by advocating MediaView as an extended object-oriented view mechanism to bridge the "semantic gap" between conventional databases and semantics-intensive multimedia applications. This mechanism captures the dynamic semantics of multimedia using a modeling construct named media view (MV), which formulates a customized context where heterogeneous media objects with similar/related semantics are characterized by additional properties and user-defined semantic relationships. View operators are proposed for the manipulation and derivation of individual MVs which can be fit into the desired real-life scenarios automatically. The usefulness and elegancy of MediaView are demonstrated by its applications in various (subjective) activities supporting multi-modal retrieval.
ERP plans and decision-support benefits
Authors: Clyde W. Holsapple, Mark P. Sena
Venue: Decision Support Systems (2005)

Management and implementation of Enterprise Resource Planning (ERP) systems have tended to concentrate on their transactional and record-keeping aspects, rather than on their decision-support capabilities. This paper explores connections between ERP systems and decision support based on the perceptions of 53 ERP system adopters. It offers new insights into the important objectives that are (and should be) considered in ERP plans, including decision-support objectives. It provides insights into the decision-support benefits of ERP systems. The study also examines relationships between the importance of various objectives in ERP planning and the subsequent realization of decision-support benefits from an ERP system.
Optimizing Array-Intensive Applications for On-Chip Multiprocessors
Authors: Ismail Kadayif, Mahmut Kandemir, Guilin Chen, Ozcan Ozturk, Mustafa Karakoy Ugur Sezer
Venue: IEEE Transactions on Parallel and Distributed Systems (2005)

With energy consumption becoming one of the first-class optimization parameters in computer system design, compilation techniques that consider performance and energy simultaneously are expected to play a central role. In particular, compiling a given application code under performance and energy constraints is becoming an important problem. In this paper, we focus on an on-chip multiprocessor architecture and present a set of code optimization strategies. We first evaluate an adaptive loop parallelization strategy (i.e., a strategy that allows each loop nest to execute using a different number of processors if doing so is beneficial) and measure the potential energy savings when unused processors during execution of a nested loop are shut down (i.e., placed into a power-down or sleep state). Our results show that shutting down unused processors can lead to as much as 67 percent energy savings at the expense of up to 17 percent performance loss in a set of array-intensive applications. To eliminate this performance penalty, we also discuss and evaluate a processor preactivation strategy based on compile-time analysis of nested loops. Based on our experiments, we conclude that an adaptive loop parallelization strategy combined with idle processor shut down and preactivation can be very effective in reducing energy consumption without increasing execution time. We then generalize our strategy and present an application parallelization strategy based on integer linear programming (ILP). Given an array-intensive application, our optimization strategy determines the number of processors to be used in executing each loop nest based on the objective function and additional compilation constraints provided by the user/programmer. Our initial experience with this constraint-based optimization strategy shows that it is very successful in optimizing array-intensive applications on on-chip multiprocessors under multiple energy and performance constraints.