ppxscal/embedding_network huggingface dataset:
Analysis on Routing Convergence in Optical Network
Authors: Ning ZHANG, Hong BAO, Aibo LIU
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Today wavelength division multiplexing (WDM) technology, optical amplifiers, and simple optical switching elements like optical add-drop multiplexers (OADMs) are used in the backbone networks of all operators worldwide. The optical network has its own distinct routing features, topology aggregation and abstraction used in inter-domain routing make the view of network topology different to each routing layer, all these factors demand a creative way to converge and synchronize the hierarchical network.. This paper tries to bring forward a kind of parallel topology convergence mechanism depending on the exchange of topology abstracts information, which is suitable for inter-domain routing in multiple layers and domains ASON network. Optical systems nowadays provide the basis for cost-effective transmission of large amounts of bandwidth over the Internet, and will enable its future growth and the spreading of new applications and services.
Brief paper: Motion planning in uncertain environments with vision-like sensors
Authors: Suman Chakravorty, John L. Junkins
Venue: Automatica (Journal of IFAC) (2007)

In this work we present a methodology for intelligent path planning in an uncertain environment using vision-like sensors, i.e., sensors that allow the sensing of the environment non-locally. Examples would include a mobile robot exploring an unknown terrain or a micro-UAV navigating in a cluttered urban environment. We show that the problem of path planning in an uncertain environment, under certain assumptions, can be posed as the adaptive optimal control of an uncertain Markov decision process, characterized by a known, control-dependent system, and an unknown, control-independent environment. The strategy for path planning then reduces to computing the control policy based on the current estimate of the environment, also known as the ''certainty-equivalence'' principle in the adaptive control literature. Our methodology allows the inclusion of vision-like sensors into the problem formulation, which, as empirical evidence suggests, accelerates the convergence of the planning algorithms. Further we show that the path planning and estimation problems, as formulated in this paper, possess special structure which can be exploited to significantly reduce the computational burden of the associated algorithms. We apply this methodology to the problem of path planning of a mobile rover in a completely unknown terrain.
Special Feature A Keynote Address on Concurrent Programming
Authors: P. B. Hansen
Venue: Computer (1979)

Delivered at COMPSAC 78, this address draws a parallel between the major development phases of the first 20 years of concurrent programming and the present challenge of distributed computing.
Privacy preserving error resilient dna searching through oblivious automata
Authors: Juan Ramón Troncoso-Pastoriza, Stefan Katzenbeisser, Mehmet Celik
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and personalized nature of this information highlights the need for privacy-preserving protocols. In this paper, we present a new error-resilient privacy-preserving string searching protocol that is suitable for running private DNA queries. This protocol checks if a short template (e.g., a string that describes a mutation leading to a disease), known to one party, is present inside a DNA sequence owned by another party, accounting for possible errors and without disclosing to each party the other party's input. Each query is formulated as a regular expression over a finite alphabet and implemented as an automaton. As the main technical contribution, we provide a protocol that allows to execute any finite state machine in an oblivious manner, requiring a communication complexity which is linear both in the number of states and the length of the input string.
An Architecture for Authorization in Grids using Shibboleth and VOMS
Authors: Ralf Groeper, Christian Grimm, Stefan Piger, Jan Wiebelitz
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Shibboleth-based federations emerge in numerous countries, especially in the academic sector. Leveraging these federations for authentication and authorization purposes in Grid computing is one aim of current research. In this paper an architecture for delivering attributes managed by both, Shibboleth IdPs and VOMS, to Grid resources for authentication and authorization purposes is presented. Special focus lies on linking web-based Shibboleth federations with the X.509 certificate-based grid security infrastructure by using a short lived certificate service as a trust-proxy between these worlds.
Efficient execution of multiple queries on deep memory hierarchy
Authors: Yan Zhang, Zhi-Feng Chen, Yuan-Yuan Zhou
Venue: Journal of Computer Science and Technology (2007)

This paper proposes a complementary novel idea, called MiniTasking to further reduce the number of cache misses by improving the data temporal locality for multiple concurrent queries. Our idea is based on the observation that, in many workloads such as decision support systems (DSS), there is usually significant amount of data sharing among different concurrent queries. MiniTasking exploits such data sharing to improve data temporal locality by scheduling query execution at three levels: query level batching, operator level grouping and mini-task level scheduling. The experimental results with various types of concurrent TPC-H query workloads show that, with the traditional N-ary Storage Model (NSM) layout MiniTasking significantly reduces the L2 cache misses by up to 83%, and thereby achieves 24% reduction in execution time. With the Partition Attributes Across (PAX) layout, MiniTasking further reduces the cache misses by 65% and the execution time by 9%. For the TPC-H throughput test workload, MiniTasking improves the end performance up to 20%.
Algorithm for selection of materialized views: based on a costs model
Authors: Maria Trinidad Serna-Encinas, Jose Antonio Hoyo-Montano
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

