ppxscal/embedding_network huggingface dataset:
Denial of service attack and prevention on SIP VoIP infrastructures using DNS flooding
Authors: Ge Zhang, Sven Ehlert, Thomas Magedanz, Dorgham Sisalem
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

A simple yet effective Denial of Service (DoS) attack on SIP servers is to flood the server with requests addressed at irresolvable domain names. In this paper we evaluate different possibilities to mitigate these effects and show that over-provisioning is not sufficient to handle such attacks. As a more effective approach we present a solution called the DNS Attack Detection and Prevention (DADP) scheme based on the usage of a non-blocking DNS cache. Based on various measurement conducted over the Internet we investigate the efficiency of the DADP scheme and compare its performance with different caching strategies applied.
Efficient Parallel Evaluation of Boolean Expressions
Authors: F. P. Preparata
Venue: IEEE Transactions on Computers (1976)

A Boolean expression wilth n literals, i.e., n distinct appearances of variables, can be evaluated by a parallel processing system in at most 1.81 log2n steps, or, equivalently, by a network constructed with two-input AND and OR gates and having at most 1.81 log2n levels.
Representations of a Z/3Z-quantum group
Authors: Hiroyuki Yamane
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

In this paper, we give a classification of the finite dimensional irreducible representations of a nonstandard quantum group U, which may be viewed as a Z/3Z-graded version of a quantum superalgebra.
The Wavelet-based Contourlet Transform for Image Fusion
Authors: Lei Tang, Zong-gui Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The wavelet-based contourlet transform (WBCT) is a new directional transform. This transform uses the wavelet transform and the directional filter bank (DFB) to obtain a multiscale and multidirection decomposition of image. The wavelet transform and the DFB are non-redundant and perfect reconstruction. So the WBCT can be regarded as a non-redundant version of the contoulet transform. A new image fusion scheme based on the WBCT was presented. Firstly, the WBCT is used to perform a multiscale and multidirection decomposition of each image. Then the WBCT coefficients of fused image are constructed using multiple operators according to different fusion rules. The experimental results show that this new fusion scheme is effective and the fused images are better than that of using the Laplacian pyramid transform, the wavelet transform and the contourlet transform.
A Standard for Computer Networks
Authors: T. H. Bonn
Venue: Computer (1971)

The development of suitable standards is a vital key to developing ing the full potential of multi-access computer networks. To date work is being done on only a few of the standards that will be required, and among these few, progress is distressingly slow. Divergent procedures are rapidly becoming entrenched in areas where there should be standards and if the current rate of standards development is extrapolated, it is doubtful that the necessary standards can be developed in time.
Local Gabor Fisher Classifier for Face Recognition
Authors: Nong Sang, Jiawei Wu, Kun Yu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposes a novel Local Gabor Fisher Classifier (LGFC) for face recognition. Gabor feature vector has been recognized as one of the most successful face representations, however, its dimension is too high for fast extraction and accurate classification. In LGFC, Local Feature Analysis (LFA) is exploited to select the most informative Gabor features (hereinafter as local Gabor features) optimally. The selected low-dimensional local Gabor features are then classified by Fisher Linear Discriminant (FLD) for final face identification. We demonstrate that Gabor representation is much more robust than gray-level intensity to image variation caused by the imprecision of facial feature localization. Comparative studies of different similarity measures to local fisher classifier and local Gabor fisher classifier are also performed. The experiments on two traditional face databases, ORL and Aberdeen, have shown that compared with other face recognition schemes, the proposed method can effectively reduce the dimensionality of Gabor features and greatly increase the recognition accuracy.
Queueing Models of Computer Systems
Authors: A. O. Allen
Venue: Computer (1980)

