ppxscal/embedding_network huggingface dataset:
Bit complexity of breaking and achieving symmetry in chains and rings
Authors: Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Venue: Journal of the ACM (JACM) (2008)

We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed but have distinct identities, taken from &lcub;0, 1,&hellip; ,M &minus; 1&rcub;. We investigate the communication costs of three well studied tasks: Consensus, Leader, and MaxF (finding the maximum identity). We show that in chain and ring topologies, the message complexities of all three tasks are the same. Hence, we study a finer measure of complexity: the number of transmitted bits required to solve a task T, denoted BitC(T). We prove several new lower bounds (and some simple upper bounds) that imply the following results: For the two processors case, BitC(Consensus) &equals; 2 and BitC(Leader) &equals; BitC(MaxF) &equals; 2log2 M &plusmn; O(1), where the gap between the lower and upper bounds is almost always 1. For a chain, BitC(Consensus) &equals; &Theta;(n), BitC(Leader) &equals; &Theta;(n &plus; log M), and BitC(MaxF) &equals; &Theta;(n log M). For the ring topology, we prove the lower bound of &Omega;(n log M) for Leader, and (hence) MaxF. We consider also a chain where the intermediate processors have no identities. We prove that BitC(Leader) &equals; &Theta;(n log M), which is equal to n times the bit complexity of the problem for two processors. For the specific case when the chain length is even, we prove that BitC(Leader) &equals; &Theta;(n), for both above settings. In addition, we show that for any algorithm solving MaxF, there exists an input, for which every execution has the bit complexity &Omega;(n log M) (this is not the case for Leader). In our proofs, we use both methods of distributed computing and of communication complexity theory, establishing new links between the two areas.
An Adaptive Middleware to Overcome Service Discovery Heterogeneity in Mobile Ad Hoc Environments
Authors: Carlos A. Flores-Cortés, Gordon S. Blair, Paul Grace
Venue: IEEE Distributed Systems Online (2007)

Numerous protocols have emerged for service discovery in mobile ad hoc environments, and they differ significantly in terms of service description languages, interaction patterns, message type and structure, directory architectures, and so on. So, middleware is required to support the discovery of services advertised on multiple platforms and achieve interoperability between heterogeneous discovery protocols. This article presents a component framework approach for developing a configurable and dynamically reconfigurable multipersonality discovery middleware.
Compliance with data protection laws using hippocratic database active enforcement and auditing
Authors: C. M. Johnson, T. W. A. Grandison
Venue: IBM Systems Journal (2007)

Governments worldwide are enacting data protection laws that restrict the disclosure and processing of personal information. These laws impose administrative and financial burdens on companies that manage personal information and may hinder the legitimate and valuable sharing and analysis of this information. In this paper we describe an integrated set of technologies, known as the Hippocratic Database (HDB), which enables compliance with security and privacy regulations without impeding the legitimate flow of information. HDB's Control Center allows companies to specify fine-grained disclosure policies based on the role of the user, the purpose of the access, the intended recipient, and other disclosure conditions. Its Active Enforcement component transparently enforces these policies by transforming user queries in a middleware layer to ensure that the database returns only policy-compliant information. HDB's Compliance Auditing system efficiently tracks all database accesses and allows auditors to formulate precise audit queries to monitor compliance with privacy and security policies. In this paper, we outline the basic architecture of the HDB solution, discuss the advantages of our approach, and illustrate the features of each component with practical compliance scenarios from the financial services industry.
Workshop Report: Impact of Emerging Technology
Authors: G. C. Feth
Venue: Computer (1975)

The impact of solid-state technology, as it emerges in the form of large-scale integration of computer functions, is dramatic. The effects are felt at all levels-by users, systems designers, and the technology houses; the ground rules of design and the economic tradeoffs have been changed, and the structure of the business is being affected. This impact and the emerging technology itself were the subject of a workshop conducted by the Computer Society's Computer Elements Committee last June in Vail, Colorado. 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
Automated Free Text Classification of Economic Activities Using VG-RAM Weightless Neural Networks
Authors: Alberto de Souza, Felipe Pedroni, Elias Oliveira, Patrick M. Ciarelli, Wallace F. Henrique, Lucas Veronese
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