A data warehouse integrates businesses' information from both inner and outer data sources. The data set is use to assist the decision taking process, therefore, the multi-dimensional model design and the selection of materialized views represent a complex and thoughtful process. In this paper, a new algorithm for the selection of optimum set of materialized views is proposed. The proposed algorithm establishes this set based on the utilization rate, calculation cost and the relationship update rate. The development of this work was made within a medical research project, allowing the testing and validation of the proposed algorithm under a real-life application.
Web Page Scoring Based on Link Analysis ofWeb Page Sets
Authors: Hitoshi Nakakubo, Shinsuke Nakajima, Kenji Hatano, Jun Miyazaki, Shunsuke Uemura
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We propose a new Web page scoring method based on the link analysis among sets of Web pages. Conventional link analyses such as PageRank and HITS calculate importance degree of each Web page; however, the authors of Web pages often create multiple pages to describe a specific topic. The importance degrees of such multiple Web pages cannot be derived by the conventional link analyses accurately. To cope with this problem, we need to treat the Web pages with the same contents edited by the same author as a Web page set (WPS). After constructing the link structure among WPSs, we calculate their importance degrees by using conventional link analysis schemes. In this paper, we compared our approach with the conventional method by using the NTCIR test collection, and found that our approach was better than the conventional method in terms of both WRR and DCG evaluation measures.
Trends in the Design and Implementation of Programming Languages
Authors: W. A. Wulf
Venue: Computer (1980)

By the end of the decade, advances in areas such as structured programming, specification, verification, and language design will have transformed programming into a true engineering discipline.
Data sanitization: improving the forensic utility of anomaly detection systems
Authors: Gabriela F. Cretu, Angelos Stavrou, Salvatore J. Stolfo, Angelos D. Keromytis
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Anomaly Detection (AD) sensors have become an invaluable tool for forensic analysis and intrusion detection. Unfortunately, the detection accuracy of all learning-based ADs depends heavily on the quality of the training data, which is often poor, severely degrading their reliability as a protection and forensic analysis tool. In this paper, we propose extending the training phase of an AD to include a sanitization phase that aims to improve the quality of unlabeled training data by making them as "attack-free" and "regular" as possible in the absence of absolute ground truth. Our proposed scheme is agnostic to the underlying AD, boosting its performance based solely on training-data sanitization. Our approach is to generate multiple AD models for content-based AD sensors trained on small slices of the training data. These AD "micro-models" are used to test the training data, producing alerts for each training input. We employ voting techniques to determine which of these training items are likely attacks. Our preliminary results show that sanitization increases 0-day attack detection while maintaining a low false positive rate, increasing confidence to the AD alerts. We perform an initial characterization of the performance of our system when we deploy sanitized versus unsanitized AD systems in combination with expensive host-based attack-detection systems. Finally, we provide some preliminary evidence that our system incurs only an initial modest cost, which can be amortized over time during online operation.
On the computation of the Circle Hough Transform by a GPU rasterizer
Authors: Manuel Ujaldón, Antonio Ruiz, Nicolás Guil
Venue: Pattern Recognition Letters (2008)

This paper presents an alternative for a fast computation of the Hough transform by taking advantage of commodity graphics processors that provide a unique combination of low cost and high performance platforms for this sort of algorithms. Optimizations focus on the features of a GPU rasterizer to evaluate, in hardware, the entire spectrum of votes for circle candidates from a small number of key points or seeds computed by the GPU vertex processor in a typical CPU manner. Number of votes and fidelity of their values are analyzed within the GPU using mathematical models as a function of the radius size for the circles to be detected and the resolution for the texture storing the results. Empirical results validate the output obtained for a much faster execution of the Circle Hough Transform (CHT): On a 1024x1024 sample image containing 20 circles of r=50 pixels, the GPU accelerates the code an order of magnitude and its rasterizer contributes with an additional 4x factor for a total speed-up greater than 40x versus a baseline CPU implementation.
Special Feature Innovation at Texas Instruments
Authors: M. ,  Jr. Shepherd
Venue: Computer (1979)