Benchmarking is older. Simulation is more popular. But analytical queueing models may offer the most cost-effective technique for computer system performance modeling.
Querying complex structured databases
Authors: Cong Yu, H. V. Jagadish
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alternative query models have been proposed to give users the ability to query the database without schema knowledge. Those models, including simple keyword search and labeled keyword search, aim to extract meaningful data fragments that match the structure-free query conditions (e.g., keywords) based on various matching semantics. Typically, the matching semantics are content-based: they are defined on data node inter-relationships and incur significant query evaluation cost. Our first contribution is a novel matching semantics based on analyzing the database schema. We show that query models employing a schema-based matching semantics can reduce query evaluation cost significantly while maintaining or even improving result quality. The adoption of schema-based matching semantics does not change the nature of those query models: they are still schema-ignorant, i.e., users express no schema knowledge (except the labels in labeled keyword search) in the query. While those models work well for some queries on some databases, they often encounter problems when applied to complex queries on databases with complex schemas. Our second contribution is a novel query model that incorporates partial schema knowledge through the use of schema summary. This new summary-aware query model, called Meaningful Summary Query (MSQ), seamlessly integrates summary-based structural conditions and structure-free conditions, and enables ordinary users to query complex databases. We design algorithms for evaluating MSQ queries, and demonstrate that MSQ queries can produce better results against complex databases when compared with previous approaches, and that they can be efficiently evaluated.
Collective creativity: toward a new paradigm for creative culture
Authors: Masa Inakage
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Our society is experiencing a paradigm shift that we value from mass produced products to personal and customized product. The shift is also observed with mass media that increases number of channels to reflect wide variety of personal interests. End-users are also starting to be connected by the network, forming online communities to share personal interests. Furthermore, end-users are beginning to create and share content from snap shots of ideas found in daily life. Current popular online services such as You Tube, Flickr, and SNS rely on end-user contribution and collaboration. Through this shift, an emerging topic in the design disciplines called collective creativity has surfaced. [3] Collective creativity is an approach of creative activity that emerges from the collaboration and contribution of many individuals so that new forms of innovative and expressive art forms are produced collectively by individuals connected by the network. Many related researches on collective creativity focus on the importance of collaboration in the work environment to solve complex and interdisciplinary problems. [1, 2] We adopt the concept of collective creativity to solicit emerging genre of content that continuously grow as more individuals contribute to the activitiy. An example of content that reflects the concept of collective creativity is a pervasive game "Ototonari". It collectively creates music by walking around the field and interacting with multiple users in the field. [4] "Ototonari" creates a sound based on the position, proximity and density of the user in the field using mobile ad hoc network. The field is divided into sub area, and each sub area has unique sound. By picking up the sound in different area, each user can build one's own music. Once the music is created, the music can be saved to remain in the sub area. Other users can visit the sub area to pick up the music that was saved. Through physical location, sound clips can be shared and thus collectively create music. "Mopie" is another example of content that shows the strength of collective creativity. In "Mopie", people walk around the city with video-enabled cell phones with GPS unit. The cell phone captures both the video clip of the street scenery and the location data, and these data are sent and archived in the database. Each video clip can be mapped onto the street map. People can have a virtual city walking experience by tracing the street map with a finger or a mouse. The video clip of the selected street is searched from the database and played. If multiple video clips are needed to continue walking, the system automatically loads appropriate clips and seamlessly plays the clip. The video clips archived in the database are contributions by many individuals, at different time and season. Collectively, the "Mopie" city walking experience becomes rich and memorable.
Improving Branch Prediction and Predicated Execution in Out-of-Order Processors
Authors: Eduardo Quinones, Joan-Manuel Parcerisa, Antonio Gonzailez
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Although it is globally beneficial, it has a negative side-effect because the removal of branches eliminates useful correlation information necessary for conventional branch predictors. The remaining branches may become harder to predict. However; in predicated ISAs with a compare-branch model, the correlation information not only resides in branches, but also in compare instructions that compute their guarding predicates. When a branch is removed, its correlation information is still available in its compare instruction. We propose a branch prediction scheme based on predicate prediction. It has three advantages: First, since the prediction is not done on a branch basis but on a predicate define basis, branch removal after if-conversion does not lose any correlation information, so accuracy is not degraded. Second, the mechanism we propose permits using the computed value of the branch predicate when available, instead of the predicted value, thus effectively achieving 100% accuracy on such early-resolved branches. Third, as shown in previous work, the selective predicate prediction is a very effective technique to implement if-conversion on out-of-order processors, since it avoids the problem of multiple register definitions and reduces the unnecessary resource consumption of nullified instructions. Hence, our approach enables a very efficient implementation of if-conversion for an out-of-order processor; with almost no additional hardware cost, because the same hardware is used to predict the predicates of if-converted code and to predict branches without accuracy degradation.
A Controlled Experiment Quantitatively Comparing Software Development Approaches
Authors: V. R. Basili
Venue: IEEE Transactions on Software Engineering (1981)

