ppxscal/embedding_network huggingface dataset:
Profitability Prediction Model Based on Support Vector Machines
Authors: Ping Zhong, Yong Cen, Bin Xi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Classification techniques which hold a very important place in business and economic research have drawn many research interests in previous literatures. Recent studies have shown that machine learning techniques can achieve better performance. However, the application of support vector machines (SVM) for profitability prediction has not been widely explored. This study investigates the efficacy of applying SVM in profitability prediction problem and attempts to suggest a new model with better explanatory power and stability. The experimental results demonstrate that the proposed classifier of SVM approach to the problem of profitability prediction of companies upon the basis of a set of financial ratios.
Response modeling with support vector regression
Authors: Dongil Kim, Hyoung-joo Lee, Sungzoon Cho
Venue: Expert Systems with Applications: An International Journal (2008)

Response modeling has become a key factor to direct marketing. In general, there are two stages in response modeling. The first stage is to identify respondents from a customer database while the second stage is to estimate purchase amounts of the respondents. This paper focuses on the second stage where a regression, not a classification, problem is solved. Recently, several non-linear models based on machine learning such as support vector machines (SVM) have been applied to response modeling. However, there is a major difficulty. A typical training dataset for response modeling is so large that modeling takes very long, or, even worse, modeling may be impossible. Therefore, sampling methods have been usually employed in practice. However a sampled dataset usually leads to lower accuracy. In this paper, we employed an @e-tube based sampling for support vector regression (SVR) which leads to better accuracy than the random sampling method.
Proving Consistency of Database Transactions Written in Extended Pascal
Authors: G. Gardarin
Venue: IEEE Transactions on Software Engineering (1982)

The purpose of this correspondence is to present an approach for verifying that explicitly stated integrity constraints are not violated by certain transactions. We utilize a relational model wherein constraints are given in a language based on the first-order predicate calculus. Transactions are written in terms of a Pascal-like host language with embedded first-order predicate calculus capabilities allowing queries and updates.
An Experiment in Small-Scale Application Software Engineering
Authors: B. W. Boehm
Venue: IEEE Transactions on Software Engineering (1981)

This paper reports the results of an experiment in applying large-scale software engineering procedures to small software projects. Two USC student teams developed a small, interactive application software product to the same specification, one using Fortran and one using Pascal. Several hypotheses were tested, and extensive experimenal data collected. The major conclusions were as follows.
PROXIMO—a new docking algorithm to model protein complexes using data from radical probe mass spectrometry (RP-MS)
Authors: Sebastien K. Gerega, Kevin M. Downard
Venue: Bioinformatics (2006)

The design and implementation of a new algorithm, known as PROXIMO for protein oxidation interface modeller, is described to predict the structure of protein complexes using data generated in radical probe mass spectrometry (RP-MS) experiments. Photochemical radiolysis and discharge sources can be used to effect RP-MS in which hydroxyl radicals are formed directly from the bulk solvent on millisecond timescales and react with surface accessible residues in footprinting-like experiments. The algorithm utilizes a geometric surface fitting routine to predict likely structures for protein complexes. These structures are scored based on a correlation between the measured solvent accessibility of oxidizable residue side chains and oxidation shielding data obtained by RP-MS. The algorithm has been implemented to predict structures for the ribonuclease S-protein–peptide and calmodulin–melittin complexes using RP-MS data generated in this laboratory. The former is in close agreement with the high-resolution experimental structure available. Contact: kdownard@usyd.edu.au
Zebra striping: does it really help?
Authors: Jessica Enders
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

'Zebra striping' -- also known as half shadow -- is the application of a faint shadow to alternate lines or rows in data tables or forms to aid readability. Zebra striping has been in use on paper and in electronic mediums for almost half a century, however, there is practically no evidence that it actually assist users. We conducted an online experiment to measure the impact of zebra striping on accuracy and speed when answering a series of questions using a table of data. Surprisingly, zebra striping did not consistently deliver gains in either measure.
Point-by-Point Generation Algorithm for B-spline Curves in Two-Photon Fabrication
Authors: Jin Jin Zheng, Xp Wang, Hj Zhou, Wh Huang, Lg Shen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In a two-photon femto-second laser system of three- dimensional micro-fabrication, a model of micro-device is fabricated layer by layer. For each layer, it is fabricated point by point along its contours of cross-sections. So it is necessary to generate process points one by one along the contours. In this paper, the contours of cross section of a model are supposed to be B-spline curves. An efficient algorithm is presented to generate process points for B spline curve. In the proposed algorithm, the parametric increment is adjusted based on the estimation bounds of second derivative.
Personalizing access to learning networks
Authors: Peter Dolog, Bernd Simon, Wolfgang Nejdl, Tomaž Klobučar
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