Perhaps the computer industry's most valuable resource is the creativity of its people. Yet what happens to most innovative ideas? How is creativity managed? How is innovation encouraged?
Analytic Queueing Models for Programs with Internal Concurrency
Authors: P. Heidelberger
Venue: IEEE Transactions on Computers (1983)

Analytic queueing models of programs with internal concurrency are considered. The program behavior model allows a process to spawn two or more concurrent tasks at some point during its execution. Except for queueing effects, the tasks execute independently of one another, and at the end of their execution, either wait for all of their siblings to finish execution or merge with the parent if all have finished execution. Two approximate solution methods for the performance prediction of such systems are developed, and results of the approximations are compared to those of simulations. The approximations are both computationally efficient and highly accurate. The gain in performance due to multitasking and multiprocessing is studied with a series of examples.
Using Emulaion to Verify Formal Architecture Descriptions
Authors: M. R. Barbacci
Venue: Computer (1978)

Does the reference manual actually describe the real computer? Not entirely, but the authors, starting with a simulation based on the written word, worked out the remaining errors using the machine diagnostics as the last word.
The future of radio frequency identification
Authors: Dennis Viehland, Aaron Wong
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

This study identifies the most important and unsolved issues that will determine the future of radio frequency identification (RFID). A review of the RFID business-oriented literature identified twelve issues related to the future of RFID. In the first round of the Delphi Method, a panel of RFID experts narrowed this list to the seven issues considered to be most critical to the future of RFID. In round two, the panel ranked the seven issues in terms of importance and likelihood of being solved within the next two years. A third round, with feedback from round two, was conducted to insure there was a consensus within the panel. Results indicate that standardization is the most important issue and standardization is also the issue most likely to be solved within the next two years. System costs, business process reengineering, and integration also ranked high in importance. Privacy, lack of RFID-skilled professionals, and data warehousing were viewed as of less importance to the future of RFID.
Video Shots Comparison using the Mallows Distance
Authors: Constantino Grana, Daniele Borghesani, Rita Cucchiara
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this work, we focus on two aspects of the comparison of video shots. We present a new approach to extract a variable number of key frames from a shot, by the use of a hierarchical clustering with automatic level selection, in order to provide optimal allocation of features on different parts of the shot. We then employ the Mallows distance as an effective technique to compare the discrete distributions of features, independently from the features selected for the specific application. Results and comparisons on a soccer documentary video are provided.
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Authors: Andreas Brandstädt, Chính T. Hoàng
Venue: Theoretical Computer Science (2007)

Clique separators in graphs are a helpful tool used by Tarjan as a divide-and-conquer approach for solving various graph problems such as the Maximum Weight Stable Set (MWS) Problem, Maximum Clique, Graph Coloring and Minimum Fill-in, but few examples of graph classes having clique separators are known. We use this method to solve MWS in polynomial time for two classes where the unweighted Maximum Stable Set (MS) Problem is solvable in polynomial time by augmenting techniques but the complexity of the MWS problem was open. Another example, namely a result by Alekseev for the MWS problem on a subclass of P"5-free graphs obtained by clique separators, can be improved by our techniques. We also combine clique separators with decomposition by homogeneous sets in graphs and use the following notion: A graph is nearly@P if for each of its vertices, the subgraph induced by the set of its nonneighbors has property @P. We deal with the cases @P@?{chordal,perfect}. This also simplifies a result obtained by a method called struction.
A simpler analysis of Burrows–Wheeler-based compression
Authors: Haim Kaplan, Shir Landau, Elad Verbin
Venue: Theoretical Computer Science (2007)

