ppxscal/embedding_network huggingface dataset:
The Monoids of Order Eight and Nine
Authors: Andreas Distler, Tom Kelsey
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of order 9 or less. Our approach is novel, using computer algebra to break symmetry and constraint satisfaction search to find candidate solutions. We present new results in algebraic combinatorics: up to isomorphism and anti-isomorphism, there are 858,977 monoids of order 8 and 1,844,075,697 monoids of order 9.
Improving 3D Selection in VEs through Expanding Targets and Forced Disocclusion
Authors: Ferran Argelaguet, Carlos Andujar
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

In this paper we explore the extension of 2D pointing facilitation techniques to 3D object selection. We discuss what problems must be faced when adapting such techniques to 3D interaction on VR applications, and we propose two strategies to adapt the expanding targets approach to the 3D realm, either by dynamically scaling potential targets or by using depth-sorting to guarantee that potential targets appear completely unoccluded. We also present three experiments to evaluate both strategies in 3D selection tasks with multiple targets at varying densities. Our user studies show promising results of 3D expanding targets in terms of error rates and, most importantly, user acceptance.
Model Curicula for Four-Year Computer Science and Engineering Programs: Bridging the Tar Pit
Authors: M. C. Mulder
Venue: Computer (1975)

The Model Curricula Subcommittee of the IEEE Computer Society Education Committee was formed some 16 months ago to develop an IEEE Computer Society-sanctioned four-year curriculum in computer science and engineering to be used by colleges and universities beginning instruction in this discipline, and by many institutions with existing programs. To date, the subcommittee has concerned itself with the four-year BS degree in computer science and engineering. The subcommittee members are Michael C. Mulder (subcommittee chairman), Bonneville Power Administration; Taylor Booth, University of Connecticut; C. L. Coates, Purdue University; George Davida, University of Wisconsin ( Milwaukee); Alvin Despain, Utah State University; Oscar Garcia, University of South Florida; Harvey Garner, University of Pennsylvania; Sakti Ghosh, IBM San Jose; Herb Hellerman, SUNY Binghamton; Ronald Hoelzeman, University of Pittsburgh; Richard Kopka, U. S. Air Force Academy; David Pessel, University of Rochester; C. V. Ramamoorthy, UC Berkeley; David Rine, West Virginia University.
Extended Legendre Wavelets Neural Network
Authors: Xiaoyang Zheng, Xiaofan Yang, Hong Su, Yong Wu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Based on analyzing Legendre wavelets, this paper presents the extended Legendre wavelets (ELW), which is defined on the interval (¿ r,r), and proves to be orthogonal. Furthermore, this paper constructs the extended Legendre wavelet neural network (ELWNN) by using the ELW functions instead of the activation functions of a multilayer perceptron neural network (MPNN). The ELWNN has advantages of simple structure and very efficient convergence rate. Additionally, the ELWNN is applied to the approximation a function and better approximate results are achieved.
The Impact of Network System Architecture on CAD/CAM Productivity
Authors: David Weisberg
Venue: IEEE Computer Graphics and Applications (1984)