A software engineering research study has been undertaken to empirically analyze and compare various software development approaches; its fundamental features and initial findings are presented in this paper. An experiment was designed and conducted to confirm certain suppositions concerning the beneficial effects of a particular disciplined methodology for software development. The disciplined methodology consisted of programming teams employing certain techniques and organizations commonly defined under the umbrella term structured programming. Other programming teams and individual programmers both served as control groups for comparison. The experimentally tested hypotheses involved a number of quantitative, objective, unobtrusive, and automatable measures of programming aspects dealing with the software development process and the developed software product. The experiment's results revealed several programming aspects for which statistically significant differences existed between the disciplined methodology and the control groups. The results were interpreted as confirmation of the original suppositions and evidence in favor of the disciplined methodology. This paper describes the specific features of the experiment; outlines the investigative approach used to plan, execute, and analyze it; reports its immediate results; and interprets them according to intuitions regarding the disciplined methodology.
Table of Contents
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The following topics are dealt with: high performance distributed computing; grid services; application environments; runtime; data management; resource management; scheduling; security policy; middleware; and system services. 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
Parameterized model order reduction via a two-directional Arnoldi process
Authors: Yung-Ta Li, Zhaojun Bai, Yangfeng Su, Xuan Zeng
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper presents a multiparameter moment-matching based model order reduction technique for parameterized interconnect networks via a novel two-directional Arnoldi process. It is referred to as a PIMTAP algorithm, which stands for Parameterized Interconnect Macromodeling algorithm via a Two-directional Arnoldi Process. PIMTAP inherits the advantages of previous multiparameter moment-matching algorithms and avoids their shortfalls. It is numerically stable and adaptive, and preserves the passivity of parameterized RLC networks.
Advanced call scheduling for testing a telecommunications network
Authors: C. Voudouris, N. Azarmi, A. Jones
Venue: BT Technology Journal (2007)

This paper describes an advanced scheduling system and method for generating large volumes of calls to be used for testing a telecommunications network. The system is capable of preparing large-scale and complex network tests by viewing the task as a scheduling problem. The various requirements of the scheduling problem are analysed and represented as constraints or optimisation criteria. A fast heuristic method is proposed for solving the problem. The approach is based on a greedy algorithm for constructing solutions and it incorporates limited backtracking and dynamic value-ordering heuristics. The algorithm and system are currently being used for call charge verification in BT's PSTN and CSP networks.
On the Convergence of Chord Network
Authors: NIE Xiao-wen, LU Xian-liang, DUAN Han-cong, LI Lin, PU Xun
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Due to the churn, the P2P overlay network can not be static. The dynamic environment may degrade the services provided by Distributed Hash Table (DHT), then the convergence of the overlay is very important. In this paper, we try to analyze the convergence of Chord network. We prove that the generic structures of Chord network is a pseudo-tree, which can be converged to a circle by algorithm stabilize. The ring in Chord has more meanings than a circle in Graph theory, and the ring requires all nodes in the network permuted by their ids. An efficient strong_stabilize algorithm is proposed to make the network converge to a ring rapidly.
Manipulating Shape and Producing Geometuic Contnuity in β-Spline Curves
Authors: T. N. T. Goodman, K. Unsworth
Venue: IEEE Computer Graphics and Applications (1986)

This article examines some of the desirable features of β-splines that make them particularly suitable for computer-aided design. First, a theoretical analysis is presented regarding the effects upon the shape of a design curve when the bias and tension parameters are allowed to vary in certain ways. Second, the concept of geometric continuity is discussed, and conditions are derived upon the control vertices to ensure that the design curve has second-order geometric continuity. Illustrations of ,β-spline curves are presented to support the theoretical conclusions.
Joint AGC-equalization algorithm and VLSI architecture for wirelined transceiver designs
Authors: Jyh-Ting Lai, An-Yeu Wu, Chien-Hsiung Lee
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Traditional approaches of automatic gain control (AGC) involve estimating the average power or the peak amplitude over an extended time period, which results in high hardware complexity and a long processing time. Moreover, the accuracy of traditional approaches is seriously degraded by noise and intersymbol interference. In this paper, we propose a joint AGC and equalization (Joint AGC-EQ) scheme, in which the AGC circuitry comprises only one-tenth of the area of a traditional AGC. In addition, the total convergence time of the proposed Joint AGC-EQ is only half that of traditional blind equalization. The scheme is already silicon proven for the application of a Fast Ethernet transceiver using Faraday/UMC 0.18-µm cell libraries.
The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network
Authors: S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Kelli Carlson, Gerhard Kramer
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

