ppxscal/embedding_network huggingface dataset:
A time series bootstrap procedure for interpolation intervals
Authors: Andrés M. Alonso, Ana E. Sipols
Venue: Computational Statistics Data Analysis (2008)

A sieve bootstrap procedure for constructing interpolation intervals for a general class of linear processes is proposed. This sieve bootstrap provides consistent estimators of the conditional distribution of the missing values, given the observed data. A Monte Carlo experiment is used to show the finite sample properties of the sieve bootstrap and finally, the performance of the proposed method is illustrated with a real data example.
A Vision-Based Road Surveillance System Using Improved Background Subtraction and Region Growing Approach
Authors: Jinglei Zhang, Zhengguang Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Monitoring traffic intersections in real time is an important part towards Intelligent Transportation System. A road surveillance system using background subtraction and threshold segmentation calculated traffic parameters. First an improved background establish and updating algorithm was applied to setup a robust background filtering illumination disturbance. Then a self-adaptive max variance threshold algorithm was adopted to determine the threshold. Third, a fast region growing algorithm was employed to border vehicles in some rectangles fixed their edges. Finally, algorithms were mentioned to calculate traffic parameters including traffic flux, average speed and duty ratio of road. The experimental results show that the system is adapted to monitor a multi-lane road near an urban intersection.
Approaches to Context-Based Knowledge Share and Reuse
Authors: Xiyong Zhu, Xuwei Pan, Shixiong Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Context is an important foundation for knowledge share and reuse. In this paper, we first introduce the concept and characteristics of the context, propose a context-based approach to knowledge share and reuse, then construct a multi-dimensional, hierarchical context modeling method. We next present a method for measuring the context similarity based on host context model tree. A component-based architecture of context- based knowledge share and reuse system is also given in the paper. By using this approach, we finally implement an adaptive knowledge delivery and matching system based on user's specific situations, which can greatly improve the efficiency of knowledge share and reuse.
An improved algorithm to accelerate regular expression evaluation
Authors: Michela Becchi, Patrick Crowley
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. While deterministic finite automata (DFAs) allow this operation to be performed in linear time, they may exhibit prohibitive memory requirements. In [9], Kumar et al. propose Delayed Input DFAs (D2FAs), which provide a trade-off between the memory requirements of the compressed DFA and the number of states visited for each character processed, which corresponds directly to the memory bandwidth required to evaluate regular expressions. In this paper we introduce a general compression technique that results in at most 2N state traversals when processing a string of length N. In comparison to the D2FA approach, our technique achieves comparable levels of compression, with lower provable bounds on memory bandwidth (or greater compression for a given bandwidth bound). Moreover, our proposed algorithm has lower complexity, is suitable for scenarios where a compressed DFA needs to be dynamically built or updated, and fosters locality in the traversal process. Finally, we also describe a novel alphabet reduction scheme for DFA-based structures that can yield further dramatic reductions in data structure size.
A Digital Quarter Square Multiplier
Authors: E. L. Johnson
Venue: IEEE Transactions on Computers (1980)

An application of the quarter square multiplication technique used in analog computing is proposed for digital multiplication. Significant savings in storage requirements for ROM- implemented product tables are demonstrated. A two's complement multiplication circuit utilizing the digital quarter square technique is presented.
Design of a Self-Checking Microprogram Control
Authors: R. W. Cook
Venue: IEEE Transactions on Computers (1973)

In designing a self-checking processor, it is essential to recognize the types of failures that are most probable. Matching the checking techniques with the type of faults that are expected to occur should yield the best result with the least amount of hardware. The microprogram control will consist of integrated circuits: large-scale integration (LSI) for the memory and small-scale integration (SSI) for the associated control logic. Because of the density of chips on a plug-in package and the physical proximity of the devices on an integrated circuit, multiple faults within a single circuit are highly probable. The types of faults within a circuit have been analyzed and found to be of the type which would tend to affect the bits in a unidirectional manner. Also the failed bits would probably be adjacent rather than randomly dispersed throughout-the microprogram store word.
Seaside: A Flexible Environment for Building Dynamic Web Applications
Authors: Stéphane Ducasse, Adrian Lienhard, Lukas Renggli
Venue: IEEE Software (2007)

