ppxscal/embedding_network huggingface dataset:
Noise Tolerant Variants of the Perceptron Algorithm
Authors: Roni Khardon, Gabriel Wachman
Venue: The Journal of Machine Learning Research (2007)

A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the last hypothesis of the perceptron with another hypothesis or a vote among hypotheses. Another type simply adds a margin term to the perceptron in order to increase robustness and accuracy, as done in support vector machines. A third type borrows further from support vector machines and constrains the update function of the perceptron in ways that mimic soft-margin techniques. The performance of these algorithms, and the potential for combining different techniques, has not been studied in depth. This paper provides such an experimental study and reveals some interesting facts about the algorithms. In particular the perceptron with margin is an effective method for tolerating noise and stabilizing the algorithm. This is surprising since the margin in itself is not designed or used for noise tolerance, and there are no known guarantees for such performance. In most cases, similar performance is obtained by the voted-perceptron which has the advantage that it does not require parameter selection. Techniques using soft margin ideas are run-time intensive and do not give additional performance benefits. The results also highlight the difficulty with automatic parameter selection which is required with some of these variants.
WEAVER: A Knowledge-Based Routing Expert
Authors: Rostam Joobbani, Daniel Siewiorek
Venue: IEEE Design Test (1986)

WEAVER, a channel/switchbox knowledge-based routing program, simultaneously considers all the important routing metrics including100 percent routability, minimum routing area, minimum wire length, and the minimum number of vias. It allows prerouted netsand user interaction throughout the entire routing process, while relaxing the unnecessary contraints of assigning differentdirections?constraints imposed by all of the current channel and switchbox routers. A grid-based router using two interconnectionlayers, WEAVER can be easily expanded to route any shape routing area such as T or +. Implemented in OPSS, a production systemlanguage, WEAVER routinely produces routings requiring less area than routers that focus on a single routing metric.
From Business to IT with SEAM: The J2EE Pet Store Example
Authors: Irina Rychkova, Gil Regev, Lam-Son Le, Alain Wegmann
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Business and IT alignment demands clear traceability between the applications to be developed and the business requirements. SEAM is a systemic visual approach for modeling systems, including information systems and organizations. This paper illustrates how we represent the business role of an IT application and its platform-specific realization in SEAM. We use the Java Pet Store sample application as an example.
Dex: high-performance exploration on large graphs for information retrieval
Authors: Norbert Martínez-Bazan, Victor Muntés-Mulero, Sergio Gómez-Villamor, Jordi Nin, Mario-A. Sánchez-Martínez, Josep-L. Larriba-Pey
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Link and graph analysis tools are important devices to boost the richness of information retrieval systems. Internet and the existing social networking portals are just a couple of situations where the use of these tools would be beneficial and enriching for the users and the analysts. However, the need for integrating different data sources and, even more important, the need for high performance generic tools, is at odds with the continuously growing size and number of data repositories. In this paper we propose and evaluate DEX, a high performance graph database querying system that allows for the integration of multiple data sources. DEX makes graph querying possible in different flavors, including link analysis, social network analysis, pattern recognition and keyword search. The richness of DEX shows up in the experiments that we carried out on the Internet Movie Database (IMDb). Through a variety of these complex analytical queries, DEX shows to be a generic and efficient tool on large graph databases.
An Approach to Syndrome Differentiation in Traditional Chinese Medicine based on Neural Network
Authors: Minghui Shi, Changle Zhou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Although the traditional knowledge representation based on rules is simple and explicit, it is not effective in the field of syndrome differentiation in Traditional Chinese Medicine (TCM), which involves many uncertain concepts. To represent uncertain knowledge of syndrome differentiation in TCM, two methods were presented respectively based on certainty factors and certainty intervals. Exploiting these two methods, an approach to syndrome differentiation in TCM was proposed based on neural networks to avoid some limitations of other approaches. The main advantage of the approach is that it may realize uncertain inference of syndrome differentiation in TCM, whereas it doesn't request experts to provide all possible combinations for certainty degrees of symptoms and syndromes. Rather than Back Propagation (BP) algorithm but its modification was employed to improve the capability of generalization of neural networks. First, the standard feedforward multilayer BP neural network and its modification were introduced. Next, two methods for knowledge representation, respectively based on certainty factors and certainty intervals, were presented. Then, the algorithm was proposed based on neural network for the uncertain inference of syndrome differentiation in TCM. Finally, an example was demonstrated to illustrate the algorithm.
Asymptotically optimal energy-aware routing for multihop wireless networks with renewable energy sources
Authors: Longbi Lin, Ness B. Shroff, R. Srikant
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In this paper, we develop a model to characterize the performance of multihop radio networks in the presence of energy constraints and design routing algorithms to optimally utilize the available energy. The energy model allows us to consider different types of energy sources in heterogeneous environments. The proposed algorithm is shown to achieve a competitive ratio (i.e., the ratio of the performance of any offline algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal with respect to the number of nodes in the network. The algorithm assumes no statistical information on packet arrivals and can easily be incorporated into existing routing schemes (e.g., proactive or on-demand methodologies) in a distributed fashion. Simulation results confirm that the algorithm performs very well in terms of maximizing the throughput of an energy-constrained network. Further, a new threshold-based scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.
Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks
Authors: Heng Ma
Venue: Expert Systems with Applications: An International Journal (2008)

The world wide web (WWW) has become the largest information archive in the world because of its connectivity and scalability. Web pages, identified by URLs, are the basic forms for transmitting the requested information to clients' PC, whose number continuously explodes. There are a large portion of the web pages containing undesirable content, such as pornography, crimes, drugs and terrorisms, which makes viewers' discretion necessary. The large number of the undesirable web pages, however, has made the blocking more difficult on a client PC, because checking through the large collection of URLs is a time-consuming task. We propose a neural network method for determining the existing status of a requested URL in the large prohibited collection. The large prohibited URL collection containing 400,000 URLs was obtained by specifying a number of keywords, e.g. ''porn'' or ''sex'', on several commercial search engines. The simulation results show superior performances in both memory requirement and speed, comparing with a database implementation on the same PC.
Special Feature: Microprocessor Assembly Language Draft Standard
Authors: W. P. Fischer
Venue: Computer (1979)

Consolidating existing assembly language features, this proposed standard establishes assembly language conventions for present and future microprocessors. It is, offered here for public comment before submission to the IEEE Standards Board. 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
Communication Optimization on Automatic Program Parallelization
Authors: Dong Chun-Li, Zhao Rong-Cai, Ma Zhuo-Jie, Li Dong-Hong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Minimizing communication by increasing the locality of data references is an important optimization for achieving high performance on distributed memory machines. But in the progress of decomposition, reorganization is inevitable. And the communication produced by reorganization is inevitable too. In this paper, the authors present a linear decomposition algorithm that automatically finding computation and data decomposition, including finding data and computations decomposition that has data reorganization communication. And the authors improve the method and reduce the communication cost by merging parallel regions with the same data decomposition. Keywords: Parallelizing compiler, MPI, data reorganization, parallel region merging, data decomposition, computation decomposition
When do researchers collaborate? Toward a model of collaboration propensity
Authors: Jeremy P. Birnholtz
Venue: Journal of the American Society for Information Science and Technology (2007)

This exploratory study compares two approaches to understanding the &ldquo;collaboration propensity&rdquo; of individual researchers. On the one hand, social comparisons of disciplines would suggest that collaboration is a function of orientation toward individual versus collective responsibility for discovery. A contrasting approach would hold that collaboration depends on the work researchers are engaged in&mdash;when it is useful to collaborate, they will do so regardless of the social climate. Results presented here suggest that this latter approach is potentially more powerful but that there are complexities in measurement and operationalization that urge a more nuanced treatment of collaboration propensity. &copy; 2007 Wiley Periodicals, Inc.
An Implementation of Structured Code Techniques on a Real-Time System
Authors: J. P. Romanos
Venue: Computer (1975)

In early 1973 the Computer Programming Laboratory of Hughes Aircraft Company decided to utilize structured programmning on a medium-sized (12 programmers) real-time system. The system, which was coded in CMS-2Y (MOD 8), ran on the UNIVAC AN/UYK-7 and had extensive hardware and interactive operator interfaces. In addition to the use of structured coding techniques, the software was developed using the "team concept" described below. 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
The effect of experience on the test-driven development process
Authors: Matthias M. Müller, Andreas Höfer
Venue: Empirical Software Engineering (2007)

We conducted a quasi-experiment to compare the characteristics of experts' and novices' test-driven development processes. Our novices were 11 computers science students who participated in an Extreme Programming lab course, the expert group consisted of seven professionals who had industrial experience in test-driven development. The novices as well as two of the experts worked in a laboratory environment whereas the remaining five experts worked in their office. The experts complied more to the rules of test-driven development and had shorter test-cycles than the novices. The tests written by the experts were of higher quality in terms of statement and block coverage as well. All reported results are statistically significant on the 5% level. We conclude that the results of studies which evaluate performance of test-driven development using subjects inexperienced in TDD are not easily generalisable.
An Algorithm for Testing Asummability of Boolean Functions
Authors: Sureshchander
Venue: IEEE Transactions on Computers (1974)

An algorithm is described in this note to determine whether a switching function is asummable or not. The algorithm is efficient and simple for testing 2-asummability.
Restructuring E-learning With Ontologies
Authors: Gonca Kyzylkaya, Emel Dikbas Torun, Petek Askar
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This paper examines the role of ontologies in the e-learning environments. A brief review of various ontologies is discussed in three areas: Learning design, learning content and learner profile. A new perspective for curriculum and instructional design is proposed.
$${\tt surveillance}$$: An R package for the monitoring of infectious diseases
Authors: Michael Höhle
Venue: Computational Statistics (2007)

Public health surveillance of emerging infectious diseases is an essential instrument in the attempt to control and prevent their spread. This paper presents the R package "surveillance", which contains functionality to visualise routinely collected surveillance data and provides algorithms for the statistical detection of aberrations in such univariate or multivariate time series. For evaluation purposes, the package includes real-world example data and the possibility to generate surveillance data by simulation. To compare algorithms, benchmark numbers like sensitivity, specificity, and detection delay can be computed for a set of time series. Package motivation, use and potential are illustrated through a mixture of surveillance theory, case study and R code snippets.
Analysis of Specified Bit Handling Capability of Combinational Expander Networks
Authors: Abhijit Jas, Srinivas Patil
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Test compression schemes based on combinational expander networks have become very popular in recent times. The idea behind these schemes is to use m bits from the tester to produce N (m \gt N) bits for the internal scan chains of the circuit under test. In this paper we address the general problem of designing combinational expander networks with N outputs which guarantee that any S specified bits can be justified at the expander output. By analyzing the constraints imposed on the output space of such a network we derive formulae that provide the minimum value of m (and consequently a maximum value of the amount of compression that can be achieved). We then show that a subclass of one of the state-of-the-art combinational expander designs (XPAND) being currently used in several industrial designs achieves the maximum amount of compression possible.
On the Security of an Identity-Based Threshold Proxy Signature Scheme with Known Signers
Authors: Rongbo Lu, Dake He, Changji Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In TAMC'06, Bao et al. proposed a new identity-based threshold proxy signature with known signers from the bilinear pairings for the first time. In this paper, however, an attack is proposed to show that their scheme have serious security flaws. By this attack, based on the proxy signature generated by proxy signers for a message on behalf of an original signer, an adversary can forge an illegal proxy signature for any message seemed to be generated by proxy signers on behalf of this adversary himself. After producing a forged proxy signature, the adversary has the same authority with the original signer to the proxy signer, and the verifier cannot distinguish that which one is the real original signer. Especially, this attack can be modified forge a valid threshold proxy signature for any message with knowing a previously valid threshold proxy signature generated by proxy signers on behalf of an illegal original signer, and can also be modified to change a proxy signature into a valid threshold signature belonging to the group that actually generates the proxy signatures for any message.
Modeling the transport of ions in unsaturated cement-based materials
Authors: E. Samson, J. Marchand
Venue: Computers and Structures (2007)

This paper gives the details of the multiionic transport model STADIUM^(R) intended to describe the degradation of cement-based materials exposed to aggressive environments. The main algorithm is based on an operator splitting approach. The first part of the calculations is dedicated to solving the transport equations without considering the chemical reactions. The concentration profile of each ionic species is calculated by taking into account diffusion, electrical coupling between the ions, chemical activity effects and advection caused by a capillary suction flow. In the second part, a chemical module corrects the concentration profiles to enforce the equilibrium between the pore solution and the various solid phases of an hydrated cement paste. The model is compared to experimental results of hydrated cement pastes exposed to pure water and sodium sulfate solutions. Long term simulations were also performed to analyze the behavior of the algorithm.
The application of particle swarm optimization algorithm in training Forward Neural Network
Authors: Song Shao-zhong, Zhang Li-biao, Shu-hua
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Prorsad Neural Network trained with Particle Swarm Optimization (PSO) algorithm was studied, and the new method was suggested. Compared with BP algorithm , this new method shows high effectivity..
ScentIndex and ScentHighlights: productive reading techniques for conceptually reorganizing subject indexes and highlighting passages
Authors: Ed H. Chi, Lichan Hong, Julie Heiser, Stuart K. Card, Michelle Gumbrecht
Venue: Information Visualization (2007)

Agreat deal of analytical work has been carried out in the context of reading, in digesting the semantics of the material, the identification of important entities, and capturing the relationship between entities. Visual analytic environments, therefore, must encompass reading tools that enable the rapid digestion of large amounts of reading material. Other than plain text search, subject indexes, and basic highlighting, tools are needed for rapid foraging of the text. In this paper, we describe a technique that presents an enhanced subject index for a book by conceptually reorganizing it to suit particular expressed user information needs. Users first enter information needs via keywords, describing the concepts they are trying to retrieve and comprehend. Then our system, called Scentindex, computes what index entries are conceptually related, and reorganizes and displays these index entries on a single page. We provide a number of navigational cues to help users peruse over this list of index entries and find relevant passages quickly. We report some initial results in a new technique called ScentHighlights that enhances skimming activity by conceptually highlighting sentences. Both use similar techniques by computing what conceptual keywords are related to each other via word co-occurrence and spreading activation. Compared to regular reading of a paper book, our study showed that users are more efficient and more accurate in finding, comparing, and comprehending material in our system.
Optimal One-Bit Full Adders With Different Types of Gates
Authors: Tso-Kai Liu
Venue: IEEE Transactions on Computers (1974)

Optimal networks with thirty different types of restrictions are listed for the one-bit fuli adder. Optimality is derined as the minimization of the number of gates under different restrictions.
Real-time Performance Analysis for Wireless Sensor Networks
Authors: Qiang Zhou, Huagang Xiong, Hengqing Lin
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In this paper, an optimal time slot allocation scheme (O-TDMA) supporting hard real-time communication in wireless sensor networks (WSNs) is studied. In mission-critical system, O-TDMA scheme based on TDMA protocol and a real-time performance analysis method based on WCAU (the worst case achievable utilization) are proposed. Analytical proof that O-TDMA has better performance than other schemes is given. Finally simulative examples are presented to promote the conclusion.
Lateral inferotemporal cortex maintains conceptual---semantic representations in verbal working memory
Authors: Christian J. Fiebach, Angela D. Friederici, Edward E. Smith, David Swinney
Venue: Journal of Cognitive Neuroscience (2007)

Verbal working memory, that is, the temporary maintenance of linguistic information in an activated state, is typically assumed to rely on phonological representations. Recent evidence from behavioral, neuropsychological, and electrophysiological studies, however, suggests that conceptual-semantic representations may also be maintained in an activated state. We developed a new semantic working memory task that involves the maintenance of a novel conceptual combination. Functional magnetic resonance imaging data acquired during the maintenance of conceptual combinations, relative to an item recognition task without the possibility of conceptual combination, demonstrate increased activation in the posterior left middle and inferior temporal gyri (known to be involved in conceptual representations) and left inferior frontal gyrus (known to be involved in semantic control processes). We suggest that this temporo-frontal system supports maintenance of conceptual information in working memory, with the frontal regions controlling the sustained activation of heteromodal conceptual representations in the inferior temporal cortex.
Symmetrical Fuzzy Collaborative Optimization Using Satisficing and Sufficiency Degree Model
Authors: Ye Tao, Xian-qiang Lv, Sheng-ju Han, Wen-lian Yang, Xin Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Collaborative optimization (CO), one of the multidisciplinary design optimization (MDO) approaches, is a two-level optimization method for large-scale and distributed-analysis engineering design problem. In the practice of engineering design and manufactures, there are lots of uncertain or fuzzy parameters, which will lead to the final optimal objectives, are fuzzy sets as well. This paper proposes the use of fuzzy satisficing and sufficiency degree model in place of the system-level and discipline- level optimizations in order to relieve the aforementioned difficulties, and sets the acceptance level as the shared design variable between disciplines, which is maximized in the system level. The illustrative mathematical example is provided to demonstrate the feasibility of the proposed method.