ppxscal/embedding_network huggingface dataset:
Augmenting Naive Bayes Classifiers with Statistical Language Models
Authors: Fuchun Peng, Dale Schuurmans, Shaojun Wang
Venue: Information Retrieval (2004)

We augment naive Bayes models with statistical n-gram language models to address short-comings of the standard naive Bayes text classifier. The result is a generalized naive Bayes classifier which allows for a local Markov dependence among observations&semi; a model we refer to as the Chain Augmented Naive Bayes (CAN) Bayes classifier. CAN models have two advantages over standard naive Bayes classifiers. First, they relax some of the independence assumptions of naive Bayes&mdash;allowing a local Markov chain dependence in the observed variables&mdash;while still permitting efficient inference and learning. Second, they permit straightforward application of sophisticated smoothing techniques from statistical language modeling, which allows one to obtain better parameter estimates than the standard Laplace smoothing used in naive Bayes classification. In this paper, we introduce CAN models and apply them to various text classification problems. To demonstrate the language independent and task independent nature of these classifiers, we present experimental results on several text classification problems&mdash;authorship attribution, text genre classification, and topic detection&mdash;in several languages&mdash;Greek, English, Japanese and Chinese. We then systematically study the key factors in the CAN model that can influence the classification performance, and analyze the strengths and weaknesses of the model.
Processor Acceleration Through Automated Instruction Set Customization
Authors: Nathan Clark, Hongtao Zhong, Scott Mahlke
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Application-specific extensions to the computational capabilities of a processor provide an efficient mechanism to meetthe growing performance and power demands of embeddedapplications. Hardware, in the form of new function units(or co-processors), and the corresponding instructions, areadded to a baseline processor to meet the critical computational demands of a target application. The central challenge with this approach is the large degree of human effortrequired to identify and create the custom hardware units,as well as porting the application to the extended processor.In this paper, we present the design of a system to automate the instruction set customization process. A dataflowgraph design space exploration engine efficiently identifiesprofitable computation subgraphs from which to create custom hardware, without artificially constraining their sizeor shape. The system also contains a compiler subgraphmatching framework that identifies opportunities to exploitand generalize the hardware to support more computationgraphs. We demonstrate the effectiveness of this systemacross a range of application domains and study the applicability of the custom hardware across the domain.
Semantics of linear&#x002F;modal lambda calculus
Authors: Martin Hofmann
Venue: Journal of Functional Programming (1999)

This paper was guest-edited by Harry Mairson and Bruce Kapron, for our intended Special Issue on Functional Programming and Computational Complexity. Other papers submitted for the special issue were either out-of-scope or otherwise unsuitable for JFP. Even though only one paper met their high standards, this did not make Harry and Bruce's job any easier, and we thank them for their efforts.In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of Bellantoni&ndash;Cook's function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. While this previous work was concerned with the syntactic metatheory of SLR in this paper we develop a semantics of SLR in terms of Chu spaces over a certain category of sheaves from which it follows that all expressible functions are indeed in PTIME. We notice a similarity between the Chu space interpretation and CPS translation which as we hope will have further applications in functional programming.
Privacy and computer data banks
Authors: Norman Liedtke
Venue: ACM SIGCAS Computers and Society (1978)

The right to privacy is becoming one of the key issues of our times. The single biggest threat to individual privacy is the "computer data bank". It has only been since the mid-sixties that personal privacy and the computer data bank have collided. Furthermore, it has only been since the early seventies that legislation has begun to react to the expanding infringement on privacy. Even today many people are not accurately informed on the issue.My main thesis is, "people are generally aware of infringement on their privacy but feel helpless to stop it". Secondly, I wanted to discover if, "people would be willing to take limited action to protect their privacy if they were presented with a method". This is my supporting hypothesis. I combined field work, through questionnaire, with library research.This paper is divided into three parts. First I will give a relatively brief background on the privacy issue. Then I will discuss the information and work surrounding my field study. Finally, I will give my conclusions and recommendations for the future.
On Accelerated Random Search
Authors: M. J. Appel, R. LaBarre, D. Radulovic
Venue: SIAM Journal on Optimization (2003)