We tackle the problem of automating the categorization of companies according to their economic activities using business descriptions in free text format as input. This categorization is vital to fundamental aspects of national governmental administration such as short, medium and long term planning and taxation. As the number of categories considered is very large (more than 1000 in the Brazilian scenario), the automatic text categorization problem targeted here is challenging. We have applied and compared the use of two different techniques to deal with it: the Vector Space Model, a well known text categorization technique; and Virtual Generalizing Random Access Memory Weightless Neural Network, or VG-RAM WNN. To our knowledge, this is the first report on using VG-RAM WNN for text categorization.
Metatheory of actions: Beyond consistency
Authors: Andreas Herzig, Ivan Varzinczak
Venue: Artificial Intelligence (2007)

Traditionally, consistency is the only criterion for the quality of a theory in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the metatheory of actions by investigating what other properties a good domain description should have. We state some metatheoretical postulates concerning this sore spot. When all postulates are satisfied we call the action theory modular. Besides being easier to understand and more elaboration tolerant in McCarthy's sense, modular theories have interesting properties. We point out the problems that arise when the postulates about modularity are violated, and propose algorithmic checks that can help the designer of an action theory to overcome them.
pcaMethods—a bioconductor package providing PCA methods for incomplete data
Authors: Wolfram Stacklies, Henning Redestig, Matthias Scholz, Dirk Walther, Joachim Selbig
Venue: Bioinformatics (2007)

Summary:pcaMethods is a Bioconductor compliant library for computing principal component analysis (PCA) on incomplete data sets. The results can be analyzed directly or used to estimate missing values to enable the use of missing value sensitive statistical methods. The package was mainly developed with microarray and metabolite data sets in mind, but can be applied to any other incomplete data set as well. Availability: http://www.bioconductor.org Contact: selbig@mpimp-golm.mpg.de Supplementary information: Please visit our webpage at http://bioinformatics.mpimp-golm.mpg.de/
Process planning data mining technology based on object-oriented modeling
Authors: Jia Xiaoliang, Tian Xitian, Zhang Zhenming
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

CAPP (Computer Aided Processing Planning) system is the supportable system in process planning informanization in manufacturing enterprise. The systematic representation of process planning knowledge and the foundation of process planning knowledge base (PPKB) are the basis in CAPP application system. Based on the research work of a CAPP development platform system (CAPPFramework) supported by 863/CIMS in China, the knowledge discovery and management actuality, the composing of process planning knowledge (PPK) are analyzed. The concept of process planning data mining (PPDM) is proposed. The technology architecture of process planning data mining is founded based on object-oriented modeling technology, and the process planning data mining language (PPDML) is designed. Farther more, application of PPDM in typical operation summarization is described in detail.
An Isma Lee Router Accelerator
Authors: Thomas Ryan, Edwin Rogers
Venue: IEEE Design Test (1987)

By concentrating on application-specific behavior, extremely simple and fast state machines can be designed and replicatedinto arrays that fit in one or two chips. Called an iterative state machine array, this architecture can increase speed bya factor of 1000 over the speed possible with traditional software design automation tools. Because the basic ISMA cells areso simple, designers can use special-purpose hardware economically, instead of relying on software for larger, slower general-purposesystems. When applied to two-layer Lee routing, we estimate that the ISMA can route 1000 two-point nets of length 2500? overa (2048?)2 surface in under half a minute. A generalpurpose purpose von Neumann system could take hours, in comparison.
The Relationship Between Two Fast Fourier Transforms
Authors: I. J. Good
Venue: IEEE Transactions on Computers (1971)

The purpose of this note is to show as clearly as possible the mathematical relationship between the two basic fast methods used for the calculation of discrete Fourier transforms and to generalize one of the methods a little further. This method applies to all those linear transformations whose matrices are expressible as direct products.
System Design of a Cellular APL Computer
Authors: K. J. Thurber, J. W. Myrna
Venue: IEEE Transactions on Computers (1970)

A system design is given for a computer capable of efficient execution of APL source statements and programs. The system is organized in a new type computer architecture based upon the storage of matrices and vectors in cellular logic arrays. Almost all of the scalar, mixed, and composite fixed point APL operations are implemented on the machine by algorithms given in this paper. The detailed logical design of the machine has not been completed; however, all the needed logic and memory has been specified. Also, the functions that each hardware cell must be able to perform have been specified. The algorithms for most APL operations are presented in flow charts or tables which give the detailed data flow produced by the execution of each APL operation in the machine.
Distinct patterns of neural activity during memory formation of nonwords versus words
Authors: Leun J. Otten, Josefin Sveen, Angela H. Quayle
Venue: Journal of Cognitive Neuroscience (2007)