High-level,predictable CAD/CAM performance can be realized with intelligent engineering workstations that are connected in a distributed/networked arrangement. 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
Maximizing Aggregate Throughput of Wireless Ad Hoc Networks Using Enhanced Physical Carrier Sensing
Authors: Nyein Aye Maung Maung, Taku Noguchi, Makoto Kawai
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Aggregate throughput of wireless ad hoc networks is diminished by the presence of hidden terminal problem which can cause packet collisions at the receiver and exposed terminal problem which can degrade spatial reuse of the network. As reducing one problem increases the other, the aggregate throughput will be improved only if tradeoff between these two problems is achieved. In this paper, we propose a medium access control scheme which utilizes enhanced physical carrier sensing with tunable carrier sense range based on transmitter-receiver distance. Two analytical formulations for deriving optimal carrier sense ranges: one for interference mitigation and the other for reducing exposed terminal problem have been proposed and the optimal carrier sense range for balancing these two problems has also been estimated based on these formulations. Effectiveness of enhanced physical carrier sensing with tunable carrier sense range on achieving the highest aggregate network throughput has been demonstrated and the optimal carrier sense ranges for different transmitter-receiver distances have been investigated through extensive simulations. Comparisons between simulation results and theoretical results have been presented to validate our proposed scheme.
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
Authors: Wanxia Wei, Chu Min Li, Harry Zhang
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in which non-weighting algorithm adaptG 2 WSAT + selects a variable to flip, as heuristic adaptG 2 WSAT +, the way in which clause weighting algorithm RSAPS selects a variable to flip, as heuristic RSAPS, and the way in which variable weighting algorithm VW selects a variable to flip, as heuristic VW. We propose a new switching criterion: the evenness or unevenness of the distribution of clause weights. We apply this criterion, along with another switching criterion previously proposed, to heuristic adaptG 2 WSAT +, heuristic RSAPS, and heuristic VW. The resulting local search algorithm, which adaptively switches among these three heuristics in every search step according to these two criteria to intensify or diversify the search when necessary, is called NCVW (Non-, Clause, and Variable Weighting). Experimental results show that NCVW is generally effective on a wide range of instances while adaptG 2 WSAT +, RSAPS, VW, and gNovelty + and adaptG 2 WSAT0, which won the gold and silver medals in the satisfiable random category in the SAT 2007 competition, respectively, are not.
Handling Polymorphism in Automated Deduction
Authors: Jean-François Couchot, Stéphane Lescuyer
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Polymorphism has become a common way of designing short and reusable programs by abstracting generic definitions from type-specific ones. Such a convenience is valuable in logic as well, because it unburdens the specifier from writing redundant declarations of logical symbols. However, top shelf automated theorem provers such as Simplify, Yices or other SMT-LIB ones do not handle polymorphism. To this end, we present efficient reductions of polymorphism in both unsorted and many-sorted first order logics. For each encoding, we show that the formulas and their encoded counterparts are logically equivalent in the context of automated theorem proving. The efficiency keynote is to disturb the prover as little as possible, especially the internal decision procedures used for special sorts, e.g. integer linear arithmetic, to which we apply a special treatment. The corresponding implementations are presented in the framework of the Why/Caduceus toolkit.
Document Signature Using Intrinsic Features for Counterfeit Detection
Authors: Joost Beusekom, Faisal Shafait, Thomas M. Breuel
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

Document security does not only play an important role in specific domains e.g. passports, checks and degrees but also in every day documents e.g. bills and vouchers. Using special high-security features for this class of documents is not feasible due to the cost and the complexity of these methods. We present an approach for detecting falsified documents using a document signature obtained from its intrinsic features: bounding boxes of connected components are used as a signature. Using the model signature learned from a set of original bills, our approach can identify documents whose signature significantly differs from the model signature. Our approach uses globally optimal document alignment to build a model signature that can be used to compute the probability of a new document being an original one. Preliminary evaluation shows that the method is able to reliably detect faked documents.
Information security across disciplines
Authors: Gabriele H. Meiselwitz
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

This paper describes a general education course in information security targeting all majors. A steady increase in security incidents in work and personal computing environments requires a trained workforce to respond to these incidents. In addition to educating computer professionals, undergraduate students of all disciplines should have the opportunity to be exposed to issues regarding computer security and forensics. This course addresses the understanding of information security across the disciplines, and has the goal to provide students with basic skills for identification of, prevention of, and response to security incidents. Students in the course completed a questionnaire assessing their security knowledge and skills in the beginning and at the end of the course. The paper concludes with a summary of data collected over three semesters.
A New Word Clustering Method for Building N-Gram Language Models in Continuous Speech Recognition Systems
Authors: Mohammad Bahrani, Hossein Sameti, Nazila Hafezi, Saeedeh Momtazi
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper a new method for automatic word clustering is presented. We used this method for building n-gram language models for Persian continuous speech recognition (CSR) systems. In this method, each word is specified by a feature vector that represents the statistics of parts of speech (POS) of that word. The feature vectors are clustered by k-means algorithm. Using this method causes a reduction in time complexity which is a defect in other automatic clustering methods. Also, the problem of high perplexity in manual clustering methods is abated. The experimental results are based on "Persian Text Corpus" which contains about 9 million words. The extracted language models are evaluated by the perplexity criterion and the results show that a considerable reduction in perplexity has been achieved. Also reduction in word error rate of CSR system is about 16% compared with a manual clustering method.
Workshop on Computational Finance and Business Intelligence
Authors: Yong Shi, Shouyang Wang, Xiaotie Deng
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The workshop focus on computational science aspects of asset/derivatives pricing financial risk management that relate to business intelligence. It will include but not limited to modeling, numeric computation, algorithmic and complexity issues in arbitrage, asset pricing, future and option pricing, risk management, credit assessment, interest rate determination, insurance, foreign exchange rate forecasting, online auction, cooperative game theory, general equilibrium, information pricing, network band witch pricing, rational expectation, repeated games, etc.
Web Service Call Parallelization Using OpenMP
Authors: Sébastien Salva, Clément Delamare, Cédric Bastoul
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