In this article, we describe a Smart Space for Learning&trade; (SS4L) framework and infrastructure that enables personalized access to distributed heterogeneous knowledge repositories. Helping a learner to choose an appropriate learning resource or activity is a key problem which we address in this framework, enabling personalized access to federated learning repositories with a vast number of learning offers. Our infrastructure includes personalization strategies both at the query and the query results level. Query rewriting is based on learning and language preferences; rule-based and ranking-based personalization improves these results further. Rule-based reasoning techniques are supported by formal ontologies we have developed based on standard information models for learning domains; ranking-based recommendations are supported through ensuring minimal sets of predicates appearing in query results. Our evaluation studies show that the implemented solution enables learners to find relevant learning resources in a distributed environment and through goal-based personalization improves relevancy of results.
Wavelet monitoring of spatial surface roughness for plasma diagnosis
Authors: Byungwhan Kim, Woo Suk Kim
Venue: Microelectronic Engineering (2007)

To maintain device yield, plasma status should be stringently monitored. In this study, a new monitoring method for plasma diagnosis is presented. The method was based on a wavelet detection of surface roughness measured by atomic force microscopy. The wavelet enabled us to analyze spatial variations of surface roughness in vertical, lateral, and diagonal components. The sensitivity of spatial variation was examined in terms of a ratio pattern for the variations in process parameters. The ratio patterns were defined by the numerical values characterizing wavelet-decomposed images. The method was applied to the etching of a silicon oxynitride film in a C"2F"6 inductively coupled plasma. The process parameters involved include radiofrequency source power, bias power, pressure, and C"2F"6 flow rate. Applicability of this method was evaluated without or with respect to a fixed reference condition. In the case of a non-reference condition, a particular ratio for the diagonal component demonstrated the highest sensitivity to the variations in all parameters, but C"2F"6 flow rate. It is also noticeable that this ratio showed a strong correlation with actual surface roughness measurements. Meanwhile, in the case of one fixed reference, all ratio sensitivities were much higher than those for actual measurements for each component. A particular ratio for the lateral component yielded the highest sensitivity compared to other components. The proven high sensitivity indicates that the presented method can be effectively used for monitoring plasma conditions.
Formal correctness of conflict detection for firewalls
Authors: Venanzio Capretta, Bernard Stepien, Amy Felty, Stan Matwin
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a firewall access rule and of an access request to a firewall. Formally, two rules are in conflict if there exists a request on which one rule would allow access and the other would deny it. We express our algorithm in Coq, and prove that it finds all conflicts in a set of rules. We obtain an OCaml version of the algorithm by direct program extraction. The extracted program has successfully been applied to firewall specifications with over 200,000 rules.
Optimum Finite Impulse Response Digital Filter Design Using Computational Intelligence Based Optimization Algorithms
Authors: Flavio Teixeira, Alexandre Romariz
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we use computational intelligence numer- ical optimization techniques to design optimum non-linear phase finite impulse response digital filters. The filter mag- nitude and group delay approximation will be presented as a classical approximation problem, where a non-linear function of several variables must be minimized. Results will be presented and compared with three different numer- ical optimization techniques developed, including Genetic algorithms, Simulated Annealing and Particle Swarm Opti- mization. Additionally, results are compared with a current used design technique, an unconstrained quasi-Newton al- gorithm.
An examination of private intermediaries' roles in software vulnerabilities disclosure
Authors: Pu Li, H. Raghav Rao
Venue: Information Systems Frontiers (2007)

Software vulnerability disclosure has generated much interest and debate. Recently some private intermediaries have entered this market. This paper examines the effects of such private intermediaries on optimal timing of disclosure policy made by public intermediaries and vendors' reactions. Our analysis of private intermediaries' role suggests that public intermediary's optimal disclosure time does not change with private intermediary's participation. However, a vendor's patch time increases when the probability of information leakage is low, if not non-existent. In other words, private intermediaries' service decreases a vendor's willingness to deliver quick patches. Empirical evidence with 1493 vulnerability observations from CERT/CC and other 326 different vulnerability observations from iDefense provided support for our analytical results.
Multifold node authentication in mobile ad hoc networks
Authors: Nikos Komninos, Dimitrios D. Vergados, Christos Douligeris
Venue: International Journal of Communication Systems (2007)