Many complex applications use a Web browser as their main user interface. However, Web application development still remains difficult today and lags behind conventional desktop application development. Seaside is a Web application framework that provides a uniform, pure object-oriented view for Web applications. Exploiting the reflective features of Smalltalk, Seaside reintroduces procedure call abstraction in a client-server context. By harnessing Smalltalk's dynamic nature and reflective capabilities, Seaside is able to incorporate key features such as a component architecture that supports multiple, simultaneously active control flows; programmatical XHTML generation; and on-the-fly debugging, code editing, and recompilation. This article is part of a special issue on dynamically typed languages.
Graphics Terminal Requirements for the 1970's
Authors: E. D. Carlson
Venue: Computer (1976)

If new applications of computer graphics are to be developed and used, the graphics terminal must meet the requirements of users and applications. Studies conducted at the IBM Research Laboratory in San Jose have resulted in the identification of 30 specific requirements for the display screen, the associated hardware for input, output, processing and storage, the interaction rates, the terminal packaging, and the support of the applications programmer. Comparison of existing graphics terminal alternatives in terms of the requirements indicates that 18 of these 30 requirements are not being adequately met today.
The Paxos Register
Authors: Harry C. Li, Allen Clement, Amitanand S. Aiyer, Lorenzo Alvisi
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

We introduce the Paxos register to simplify and unify the presentation of Paxos-style consensusprotocols. We use our register to show how Lamport7.s Classic Paxos and Castro and Liskov's Byzantine Paxos are the same consensusprotocol, but for different failure models. We also use our register to compare and contrast Byzantine Paxos with Martin and Alvisi's Fast Byzantine Consensus. The Paxos register is a write-once register that exposes two important abstractions for reaching consensus: ( i ) read and write operations that capture how processes in Pams protocols progose and decide values and (ii) tokens that capture how these protocols guarantee agreement despite partial failures. We encapsulate the difSerences of several Paxos-style protocols in the implementation details of these abstractions.
Filtering spam with behavioral blacklisting
Authors: Anirudh Ramachandran, Nick Feamster, Santosh Vempala
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Spam filters often use the reputation of an IP address (or IP address range) to classify email senders. This approach worked well when most spam originated from senders with fixed IP addresses, but spam today is also sent from IP addresses for which blacklist maintainers have outdated or inaccurate information (or no information at all). Spam campaigns also involve many senders, reducing the amount of spam any particular IP address sends to a single domain; this method allows spammers to stay "under the radar". The dynamism of any particular IP address begs for blacklisting techniques that automatically adapt as the senders of spam change. This paper presents SpamTracker, a spam filtering system that uses a new technique called behavioral blacklisting to classify email senders based on their sending behavior rather than their identity. Spammers cannot evade SpamTracker merely by using "fresh" IP addresses because blacklisting decisions are based on sending patterns, which tend to remain more invariant. SpamTracker uses fast clustering algorithms that react quickly to changes in sending patterns. We evaluate SpamTracker's ability to classify spammers using email logs for over 115 email domains; we find that SpamTracker can correctly classify many spammers missed by current filtering techniques. Although our current datasets prevent us from confirming SpamTracker's ability to completely distinguish spammers from legitimate senders, our evaluation shows that SpamTracker can identify a significant fraction of spammers that current IP-based blacklists miss. SpamTracker's ability to identify spammers before existing blacklists suggests that it can be used in conjunction with existing techniques (e.g., as an input to greylisting). SpamTracker is inherently distributed and can be easily replicated; incorporating it into existing email filtering infrastructures requires only small modifications to mail server configurations.
Research and realization of personalized search engine based on Ontology
Authors: Li Yong, Li Guan-yu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Lack of personalization, poor recall and precision ratios, and lower efficiency of search are main problems of the current search engines, while the application of personalized search engine is an efficient approach. This paper gives the design and implementation of a personalized search engine, including the establishment and application of the shared knowledge base, the collection and mining of the users' interest, the construction and use of the users' interest base, and the combination of semantic query and personalized one. The core of the shared knowledge base and personalized query is ontology technology, and the effective use of which can obviously advance the recall and precision ratios. Moreover, the application of the users' interest base can improve the quality and efficiency of customer service.
Quadrature in Besov spaces on the Euclidean sphere
Authors: K. Hesse, H. N. Mhaskar, I. H. Sloan
Venue: Journal of Complexity (2007)