A new variant of pure random search (PRS) for function optimization is introduced. The basic finite-descent accelerated random search (ARS) algorithm is simple: the search is confined to shrinking neighborhoods of a previous record-generating value, with the search neighborhood reinitialized to the entire space when a new record is found. Local maxima are avoided by including an automatic restart feature which reinitializes the search neighborhood after some number of shrink steps have been performed.One goal of this article is to provide rigorous mathematical comparisons of ARS to PRS. It is shown that the sequence produced by the ARS process converges, with probability one, to the maximum of a continuous objective function faster than that of the PRS process by adjustably large multiples of the time step (Theorem). Regarding an infinite-descent (no automatic restart) version of ARS, it is shown that if the objective function satisfies a local nonflatness condition, then the right tails of the distributions of inter-record times are exponentially smaller than those of PRS (Theorem).Performance comparisons between ARS, PRS, and three quasi-Newton-type optimization routines are reported in attempting to find extrema of (i) each of a small collection of standard test functions of two variables, and (ii) d-dimensional polynomials with random roots. Also reported is a three-way performance comparison between ARS, PRS, and a simulated annealing algorithm in attempting to solve traveling salesman problems.
An approach to formal verication of real time concurrent Ada programs
Authors: Douglas J. Howe, Stephen Michell
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

The SPARK system provides static analysis tools for a highly restricted sequential Ada subset, including a proof checking tool for verifying partial correctness properties. Recently, SPARK Ada has been extended to include much of the Ravenscar Tasking Pro le which supports construction of high integrity real time systems. However, the veri cation machinery has not been changed, and can only handle purely sequential properties of the code. This paper sketches an approach to reasoning about the concurrent and real-time aspects that SPARK cannot handle. The approach involves compiling an abstract model of the Ada program that can be embedded in a general purpose theorem prover (e.g. PVS). The compilation makes heavy use of SPARK's existing static analysis tools.
User Experience with Agent99 Trainer: A Usability Study
Authors: Jinwei Cao, Janna M. Crews, Jay F. Nunamaker,  Jr., Judee K. Burgoon, Ming Lin
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Usability is a critical measure of a system's success. This study focuses on evaluating the usability of Agent99 Trainer, a Web-based multimedia training system for deception detection training. Common measures and evaluation methods for system usability are reviewed. After briefly introducing the design of Agent99 Trainer, this paper focuses on presenting the evaluation methods used in the study and the results. Both quantitative and qualitative data were collected using questionnaires for testing the following system usability attributes: learnability, usefulness, ease of use, effectiveness, and user satisfaction. The results of this evaluation indicate that Agent99 Trainer is a well-designed system with good usability. Several features that make Agent99 Trainer a useful and valuable tool are discussed, and lessons learned from this evaluation for future system improvement are summarized.
A Neural Network-Based Blind Multiuser Receiver for DS-CDMA Communication Systems
Authors: Romano Fantacci, Leonardo Mancini, Mauro Marini, Daniele Tarchi
Venue: Wireless Personal Communications: An International Journal (2003)

The Universal Mobile Telecommunications System (UMTS) which is based on Wideband-Code Division Multiple Access (W-CDMA) techniques is one of the most important broadband wireless communication systems. Adaptive Blind Multiuser Detection was widely considered for mobile receivers. The main drawback of this approach is that it achieves the optimum solution after a certain number of bit times. This paper deals with a new neural network approach in order to reduce the convergence time in different application environments. In particular, a modified Kennedy-Chua neural network, based on the Hopfield model is proposed. The neural network stability was investigated by means of a suitable analytical approach, while the performance of the proposed receiver scheme was derived by means of computer simulations. The numerical results shown in this paper highlight a fast convergence behavior of the proposed scheme, in particular under multipath-fading conditions.
A SystemC-Based Verification Methodology for Complex Wireless Software IP
Authors: Guido Post, P. K. Venkataraghavan, Tapan Ray, D. R. Seetharaman
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The implementation of a complex hardware Intellectual Property (IP) together with complex lower-level software and the integration into a system platform poses tough challenges to the design and verification engineers. Traditionally, embedded software is developed and testedtowards the end of the development cycle because of late availability of lab prototype equipment and hardware IP. In this paper, a "software-centric" hardware/software implementation and verification methodology for a 3G WCDMA modem is presented, with emphasis on physical layer software design and early verification. The subsystem architecture of 3G hardware and software is presented along with design and verification steps carried out. A versatile SystemC-based test environment is described, which links test case modules producing the stimuli from protocol stack and hardware components to the L1 SW code, executed on a instruction set simulator.
Port wars
Authors: William Paul Fiefer
Venue: Ubiquity (2003)

In the not-too-distant-future, firewalls spark a battle over port regulation and ownership
Ground reducibility is EXPTIME-complete
Authors: Hubert Comon, Florent Jacquemard
Venue: Information and Computation (2003)