An ad hoc network is a collection of nodes that do not need to rely on a predefined infrastructure to keep the network connected. Nodes communicate amongst each other using wireless radios and operate by following a peer-to-peer network model. In this article, we propose a multifold node authentication approach for protecting mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using multiple authentication protocols are analysed. Such protocols, which are based on zero-knowledge and challenge-response techniques, are presented through proofs and simulation results. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Evolutional concept learning from observations through adaptive feature selection and GA-based feature discovery
Authors: Tetsuo Sawaragi, Naoki Tani, Osamu Katai
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

This paper presents a method for concept formation of a personal learning apprentice (PLA) system that attempts to capture users' internal conceptual structure by observing interactions between user and system. The primary goal of a PLA system is to identify the users' cognition that underlies the taking of action. This is based on the capability to reconstruct internal concepts as behavior-shaping constraints by observing operations as well as the information presented by the system. Our proposed algorithm comprises two processes&semi; adaptive feature selection and GA-based feature discovery. The former selects the essential attributes out of a provided set of attributes that may initially be either relevant or irrelevant, and the latter constructs new attributes using genetic algorithms applied to a set of elementary features logically represented in a disjunctive normal form. Our method can be applied to artificial data as well as to a data set obtained from human-machine interactions observed during operation of a simulator of a generic dynamic production process.
You're Not Paranoid; They Really Are Watching You!
Authors: Roy Want
Venue: IEEE Pervasive Computing (2007)

Ensuring both pervasive security and ease of use is a challenge for our research community. Pervasive privacy will be even more difficult to achieve.
Scientific Application Acceleration with Reconfigurable Functional Units
Authors: Kyle Rupnow, Keith Underwood, Katherine Compton
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

While scientific applications in the past were limited by floating point computations, modern scientific applications use more unstructured formulations. These applications have a significant percentage of integer computation--increasingly a limiting factor in scientific application performance. In real scientific applications employed at Sandia National Labs, integer computations constitute on average 37% of the application operations, forming large and complex dataflow graphs. Reconfigurable Functional Units (RFUs) are a particularly attractive accelerator for these graphs because they can potentially accelerate many unique graphs with a small amount of additional hardware. In this study, we analyze application traces of Sandia's scientific applications and the SPEC-FP benchmark suite. First we select a set of dataflow graphs to accelerate using the RFU, then we use execution-based simulation to determine the acceleration potential of the applications when using an RFU. On average, a set of 32 or fewer graphs is sufficient to capture the dataflow behavior of 30% of the integer computation, and more than half of Sandia applications show an improvement of 5% or more.
Automata with finite congruence lattices
Authors: István Babcsányi
Venue: Acta Cybernetica (2007)

In this paper we prove that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is finite. Moreover, if A is commutative then A is A-finite. We prove that if 3 ≤ |A| then a commutative automaton A is simple if and only if it is a cyclic permutation automaton of prime order. We also give some results concerning cyclic, strongly connected and strongly trap-connected automata.
Silver Bullet Talks with Annie Antón
Authors: Gary McGraw
Venue: IEEE Security and Privacy (2007)

Gary McGraw interviews Annie Antón.
Special Feature Extending Register-Transfer Technology to Teach Computer Architecture
Authors: J. B. Gosling
Venue: Computer (1978)

The modern approach in teaching computer architecture is to describe the computing machine in terms of its major units (store, processor, etc.) and then to describe each of these units in progressively greater detail. This contrasts with the earlier approach in which individual gating circuits were described, and later developed into larger units. The older approach lends itself well to laboratory work in which a few components or circuits may be assembled and tested in a short time. The cost of this is small, and a whole class of students may perform a useful exercise with relatively small overhead. In contrast, the modern approach requires the student to design and/or modify a complete computer structure from relatively large units. Providing sufficient equipment to support this approach is too expensive to contemplate.
PDF: A Public-key based False Data Filtering Scheme in Sensor Networks
Authors: Haodong Wang, Qun Li
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Given the extremely limited hardware resources on sensor nodes and the inclement deploying environment, the adversary Denial-of-Service (DoS) attack becomes a serious security threat toward wireless sensor networks. Without adequate defense mechanism, the adversary can simply inundate the network by flooding the bogus data packets, and paralyze the partial or whole sensor network by depleting node battery power. Prior work on false packet filtering in sensor networks are mostly based on symmetric key schemes, with the concern that the public key operations are too expensive for the resource constrained sensors. Recent progress in public key implementations on sensors, however, has shown that public key is already feasible for sensors. In this paper, we present PDF, a Public-key based false Data Filtering scheme that leverages Shamir's threshold cryptography and Elliptic Curve Cryptography (ECC), and effectively rejects 100% of false data packets. We evaluate PDF by real world implementation on MICAz motes. Our experiment results support the conclusion that PDF is practical for real world sensor deployment.
Usability Evaluation of a System for Implementation of Visual Languages
Authors: Carsten Schmidt, Bastian Cramer, Uwe Kastens
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