In this paper, we present a new technique for worst-case analysis of compression algorithms which are based on the Burrows-Wheeler Transform. We mainly deal with the algorithm proposed by Burrows and Wheeler in their first paper on the subject [M. Burrows, D.J. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994], called bw0. This algorithm consists of the following three essential steps: (1) Obtain the Burrows-Wheeler Transform of the text, (2) Convert the transform into a sequence of integers using the move-to-front algorithm, (3) Encode the integers using Arithmetic code or any order-0 encoding (possibly with run-length encoding). We achieve a strong upper bound on the worst-case compression ratio of this algorithm. This bound is significantly better than bounds known to date and is obtained via simple analytical techniques. Specifically, we show that for any input string s, and @m>1, the length of the compressed string is bounded by @m@?|s|H"k(s)+log(@z(@m))@?|s|+@mg"k+O(logn) where H"k is the kth order empirical entropy, g"k is a constant depending only on k and on the size of the alphabet, and @z(@m)=11^@m+12^@m+... is the standard zeta function. As part of the analysis, we prove a result on the compressibility of integer sequences, which is of independent interest. Finally, we apply our techniques to prove a worst-case bound on the compression ratio of a compression algorithm based on the Burrows-Wheeler Transform followed by distance coding, for which worst-case guarantees have never been given. We prove that the length of the compressed string is bounded by 1.7286@?|s|H"k(s)+g"k+O(logn). This bound is better than the bound we give for bw0.
VHDL's Impact on Test
Authors: Al Lowenstein, Greg Winter
Venue: IEEE Design Test (1986)

High-tech microcircuits command a modernized approach to design and test. This approach, born of harsh economic reality, mandatesthat effective test be inextricably tied to design. The test generation problem is enormous and requires automatic test programgenerators that in turn require computer-readable descriptions of the unit under test. The government-sponsored VHSIC HardwareDescription Language, or VHDL, addresses both design and test needs, allowing both efforts to work together to reduce productcost while improving product quality. In this article, we focus on the needs of test throughout a product's life cycle andexplain how VHDL serves those needs.
The Fuzzy Direct Torque Control of Induction Motor Based on Space Vector Modulation
Authors: Xiying Ding, Qiang Liu, Xiaona Ma, Xiaoran He, Qing Hu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In the paper, voltage space vector modulation technology is used for fuzzy direct torque control of AC induction motor with fuzzy stator resistance estimator, which can weaken the ripple of torque and flux of fuzzy direct torque control system, therefore the control system get swifter response velocity, stronger robustness and higher precision of velocity control. The computer simulated results verify the validity of this novel method.
The Software Engineering Subject Area
Authors: D. Rine
Venue: Computer (1977)

Besides being a generalist skilled in interpersonal communication, problem-solving, computer science fundamentals, and management and economic techniques, a computer professional also needs basic training in digital logic, organization, architecture, operating systems, data structures, file and data base systems, programming languages and translator writing systems, programming systems and methodologies, and applications and theoretical considerations. This is a large order indeed, but it is the sort of graduate that our universities must turn out if they are to meet the needs of business and industry.
How useful are approximations to mean and variance of the index of dissimilarity?
Authors: Madhuri S. Mulekar, John C. Knutson, Jyoti A. Champanerkar
Venue: Computational Statistics Data Analysis (2008)

Sociologists, demographers, and economists often use the index of dissimilarity, D, to describe the extent of racial, ethnic, spatial, or areal dissimilarity (or segregation) of different socio-economic groups. Derivation of the mean and variance of D to develop inference techniques has been a subject of studies for over three decades. Some have attempted to develop approximations for the mean and variance in order to simplify calculations. However, due to difficulties in deriving the measure of variation and complex nature of approximations, D is almost always employed in practice for descriptive rather than inferential purposes. In this study, simulation technique is used to compare different approaches for approximating the mean and variance of D and standardizing of D values. The usefulness of approximation is discussed using residential segregation data classified by race and personal income data classified by gender and age group. The results show that the amount of bias in approximations negates the usefulness of these approximations in standardization process and possibly inference.
Microprocessors in CRT Terminal Applications: Hardware/Software Tradeoffs
Authors: M. T. Gray
Venue: Computer (1975)

In th development of any microprocessor-based system, the optimum design will be an efficient compromise between hardware and software. In most microprocessor applications, and particularly in CRT systems, there are usually several real-time functions to be performed with timne constraints that cannot be met with a purely software solution. When microprocessors were first introduced, many potential users investigated them for possible application in new products and concluded that the microprocessor was just not fast enough to do the job. Closer examination will show, however, that most investigators only considered purely software solutions to problems, thereby missing the correct assessment of microprocessor capabilities. 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
Research on Matching between User Queries and Web Pages Based on BAM
Authors: Bo Deng, Yajun Du
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

We put forward a new matching strategy with more elaborate and realistic concepts to improve on the past matching strategy based on keyword. In this paper, we set up a concept lattice for each web page according to the natural semantic concepts extracted from each web page. Such concept lattices are encoded by bidirectional associative memories as apposed to complex lattices building algorithms. Then we extract the formal concepts' objects and attributes those are relevant to queries' keywords to carry on matching manipulate.