We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognisable tree languages. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR,t to a rewrite system R and a term t. This automaton is deterministic and accepts at least one term iff t is not ground reducible by R. The number of states of AR,t is O(2||R||×||t||) and the size of its constraints is polynomial in the size of R, t. Then we prove some new pumping lemmas, using a total ordering on the computations of the automaton. Thanks to these lemmas, we can show that emptiness for an automaton with disequality constraints can be decided in a time which is polynomial in the number of states and exponential in the size of the constraints. Altogether, we get a simply exponential time deterministic algorithm for ground reducibility decision.
Development through communicative action and information system design: a case study from South Africa
Authors: Elaine Byrne
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Many authors have recognised the importance of structure in shaping information system (IS) design and use. Structuration theory has been used in IS research and design to assist with the identification and understanding of the structures in which the IS is situated. From a critical theoretical perspective, focusing on the Habermas' theory of communicative action, a community based child health information system was designed and implemented in a municipality in rural South Africa. The structures which shaped and influenced the design of this IS (the restructured health services and social tradition) are explored and discussed. From this case study the implications of using IS design as a developmental tool are raised: namely the development of a shared understanding, the participation of key players and the agreement on joint action.
European air traffic flow management: porting a large application to GNU/linux
Authors: Gaetan Allaert, Dirk Craeynest, Philippe Waroquiers
Venue: Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies (2003)

Computer hardware evolves very quickly. To benefit from cheaper and more powerful systems, big applications have to be ported to new environments. The Ada language has been designed for portability, making such migrations easier. However, today's applications often complement their main implementation language by various extra technologies: shell scripts, direct usage of OS primitives, different programming languages to access some libraries e.g. for graphical user interfaces, etc. These technologies are not always standardized or as portable as Ada so it is important to have indications about the portability of the various languages, libraries and tools.ETFMS, the Enhanced Tactical Flow Management System, is a large Eurocontrol/CFMU application written mainly in Ada. This paper reports the findings of an exploratory port of ETFMS from HP-UX PA-RISC to GNU/Linux Intel. The performance figures obtained on both platforms are compared and several conclusions about portability are given.
Analyzing Architectural Evolution Issues of Multimedia Frameworks
Authors: M. Pinto, M. Amor, L. Fuentes, J. M. Troya
Venue: Multimedia Tools and Applications (2004)

The growing complexity in the development of Web-based services in general, and multimedia services in particular, makes necessary the application of sound development methods. New multimedia devices, coding algorithms, network protocols, etc., are continually appearing but, unfortunately, current solutions for developing multimedia applications do not accurately support architectural evolution issues for already deployed applications. Thus, the latest Software Engineering technologies should be applied to the development of open, reusable, and high-quality multimedia and Web-based software. In this paper, we apply component and framework technologies, two of the current trends in Software Engineering, to the development of multimedia services over the Web, presenting and comparing widespread solutions in use today.
Attribute value reordering for efficient hybrid OLAP
Authors: Owen Kaser, Daniel Lemire
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

The normalization of a data cube is the process of choosing an ordering for the attribute values, and the chosen ordering.Our optimized hybrid OLAP storage mechanism was observed to be 44% more storage efficient than ROLAP and the gains due to normalization alone accounted for 45% of this increase in efficiency.
Min-wise independent groups
Authors: C. Franchi, M. Vsemirnov
Venue: European Journal of Combinatorics (2003)

Let Ω be a finite set of cardinality n with a linear order on it and let k be a positive integer. Let F be a set of permutations on Ω and let PrF be an arbitrary distribution of probability on F The set F is said to be biased k-restricted min-wise independent if for every subset X of Ω such that |X| ≤ k, and every x ∈ X, when π is chosen at random in F, we have that PrF(min π(X) = π(x)) = /1|X|;. We study biased k-restricted min-wise independent groups. In particular, we prove that when k is close to n, then biased k-restricted min-wise independent groups are transitive.
Volume data compression using model-based quantization and three-dimensional zerotree encoding of wavelet coefficients
Authors: Michael Anthony Pratt,  Sr.
Venue:  (2003)