Let q>=1 be an integer, S^q denote the unit sphere embedded in the Euclidean space R^q^+^1, and @m"q be its Lebesgue surface measure. We establish upper and lower bounds forsupf@?B"p","@r^@c@!"S"^"qfd@m"q-@?k=1Mw"kf(x"k),x"k@?S^q,w"k@?R,k=1,...,M,where B"p","@r^@c is the unit ball of a suitable Besov space on the sphere. The upper bounds are obtained for choices of x"k and w"k that admit exact quadrature for spherical polynomials of a given degree, and satisfy a certain continuity condition; the lower bounds are obtained for the infimum of the above quantity over all choices of x"k and w"k. Since the upper and lower bounds agree with respect to order, the complexity of quadrature in Besov spaces on the sphere is thereby established.
Designing a neural network using a genetic algorithm with deterministic mutation and partial fitness
Authors: Minoru Fukumi, Toshiki Yoshino, Norio Akamatsu
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In this paper a method of designing a neural pattern recognition system for a rotated coin recognition problem using a genetic algorithm (GA) with deterministic mutation (DM) and partial fitness (PF) is presented. In this method, chromosomes of individuals in the GA are divided into several parts and their PF functions are evaluated for GA operations. Furthermore, the DM, which is based on neural network learning, is introduced. The DM can evolve chromosomes of individuals to increase their fitness functions in a deterministic manner. In the pattern recognition system described in this paper, the Fourier transform is used as a preprocessor which produces rotation invariant features. These features are recognized by a multilayered neural network. The GA is utilized to reduce the number of signals, Fourier spectra, and input to the neural network. This approach using the GA is a type of feature selection problem. It is shown that the present method is better than conventional GAs with respect to convergence in learning, and results in the formation of a small neural network.
Implementation and Evaluation of a Popularity-Based Reconstruction Optimization Algorithm in Availability-Oriented Disk Arrays
Authors: Lei Tian, Hong Jiang, Dan Feng, Qin Xin, Xing Shu
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

In this paper, we implement the incorporation of a Popularity-based multi-threaded Reconstruction Optimization algorithm, PRO, into the recovery mechanism of the Linux software RAID (MD), which is a well-known and widely-used availability-oriented disk array scheme. To evaluate the impact of PRO on RAID-structured storage systems such as MD, we conduct extensive trace-driven experiments. Our results demonstrate PRO's significant performance advantage over the existing reconstruction schemes, especially on a RAID-5 disk array, in terms of the measured reconstruction time and response time.
Power Transformer Fault Diagnosis Based on Rough Set Theory and Support Vector Machine
Authors: Wenqing Zhao, Yongli Zhu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Power transformers are one of the most expensive com- ponents of electrical power plants and the failures of such transformers can result in serious power system issues, so fault diagnosis for power transformer is very important to insure the whole power system run normally. Based on fault attributes of transformers, there are a few works have been done on transformer fault diagnosis using such methods as neural network,bayesian,and so on. As the fault informa- tion of power transformers has uncertainty characteristic, in this paper, a novel approach based on rough set theory and SVM is proposed. Moreover, by comparing with the tra- ditional methods like the neural network, there is less fault data discriminated by the rough set theory and SVM model and the accuracy for power transformer fault diagnosis is improved using our proposed model.
On monotone languages and their characterization by regular expressions
Authors: Gyrgy Gyurica
Venue: Acta Cybernetica (2007)

In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages.
A Formal Approach to Specifying Architecture Aspects and Their Weaving Logic
Authors: Chunhua Yang, Jiancheng Wan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Current aspect specification methods do not provide enough support for explicitly specifying aspects and their weaving logic, nor do they provide effective and suitable mechanisms for aspect analysis and evaluation. A formal approach for specifying architecture aspects and their weaving logic is presented. In this approach, architecture aspects and their weaving logic are specified in independent abstract mechanisms. More importantly, Petri Nets are used as the common foundations for describing their behaviors. Owing to the powerful specification capability of these mechanisms, the main advantages of this approach lie in that it can not only specify complex aspect architecture structures and behaviors and their complex weaving logic, but also make it possible for reasoning about and evaluating the weaving results. A simple example is given to illustrate the approach and its advantages.
A New Clustering Segmentation Algorithm of 3D Medical Data Field Based on Density-isoline
Authors: Xinwu Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Direct 3D volume segmentation is one of the difficult and hot research fields in 3D medical data field processing. Using the clustering and analyzing techniques of data mining, a new clustering and segmentation algorithm is presented. Firstly, According to the physical means of the medical data, the data field is preprocessed to speed up succeed processing. Secondly, the paper deduces and analyzes the clustering and segmentation algorithm and presents some methods to increase the process speed. Finally, the experimental results show that the algorithm has high accuracy when used to segment complicated medical tissue and can improve process speed greatly.
Correction to a January 1973 Contributor Entry
Venue: IEEE Transactions on Computers (1973)