Research into the neural underpinnings of memory formation has focused on the encoding of familiar verbal information. Here, we address how the brain supports the encoding of novel information that does not have meaning. Electrical brain activity was recorded from the scalps of healthy young adults while they performed an incidental encoding task (syllable judgments) on separate series of words and “nonwords” (nonsense letter strings that are orthographically legal and pronounceable). Memory for the items was then probed with a recognition memory test. For words as well as nonwords, event-related potentials differed depending on whether an item would subsequently be remembered or forgotten. However, the polarity and timing of the effect varied across item type. For words, subsequently remembered items showed the usually observed positive-going, frontally distributed modulation from around 600 msec after word onset. For nonwords, by contrast, a negative-going, spatially widespread modulation predicted encoding success from 1000 msec onward. Nonwords also showed a modulation shortly after item onset. These findings imply that the brain supports the encoding of familiar and unfamiliar letter strings in qualitatively different ways, including the engagement of distinct neural activity at different points in time. The processing of semantic attributes plays an important role in the encoding of words and the associated positive frontal modulation.
Protein Folding Based on Simulated Annealing Algorithm
Authors: Xiaomei Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Protein folding problem is one of the most important problems in bioinformatics, and hydrophobic polar model is a wide abstract model in study of this problem. Simulated annealing is a heuristic global optimization algorithm, which has been successfully applied to many difficult optimization problems. This paper proposes an improved simulated annealing algorithm to search the ground state of HP lattice model for protein folding. Numerical results show that the improved simulated annealing algorithm can find the known lowest ground state faster for the given HP sequences in simple lattice model.
Compression-Based Averaging of Selective Naive Bayes Classifiers
Authors: Marc Boullé
Venue: The Journal of Machine Learning Research (2007)

The naive Bayes classifier has proved to be very effective on many real data applications. Its performance usually benefits from an accurate estimation of univariate conditional probabilities and from variable selection. However, although variable selection is a desirable feature, it is prone to overfitting. In this paper, we introduce a Bayesian regularization technique to select the most probable subset of variables compliant with the naive Bayes assumption. We also study the limits of Bayesian model averaging in the case of the naive Bayes assumption and introduce a new weighting scheme based on the ability of the models to conditionally compress the class labels. The weighting scheme on the models reduces to a weighting scheme on the variables, and finally results in a naive Bayes classifier with "soft variable selection". Extensive experiments show that the compression-based averaged classifier outperforms the Bayesian model averaging scheme.
A Simple Experiment in Top-Down Design
Authors: D. Comer
Venue: IEEE Transactions on Software Engineering (1979)

In this paper we: 1) discuss the need for quantitatively reproducible experiments in the study of top-down design; 2) propose the design and writing of tutorial papers as a suitably general and inexpensive vehicle; 3) suggest the software science parameters as appropriate metrics; 4) report two experiments validating the use of these metrics on outlines and prose; and 5) demonstrate that the experiments tended toward the same optimal modularity.
FleDEx: flexible data exchange
Authors: Filipe Mesquita, Denilson Barbosa, Eli Cortez, Altigran S. da Silva
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

We propose a lightweight framework for data exchange that is suitable for non-expert and casual users sharing data on the Web or through peer-to-peer systems. Unlike previous work, we consider a simplistic data model and schema formalism that are suitable for describing typical online data, and propose algorithms for mapping such schemas as well as for translating the corresponding instances. Our solution requires minimal overhead and setup costs compared to existing data exchange systems, making it very attractive in the Web data exchange setting. We report experimental results indicating that our method works well with real Web data from various domains.
Attribute Selection in Software Engineering Datasets for Detecting Fault Modules
Authors: D. Rodriguez, R. Ruiz, J. Cuadrado-Gallego, J. Aguilar-Ruiz, M. Garre
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Decision making has been traditionally based on managers experience. At present, there is a number of software engineering (SE) repositories, and furthermore, automated data collection tools allow managers to collect large amounts of information, not without associated problems. On the one hand, such a large amount of information can overload project managers. On the other hand, problems found in generic project databases, where the data is collected from different organizations, is the large disparity of its instances. In this paper, we characterize several software engineering databases selecting attributes with the final aim that project managers can have a better global vision of the data they manage. In this paper, we make use of different data mining algorithms to select attributes from the different datasets publicly available (PROMISE repository), and then, use different classifiers to defect faulty modules. The results show that in general, the smaller datasets maintain the prediction capability with a lower number of attributes than the original datasets.
On the Generation of Permutations in Magnetic Bubble Memories
Authors: C. L. Chen
Venue: IEEE Transactions on Computers (1978)