Volume data such as those acquired by magnetic resonance imaging (MRI) techniques can be compressed efficiently using wavelet transform-based methods. This approach uses a three-dimensional wavelet transform to reduce the spatial redundancies in the volume data. A model-based quantization scheme is used to quantize the wavelet coefficients. Unlike methods based on other transforms, wavelet compression methods need to retain both the value and the location of the significant coefficients. A three-dimensional zerotree encoding method is used to efficiently encode the quantized symbols. In addition to quantitative measures, an assessment is performed of the compression results using a volume visualization process.
SVM Based Models for Predicting Foreign Currency Exchange Rates
Authors: Joarder Kamruzzaman, Ruhul A. Sarker, Iftekhar Ahmad
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Support vector machine (SVM) has appeared as a powerfultool for forecasting forex market and demonstrated betterperformance over other methods, e.g., neural network orARIMA based model. SVM-based forecasting modelnecessitates the selection of appropriate kernel function andvalues of free parameters: regularization parameter and \varepsilon-insensitive loss function. In this paper, we investigate the effectof different kernel functions, namely, linear, polynomial, radialbasis and spline on prediction error measured by several widelyused performance metrics. The effect of regularizationparameter is also studied. The prediction of six different foreigncurrency exchange rates against Australian dollar has beenperformed and analyzed. Some interesting results are presented.
Satisfaction Attainment Theory as a Model for Value Creation
Authors: Robert O. Briggs, Sajda Qureshi, Bruce Reinig
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Organizations exist to create value for their stakeholders that stakeholders cannot create through individual effort. Information systems exist to increase an organization's ability to create value using intellectual capital. A theoretical explanation of value might therefore be useful to increase the likelihood that IS/IT professionals would design and deploy systems inways that increase value for stakeholders. This paper proposes Satisfaction Attainment Theory (SAT) as causal model of value creation. An organizational stakeholder is a person whose wellbeing might be advanced by an organization. Perceptions of value have reference to some object-of-value. The term, object, in the context of this paper, means anything to which one could ascribe value -- e.g. goods, services, states, or outcomes. SAT assumes that people hold multiple, conflicting goals, and so must sacrifice the yield of some goal to attain others. It posits that an individual automatically and subconsciously sets anexpectation for some level of utility from attaining a goal and assesses the likelihood that a goal will be attained. It also posits that individuals automatically and subconsciously assess yield the yield of a Set of Salient Goals (SSG). Any perceived Shift in the Yield Assessment (SYA) for the salient set of goals is automatically accompanied by an affective arousal proportional to and with a valence in the direction of the perceived SYA. SAT proposes that the value of an object is a positive function of the SYA that occurs when an individual contemplates sacrificing the yield of other goals to obtain the yield that could be derived from the object. Value is therefore created by making an individual aware of an opportunity to attain a positive SYA by sacrificing the yield of one set of goals to attain the yield of another set.
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
Authors: Lap Mui Ann Chan, Ana Muriel, Zuo-Jun Max Shen, David Simchi-Levi, Chung-Piaw Teo
Venue: Management Science (2002)

We analyze the problem faced by companies that rely on TL (Truckload) and LTL (Less than Truckload) carriers for the distribution of products across their supply chain. Our goal is to design simple inventory policies and transportation strategies to satisfy time varying demands over a finite horizon, while minimizing system wide cost by taking advantage of quantity discounts in the transportation cost structures. For this purpose, we study the cost effectiveness of restricting the inventory policies to the class of zero-inventory-ordering (ZIO) policies in a single-warehouse multiretailer scenario in which the warehouse serves as a cross-dock facility. In particular, we demonstrate that there exists a ZIO inventory policy whose total inventory and transportation cost is no more than 4/3 (5.6/4.6 if transportation costs are stationary) times the optimal cost. However, finding the best ZIO policy is an NP hard problem as well. Thus, we propose two algorithms to find an effective ZIO policy: An exact algorithm whose running time is polynomial for any fixed number of retailers, and a linear-programming-based heuristic whose effectiveness is demonstrated in a series of computational experiments. Finally, we extend the worst-case results developed in this paper to systems in which the warehouse does hold inventory.
Overload management in sensor-actuator networks used for spatially-distributed control systems
Authors: Michael Lemmon, Qiang Ling, Yashan Sun
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Overload management policies avoid network congestion by actively dropping packets. This paper studies the effect that such data dropouts have on the performance of spatially distributed control systems. We formally relate the spatially-distributed system's performance (as measured by the average output signal power) to the data dropout rate. This relationship is used to pose an optimization problem whose solution is a Markov chain characterizing a dropout process that maximizes control system performance subject to a specified lower bound on the dropout rate. We then use this Markov chain to formulate an overload management policy that enables nodes to enforce the "optimal" dropout process identified in our optimization problem. Simulation experiments are used to verify the paper's claims.