The implementation of visual languages requires a wide range of conceptual and technical knowledge. The DEViL system generates complete language implementations from high level specifications. To be applicable in real-world scenarios, the specification mechanism as well as the generated language implementations must satisfy high usability standards. In this paper, we present a systematic evaluation of the most important usability aspects of the DEViL system. We cover both, the usability of the generator and the usability of the generated products. We demonstrate that the specification mechanism has good usability characteristics on both levels. We consider this evaluation process to be applicable to similar systems as well, and thus allows the improvement of a generator system.
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
Authors: Hsiao-Fei Liu, Kun-Mao Chao
Venue: Theoretical Computer Science (2007)

Katriel and Bodlaender [Irit Katriel, Hans L. Bodlaender, Online topological ordering, ACM Transactions on Algorithms 2 (3) (2006) 364-379] modify the algorithm proposed by Alpern et al. [Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck, Incremental evaluation of computational circuits, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 32-42] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove that their algorithm runs in O(min{m^3^/^2logn,m^3^/^2+n^2logn}) time and has an @W(m^3^/^2) lower bound. In this paper, we give a tight analysis of their algorithm by showing that it runs in time @Q(m^3^/^2+mn^1^/^2logn).
The activities of László Kalmár in the world of information technology
Authors: Árpád Makay
Venue: Acta Cybernetica (2007)

Since the end of the 1950s László Kalmár has been interested in the information technology. During a 20 years period he designed several variants of computers interpreting high-level programming languages on architectural levels.
An Enhanced Buffer Management Scheme for Multimedia Traffic in HSDPA
Authors: Suleiman Y. Yerima, Khalid Al-Begain
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

High Speed Downlink Packet Access (HSDPA) enables higher data rate packet switch services over UMTS, creating opportunity to provide a variety of broadband multimedia applications. In HSDPA, buffering of downlink data in the base station (Node B) is required to fulfill the Medium Access Control (MAC) Packet Scheduling functionality. Additionally, flow control over the Iub interface that connects the Node B to the Radio Network Controller (RNC) is standardized in the 3GPP HSDPA technical specifications. Thus, buffer queue management schemes can be conveniently applied to improve downlink traffic QoS performance in HSDPA. Our previous work focused on a novel priority queuing scheme shown to be effective for QoS management of multimedia traffic with concurrent diverse flows towards a HSDPA end user. This paper presents an enhanced scheme that incorporates Iub flow control. A dynamic HSDPA simulator is developed to study the extended scheme, demonstrating the performance improvement achievable.
Proceedings of the 2007 workshop on Networked systems for developing regions
Venue: Applications, Technologies, Architectures, and Protocols for Computer Communication (2007)

Welcome to the ACM SIGCOMM Workshop on Networked Systems for Developing Regions (NSDR'07). Today, it is evident that the benefits of the Internet and communication technologies are limited to a fraction of the world's population; according to the Internet World Stats 2007, Internet penetration in North America is 69.7% of population compared to 3.6% for Africa and 10.7% for Asia. We believe that technologies developed for the western world have been a poor fit in developing regions and even though technology can play a large role in developing regions, there is a need for technology research specifically aimed at these areas. To help foster research aimed at problems in developing regions we organized the NSDR workshop. One of the main motivations behind organizing the NSDR workshop was the lack of available venues for disseminating ideas and results related to developing regions research. The goal of NSDR is to provide a venue for researchers to propose and discuss ideas and to participate in the sustainable development and deployment of Internet and communication technologies for developing countries. The great and diverse needs of developing regions (economic problems, social issues) call for a multi-disciplinary research agenda. However, the focus of NSDR is on communication and networking aspects of developing regions research. For the inaugural workshop, we decided to host NSDR with Sigcomm'07 as Sigcomm was coming to Asia for the first time in history. We saw this as a perfect opportunity to bring topics of special interest to developing regions to the attention of the Sigcomm community. Despite being the first workshop of its kind at Sigcomm, we received 40 papers from 15 different countries. The submitted papers underwent a rigorous review process where each paper received 3 reviews with at least 2 reviews coming from the TPC.