Since early works, web servers have been designed as parallel applications to process many requests at the same time. While web service based applications are performing more and more, larger and larger transactions, this parallelization culture still not reached the client side. Business to Business (B2B) applications are becoming intensive users of web transactions through Service Oriented Architecture Standard. As multicore systems are now widely available, parallelization seems the right way to fit the need of such applications. In this paper, we describe an API based on OpenMP for transparently parallelizing web service calls, i.e. the serialization, deserialization and connection processes. Our API is mainly based on a software pipeline which splits web service calls into several tasks. Both synchronous and asynchronous modes can be used with this API to call web services. We present experimental evidence demonstrating the ability of our API to achieve high level performance.
2008 Special Issue: FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization
Authors: Giuliano Grossi, Federico Pedersini
Venue: Neural Networks (2008)

In this paper a FPGA implementation of a novel neural stochastic model for solving constrained NP-hard problems is proposed and developed. The model exploits pseudo-Boolean functions both to express the constraints and to define the cost function, interpreted as energy of a neural network. A wide variety of NP-hard problems falls in the class of problems that can be solved by this model, particularly those having a quadratic pseudo-Boolean penalty function. The proposed hardware implementation provides high computation speed by exploiting parallelism, as the neuron update and the constraint violation check can be performed in parallel over the whole network. The neural system has been tested on random and benchmark graphs, showing good performance with respect to the same heuristic for the same problems. Furthermore, the computational speed of the FPGA implementation has been measured and compared to software implementation. The developed architecture featured dramatically faster computation, with respect to the software implementation, even adopting a low-cost FPGA chip.
Nonlinear Pattern Identification by Multi-layered GMDH-Type Neural Network Self-selecting Optimum Neural Network Architecture
Authors: Tadashi Kondo
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

A revised Group Method of Data Handling (GMDH)-type neural network is applied to the nonlinear pattern identification. The GMDH-type neural network has both characteristics of the GMDH and the conventional multilayered neural network trained by the back propagation algorithm and can automatically organize the optimum neural network architecture using the heuristic self-organization method. In the GMDH-type neural network, many types of neurons described by such functions as the sigmoid function, the radial basis function, the high order polynomial and the linear function, can be used to organize neural network architecture and neuron characteristics, which fit the complexity of the nonlinear system, are automatically selected so as to minimize the error criterion defined as Akaike's Information Criterion (AIC) or Prediction Sum of Squares (PSS). In this paper, the revised GMDH-type neural network is applied to the identification of the nonlinear pattern, showing that it is a useful method for this process.
Information management of MPs: Experiences from Austria, Denmark and the Netherlands
Authors: Peter Filzmaier, Kathrin Stainer-Hämmerle, Ignace Snellen
Venue: Information Polity (2004)