In the January 1973 issue of this TRANSACTIONS an inadvertant oversight resulted in the omission of the photograph which should have appeared with Kiyoshi Maruyama's paper entitled "On the Parallel Evaluation of Polynomials." The Editor takes this opportunity to correct the oversight, and to extend apologies to Dr. Maruyama. 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
A low-cost embedded IDS to monitor and prevent Man-in-the-Middle attacks on wired LAN environments
Authors: Jorge Belenguer, Carlos T. Calafate
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

A Man-in-the-Middle (MitM) attack is, in the scope of a LAN, a technique where an attacker is able to redirect all traffic between two hosts of that same LAN for packet sniffing or data manipulation, without the end hosts being aware of it. Usually these attacks exploit security flaws in the implementation of the ARP protocol at hosts. Up to now, detecting such attacks required setting up a machine with special-purpose software for this task. As an additional problem, few Intrusion Detection Systems (IDS) are able to prevent MitM attacks. In this work we present a low-cost embedded IDS which, when plugged into a switch or hub, is able to detect and/or prevent MitM attacks automatically and efficiently. Since our system is limited to a micro-controller and a network interface, it can be produced at a very low cost, which is attractive for large scale production and deployment.
Correcting the EDF protocol in Ada 2005
Authors: A. Zerzelidis, A. Burns, A. J. Wellings
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

Earliest Deadline First (EDF) dispatching has been introduced into the Ada 2005 definition. Included in this definition is support for Baker's protocol for preemption level control over access to protected objects. Unfortunately the current model fails to implement all the situations covered by Baker's approach. A counter example is provided that illustrates this deficiency with the language as currently defined. A minor change to the language definition is proposed that removes the flaw.
Mapping of heterogeneous schemata, business structures, and terminologies
Authors: Domenico Beneventano, Sabina El Haoum, Daniele Montanari
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The current effort to extend the power of information systems by making use of the semantics associated with terms and structures has resulted in a need to establish correspondences between different systems to allow a rich exchange of information. This paper describes the early efforts taking place in the STASIS project to identify the issues underlying support for mapping of corresponding entities between such heterogeneous systems. The STASIS system is meant to help a user establish such mappings by exploiting a semantic environment where he/she can contribute his/her own entities and relate them with other pre-existing entities. This process needs support at the entity representation level, to encapsulate each item into an appropriately rich representation structure, and at the logical level, where the resulting model is verified for consistency towards its future use. Examples are offered and discussed to highlight the issues and propose solutions.
Parametric duality models for discrete minmax fractional programming problems containing generalized (θ,η,ρ)-V-invex functions and arbitrary norms
Authors: G. J. Zalmai
Venue: Journal of Applied Mathematics and Computing (2007)

The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (θ, η, ρ)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.
Learning semantic object parts for object categorization
Authors: Bastian Leibe, Alan Ettlin, Bernt Schiele
Venue: Image and Vision Computing (2008)

Appearance-based approaches to object recognition mostly rely on measuring the visual similarity of objects based on global or local descriptors. They have shown great success in object identification but often do not generalize to the more challenging case of object categorization, where category membership is often decided not only on a level of appearances, but also on a semantic level. It has been argued that model-based approaches are better suited to this problem, since they allow to inject high-level knowledge, for example about the constituting object parts and possible configurations. Postulating a set of object parts is problematic, though, since it is not guaranteed that those parts can be reliably extracted from real-world images. There is a need for a middle layer, forming an interface between the visual information readily available from the image and the higher-level semantic information that can be used by reasoning processes. In this work, we investigate how such an interface can be learned. As the appearance of object parts may vary considerably, this cannot be achieved by relying on visual similarity alone. Rather, this paper proposes to also use co-location and co-activation, together with weak top-down constraints, such as alignment, as guiding principles for learning the appearance of local object parts. The learned structures generalize beyond the appearance of single objects and often correspond to semantically plausible object parts, such as wheels, trunks, or windshields of cars. In a later stage, a Bayesian network of those extracted structures is used to verify object hypotheses successfully in difficult scenes.