A better algorithm is presented for the generation of an arbitrary permutation in a model of magnetic bubble memories that have been investigated previously.
Lesbian, gay, bisexual and transgender (LGBT) issues in virtual worlds
Authors: Bridget Marie Blodgett, Heng Xu, Eileen M. Trauth
Venue: ACM SIGMIS Database (2007)

In virtual worlds, users interact with each other by creating virtual identities through avatars. As the avatar creation process is constrained by the assumptions of designers who develop the avatar creation tools, some potential participants in virtual worlds are forced into narrow social roles that may not accurately represent them. Drawing on structuration theory and trust literature, we develop a research agenda that addresses how avatar-based technologies and user social identities may be mutually constructed and how identity misrepresentation may impact trust in virtual worlds. This paper demonstrates the importance of a discussion of Lesbian, Gay, Bisexual and Transgender (LGBT) issues in virtual worlds. These issues require additional research that should closely examine the ongoing changes both in the technology facilitating the virtual worlds, as well as the social landscape that governs issues of diversity in general, and gender issues in particular.
An automated end-to-end lecture capture and broadcasting system
Authors: Cha Zhang, Yong Rui, Jim Crawford, Li-Wei He
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

Remote viewing of lectures presented to a live audience is becoming increasingly popular. At the same time, the lectures can be recorded for subsequent on-demand viewing over the Internet. Providing such services, however, is often prohibitive due to the labor-intensive cost of capturing and pre/post-processing. This article presents a complete automated end-to-end system that supports capturing, broadcasting, viewing, archiving and searching of presentations. Specifically, we describe a system architecture that minimizes the pre- and post-production time, and a fully automated lecture capture system called iCam2 that synchronously captures all contents of the lecture, including audio, video, and presentation material. No staff is needed during lecture capture and broadcasting, so the operational cost of the system is negligible. The system has been used on a daily basis for more than 4 years, during which 522 lectures have been captured. These lectures have been viewed over 20,000 times.
DataScope: viewing database contents in Google Maps' way
Authors: Tianyi Wu, Xiaolei Li, Dong Xin, Jiawei Han, Jacob Lee, Ricardo Redder
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

People have been relying on Google Maps, MapQuest, or other similar services to find desired locations on maps, browse surrounding businesses, get driving directions, etc.. Navigation by clicking and dragging the mouse to browse maps at multiple levels of resolution is one of the most attractive features in Web-based map exploration. Most database systems, though with some graphical user interfaces, are still lack of data-content browsing-based interfaces. Motivated by Google Maps, we develop DataScope, a Web-based data content visualization system, for people to view the desired data easily, interactively, and at multi-resolution.
Cufres: clustering using fuzzy representative eventsselection for the fault recognition problem intelecommunication networks
Authors: Jacques H. Bellec, Tahar M. Kechadi
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

In this paper we introduce an efficient clustering algorithm embedded in a novel approach for solving the problem of faults identification in large telecommunication networks. Our algorithm is especially designed for the event correlation problem taking into account comprehensive information about the system behaviour. Although alarms are usually useful for identifying faults in such systems, their large number overloads the current management systems, making it extremely difficult to provide an answer within a reasonable response time. The alarm flow presents some interesting characteristics like alarm storm and alarm cascade. For instance, a single fault may result in a large number of alarms, and it is often very difficult to isolate the true cause of the fault. One way of overcoming this problem is to analyze, interpret and reduce the number of these alarms before trying to localize the faults. In this paper, we present a new original algorithm, and compare it with some available clustering algorithms by experimenting them with some samples of both simulated and real data from Ericsson's network.
Research and Applications of Fuzzy Immune PID Control in the Load-Control of Tube Mill
Authors: Guili Yuan, Jizhen Liu, Wen Tan, Xiangjie Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Aiming at the tube mill burthen controlled object with the characteristics of large delay, large inertia, nonlinear and time-variant, we design a tube mill burthen control system basing at fuzzy immune PID control. The system combines the cascade control with the fuzzy immune PID control, and adopts P control in the inner loop and fuzzy immune PID control in the outer loop , taking fully advantage of the cascade control, fuzzy control, immune feedback control and PID control, which makes the system have not only better track ability but also stronger robust and anti-disturbance .In order to show the superior of the control strategy , simultaneously the paper carry out cascade PID control Simulation, the result manifests that the control effect has better regulation- quality than cascade PID control. what's more, the control algorithm is simple and practical.