The intensity and quality of political dialogue by representatives and voters is influenced above all by the way in which representatives use the Internet. The article analyses and compares the information management of MPs of the Austrian Nationalrat, the Danish Folketing, and the Dutch Staten Generaal referring to modes of utilization (frequency, main purposes, content of mails etc.) of the Internet as well as to its importance for political communication. From the information collected the following conclusions can be drawn: - Internet use by MPs has been limited to date because of a relative lack of knowledge of the technology and the potential of the new media. - The flow of information between representatives as political elites and the public will not necessarily be improved and/or personalized through the Internet. - A permanent contact between MPs and their constituency as a form of political participation for the electorate and/or for party members depends especially on the Internet strategies of parties in parliament. Only if parties choose a "bottom-up" or grass root strategy will new technologies be used as more than just tools for internal communication within the party network.
Web Services Security: Techniques and Challenges (Extended Abstract)
Authors: Anoop Singhal
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Web services-based computing is currently an important driver for the software industry. While several standards bodies (such as W3C and OASIS) are laying the foundation for Web services security, several research problems must be solved to make secure Web services a reality. This talk will present techniques for Web services security and some of the challenges and recommendations for secure web services. This paper is based on our experience in developing the National Institute of Standards and Technology (NIST) Special Publication SP 800-95, "Guide to Secure Web Services". Some of the challenges for secure web services are1End to End Quality of Service and Protection1Availability of Service1Protection from Command Injection Attacks1Identity ManagementTo adequately support the needs of Web services-based applications, effective risk management and appropriate deployment of alternate countermeasures are essential. Defense-in-depth through security engineering, secure software development, and architecture risk analysis can provide the robustness and reliability required by these applications.
Computing Differential Invariants of Hybrid Systems as Fixedpoints
Authors: André Platzer, Edmund M. Clarke
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We introduce a fixedpoint algorithm for verifying safety properties of hybrid systems with differential equations whose right-hand sides are polynomials in the state variables. In order to verify nontrivial systems without solving their differential equations and without numerical errors, we use a continuous generalization of induction, for which our algorithm computes the required differential invariants. As a means for combining local differential invariants into global system invariants in a sound way, our fixedpoint algorithm works with a compositional verification logic for hybrid systems. To improve the verification power, we further introduce a saturation procedure that refines the system dynamics successively with differential invariants until safety becomes provable. By complementing our symbolic verification algorithm with a robust version of numerical falsification, we obtain a fast and sound verification procedure. We verify roundabout maneuvers in air traffic management and collision avoidance in train control.
Numerical Study of Cross Diffusion Effects on Double Diffusive Convection with Lattice Boltzmann Method
Authors: Xiaomei Yu, Zhaoli Guo, Baochang Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

A lattice Boltzmann model is proposed to asses the impact of variable molecular transport effects on the heat and mass transfer in a horizontal shallow cavity due to natural convection. The formulation includes a generalized form of the Soret and Dufour mass and heat diffusion (cross diffusion) vectors derived from non-equilibrium thermodynamics and fluctuation theory. Both the individual cross diffusion effect and combined effects on transport phenomena are considered. Results from numerical simulations indicate that Soret mass flux and Dufour energy flux have appreciable effect and sometimes are significant. At the same time, the lattice Boltzmann model has been proved to be adequate to describe higher order effects on energy and mass transfer.
Efficient solution for frequency band decomposition problem using wavelet packet in HRV
Authors: Suleyman Bilgin, Omer H. Çolak, Etem Koklukaya, Niyazi Arı
Venue: Digital Signal Processing (2008)

Heart rate variability (HRV) is a very significant noninvasive tool for assessment of sympathovagal balance (SB) that reflects variation of parasympathetic and sympathetic activities in autonomic nervous system (ANS). Low frequency/high frequency (LF/HF) power ratio provides information about these activities. Because of nonstationary characteristic of HRV, analyses based on wavelet transform were typically preferred in previous studies. There is an important problem that required frequency ranges for LF and HF cannot be obtained using discrete wavelet transform (DWT). Different sampling frequencies do not remove this problem. In this study, a solution based on wavelet packet (WP) is presented for removing this problem. In addition, effect of WP on SB values is investigated. Method was applied to spontaneous ventricular tachyarrhythmia database and variation of energy values and LF/HF energy ratios were compared for DWT and WP. WP provides absolutely excellent approximation to required frequency bands and exposes different and impressive SB results.
Belief Flow in Assertion Networks
Authors: Sujata Ghosh, Benedikt Löwe, Erik Scorelle
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We define an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth together with the Assertion Network Toolkit, a graphical interface designed to test our semantics.
In vivo and in situ cellular image processing and characterization: challenges and solutions
Authors: Lin Feng, Seah Hock Soon, Qian Kemao, Cheong Lee Sing
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

We study the feasibility of 3D virtual histology through in vivo and in situ cellular imaging. A prototype system has been developed based on photodynamic fluorescence signals, confocal endomicroscopy, and FPGA image processing and characterization computing. Experiments in its clinical applications have been conducted, mainly for diagnosis of early-stage mucous cancer. With the fine-grained parallel imaging programs mapped on the FPGA, a stream of focused optical sections of microstructures in the subsurface layers up to 300µm in depth, can be processed online and the extracted features can be visualized seamlessly with the endomicroscopy settings.