A finite set of inequalities is given that characterizes the routing rate region for an undirected ring network in which the source and destination vertices of each communication session form a string of adjacent vertices. The result uses an extension of the Japanese theorem for communication problems with multiple multicast sessions and an interpretation of the extension in terms of the collection of minimum length routing trees for the various multicast sessions. It is further demonstrated that routing is rate optimal in this case using new extensions to progressive d-separating edge set bounds.
On asymptotics of polynomial eigenfunctions for exactly solvable differential operators
Authors: Tanja Bergkvist
Venue: Journal of Approximation Theory (2007)

In this paper we study the class of differential operators T=@?"j"="1^kQ"jD^j with polynomial coefficients Q"j in one complex variable satisfying the condition degQ"j=~, as opposed to the case when degQ"k=k, which we have treated previously in [T. Bergkvist, H. RullgArd, On polynomial eigenfunctions for a class of differential operators, Math. Res. Lett. 9 (2002) 153-171]. Moreover, we present an explicit conjecture and partial results on the growth of the largest modulus of the roots of p"n. Based on this conjecture we deduce the algebraic equation satisfied by the Cauchy transform of the asymptotic root measure of the appropriately scaled eigenpolynomials, for which the union of all roots is conjecturally contained in a compact set.
Design and Development Tools for Next Generation Mobile Services
Authors: G. Bartolomeo, E. Casalicchio, S. Salsano, N. Blefari Melazzi
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The actual standards for service authoring, composition and development are not easy to port and to apply for next generation mobile applications. This paper describes some tools that we're developing in the context of the IST-Simple Mobile Service project, whose aim is to ease the authoring and the use of services for mobile devices. We propose a service composition approach using an UML profile very close to the actual standards for Web Services definition and authoring, like WSDL and BPEL. We take a glance at SMILE, the run-time support we provide for service execution. Finally we hint at an efficient serialization mechanism based on JSON, a human readable data exchange format less verbose and, in our opinion, more suitable for mobile terminals than XML.
QUIET: continuous query-driven index tuning
Authors: Kai-Uwe Sattler, Ingolf Geist, Eike Schallehn
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Index tuning as part of database tuning is the task of selecting and creating indexes with the goal of reducing query processing times. However, in dynamic environments with various ad-hoc queries it is difficult to identify potential useful indexes in advance. In this demonstration, we present our tool QUIET addressing this problem. This tool "intercepts" queries and - based on a cost model as well as runtime statistics about profits of index configurations - decides about index creation automatically at runtime. In this way, index tuning is driven by queries without explicit actions of the database users.
Security Analysis for Internet Banking Models
Authors: Osama Dandash, Phu Dung Le, Bala Srinivasan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Internet banking fraud can be performed internally by genuine staff or externally by customers or suppliers. This paper presents a security analysis of the proposed Internet banking model compared with that of the current existing models used in fraudulent Internet payments detection and prevention. Several modern models in preventing and detecting fraud are evolving and being applied to many banking systems. However, they have no effective detection mechanism to identify legitimate users and trace their unlawful activities. Also they are not secure enough to prevent fraudulent users from performing fraudulent transactions over the Internet. The proposed model facilitates Internet banking Fraud Detection and Prevention (FDP) by applying two new secure mechanisms, Dynamic Key Generation (DKG) and Group Key (GK).
Fast detection and removal of impulsive noise using peer groups and fuzzy metrics
Authors: Joan-Gerard Camarena, Valentín Gregori, Samuel Morillas, Almanzor Sapena
Venue: Journal of Visual Communication and Image Representation (2008)

A novel approach to impulsive noise detection in color images is introduced. In the paper, the peer group concept is redefined by means of a certain fuzzy metric. This concept is employed for the fast detection of noisy pixels by taking advantage of the fuzzy metric properties. On the basis of the noisy pixel detection a switching filter between the arithmetic mean filter (AMF) and the identity operation is proposed. The proposed switching filter achieves a trade-off between noise suppression and signal-detail preservation and is faster than recently introduced switching filters based on the peer group concept.