ppxscal/embedding_network huggingface dataset:
Efficient Computation of Algebraic Operations over Dynamically Reconfigurable Systems Specified by Rewriting-Logic Environments
Authors: M. Ayala-Rincón, R. B. Nogueira, C. Llanos, R. P. Jacobi, R. W. Hartenstein
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

Several algebraic operations can be efficiently implementedby arrays of functional units such as systolic arrays.Systolic arrays provide a large amount of parallelism.However, their applicability is restricted to a small set ofcomputational problems due to their lack of flexibility. Thislimitation can be circumvented by using reconfigurablesystolic arrays, where the node interconnections andoperations can be redefined even at run time. In thiscontext, several alternative systolic architectures can beexplored and powerful tools are needed to model andevaluate them. Well-Known rewriting-logic environmentssuch as ELAN and Maude can be used to specify, simulateand even synthesize complex application specific digitalsystems. In this paper we propose the use of rewriting-logicto model and evaluate reconfigurable systolic architectureswhich are applied to the efficient treatment of algebraicoperations such as matrix multiplication and the FFT.
Current and Emerging Requirements for Digital Rights Management Systems through Examination of Business Networks
Authors: Eetu Luoma, Hannu Vahtera
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Digital Rights Management (DRM) is an issue of controlling and managing digital rights over intellectual property. Current research on the DRM domain focuses on specifying requirements for management systems from variety of perspectives, however, mainly concentrating on protecting rights in business to consumer trade with certain mechanisms. This article takes a novel viewpoint in evaluating DRM issues from the perspective of networked business operations. In contrast to recent studies on DRM, the article evaluates the creation and delivery of content in along an asset creation-delivery continuum in terms of role specifications, content processes and management of digital rights over content, i.e. assets, in formations of firms. Our interest in this conceptual study is on the issues of networked businessmodels and, consequently, we contribute in defining and analyzing the complexities of such scenarios and from case scenario deriving emerging requirements for digital rights management in the introduced context. While simultaneously providing certain advantages toenterprises, the inter-organizational interdependencies in networked business model are prone to cause conflicts, thus, creating an increased need for control, contracting and coordination activities. We conclude that in order to build trust between various actors, multiple agreementsdescribing rights and obligations of operation and over assets needs to be negotiated and signed, thus, establishing a requirement for utilization of standardized digital rights expressions and efficient agreement creation and management.
Effects of Introducing Survival Behaviours into Automated Negotiators
Authors: Peter Henderson, Stephen Crouch, Robert John Walters, Qinglai Ni
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

With the rise of distributed e-commerce in recent years,demand for automated negotiation has increased. In turn,this has facilitated a demand for ever more complexalgorithms to conduct these negotiations. As thecomplexity of these algorithms increases, our ability toreason about and predict their behaviour in an ever largerand more diverse negotiation environment decreases. Inaddition, with the proliferation of internet-basednegotiation, any algorithm also has to contend withpotential reliability issues in the underlying message-passinginfrastructure. These factors can create problemsfor building these algorithms, which need to incorporatemethods for survival as well as negotiation.This paper proposes a simple yet effective frameworkfor integrating survivability into negotiators, so they arebetter able to withstand imperfections in theirenvironment. Results of an experiment are providedwhich show how the stability of a negotiation communityis affected by incorporating an example survivalbehaviour into negotiators operating in an environmentdeveloped to support this framework.
Foreword
Authors: Lars Birkedal, Giuseppe Rosolini, Dana S. Scott, Jaap Van Oosten
Venue: Mathematical Structures in Computer Science (2002)

This special issue of Mathematical Structures in Computer Science contains the final Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, which was held between June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference.
We claim this class for computer science: a non-mathematician's discrete structures course
Authors: Adrienne Decker, Phil Ventura
Venue: ACM SIGCSE Bulletin (2004)

We have recently launched a reorganized discrete structures course being taught in the computer science department for computer science majors. The main idea of the reorganization is to make the course relevant and productive for the computer science students. During the Spring of 2003, students who were taking both discrete structures and CS2 commented that taking both courses at the same time was helpful. An empirical investigation was conducted to see if there was a benefit to students taking both courses concurrently. The results show that there was a benefit to students taking both courses. The students who were taking both courses were performing better in discrete structures than those students who were not.
A novel packet-pair-based inferring bandwidth congestion control mechanism for layered multicast
Authors: Ren Liyong, Chen Bo, Wu Jing
Venue: ACM SIGOPS Operating Systems Review (2003)

Layered transmission of data is the generally recommended solution to the problem of varying bandwidth constraints and heterogeneity in multicast applications. In this paper, we describe a new multicast congestion control mechanism for layered multicast (PLMCC), which is based on packet-pair inferring bandwidth. In PLMCC, intermediate nodes and receivers infer local available bandwidth accurately and quickly using hop-by-hop downward packet-pair. Compared with PLM introduced by Legout et al., PLMCC eliminates the problem associated with large Internet group management protocol (IGMP) leave latencies, it has faster convergence speed. Moreover, our simulation results show that PLMCC is also TCP-friendly and scalable.
Call for papers
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2003)

<B>About the Magazine</B>The ACM Computers in Entertainment magazine (http://www.acm.org/pubs/cie.html) covers a wide range of theoretical and practical computer applications in the field of entertainment such as online games, CGI movies, interactive TV, virtual reality, and animatronics. It publishes high-quality papers on the latest development in software, hardware, and business policies that improve existing mainstream entertainment and that create new genres of entertainment. Upcoming special issues will be devoted to "Educating Children Through Entertainment," "Merging Virtual Reality and Live Performances," "Music Informatics," "Interactive Television," and "Entertainment Robots." The magazine welcomes submissions of articles from scholars and professionals involved in all aspects of entertainment technology.<B>GUIDELINE FOR AUTHORS</B>Papers should be submitted to the editor-in-chief via email, preferably in MS Word or RTF format. Rich media such as QuickTime and Flash movies are also acceptable. Manuscripts should contain no more than 10,000 words. Submissions should include the paper title, abstract, keywords, classification (www.acm.org/class/1998/overview.html), name of authors, their affiliation, email address, and postal address. 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
An adaptive sharing elitist evolution strategy for multiobjective optimization
Authors: Lino Costa, Pedro Oliveira
Venue: Evolutionary Computation (2003)

Almost all approaches to multiobjective optimization are based on Genetic Algorithms (GAs), and implementations based on Evolution Strategies (ESs) are very rare. Thus, it is crucial to investigate how ESs can be extended to multiobjective optimization, since they have, in the past, proven to be powerful single objective optimizers. In this paper, we present a new approach to multiobjective optimization, based on ESs. We call this approach the Multiobjective Elitist Evolution Strategy (MEES) as it incorporates several mechanisms, like elitism, that improve its performance. When compared with other algorithms, MEES shows very promising results in terms of performance.
Noise-tolerant speech recognition: the SNN-TA approach
Authors: Edmondo Trentin, Marco Matassoni
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Neural network learning theory draws a relationship between "learning with noise" and applying a regularization term in the cost function that is minimized during the training process on clean (non-noisy) data. Application of regularizers and other robust training techniques are aimed at improving the generalization capabilities of connectionist models, reducing overfitting. In spite of that, the generalization problem is usually overlooked by automatic speech recognition (ASR) practioners who use hidden Markov models (HMM) or other standard ASR paradigms. Nonetheless, it is reasonable to expect that an adequate neural network model (due to its universal approximation property and generalization capability) along with a suitable regularizer can exhibit good recognition performance whenever noise is added to the test data, although training is accomplished on clean data. This paper presents applications of a variant of the so called segmental neural network (SNN), introduced at BBN by Zavaliagkos et al. for rescoring the N-best hypothesis yielded by a standard continuous density HMM (CDHMM). An enhanced connectionist model, called SNN with trainable amplitude of activation functions (SNN-TA) is first used in this paper instead of the CDHMM to perform the recognition of isolated words. Viterbi-based segmentation is then introduced, relying on the level-building algorithm, that can be combined with the SNN-TA to obtain a hybrid framework for continuous speech recognition. The proposed paradigm is applied to the recognition of isolated and connected Italian digits under several noisy conditions, outperforming the CDHMMs.
D.I.C.E. and Co.In.S.: A Data Integration Cache Engine for a Content Integration System
Authors: Peter Triantafillou, Nikos Ntarmos, John Yannakopoulos
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Content integration of web data sources is becoming increasingly important for the formation of the next generation information systems. A common performance bottleneck faced by all proposed solutions is the network overhead incurred when contacting the integrated e-sites. With this paper we contribute ongoing work on D.I.C.E. and Co.In.S.; a domain-independent Content Integration System and its Data Integration Cache Engine. DICE constitutes a cache engine utilizing novel techniques for operating as a fully active semantic cache. We show how our contributions can be applied in the field of content integration in order to improve the response time of content integration systems, representative of a large class of e-commerce applications. We have implemented the proposed architecture and are currently developing a number of applications.
Converting general nonlinear programming problems into separable programming problems with feedforward neural networks
Authors: Bao-Liang Lu, Koji Ito
Venue: Neural Networks (2003)

In this paper we present a method for converting general nonlinear programming (NLP) problems into separable programming (SP) problems by using feedforward neural networks (FNNs). The basic idea behind the method is to use two useful features of FNNs: their ability to approximate arbitrary continuous nonlinear functions with a desired degree of accuracy and their ability to express nonlinear functions in terms of parameterized compositions of functions of single variables. According to these two features, any nonseparable objective functions and/or constraints in NLP problems can be approximately expressed as separable functions with FNNs. Therefore, any NLP problems can be converted into SP problems. The proposed method has three prominent features. (a) It is more general than existing transformation techniques; (b) it can be used to formulate optimization problems as SP problems even when their precise analytic objective function and/or constraints are unknown; (c) the SP problems obtained by the proposed method may highly facilitate the selection of grid points for piecewise linear approximation of nonlinear functions. We analyze the computational complexity of the proposed method and compare it with an existing transformation approach. We also present several examples to demonstrate the method and the performance of the simplex method with the restricted basis entry rule for solving SP problems.
Abstracts from ERIC
Authors: anonymous
Venue: ACM SIGCUE Outlook (1970)

Federal Government assistance to colleges and universities is recommended in order to make up deficiencies in educational computing facilities and to support leadership and innovation at those institutions which presently have computer facilities. By 1971, an estimated annual outlay of $400 million will be necessary to give undergraduates adequate computer services. Universities should use accounting procedures which will enable them to determine and control computer costs. The Federal Government can provide flexible support for the purchase or rental of computer equipment and services, for research and education in computer science, for faculty training in computer use and, in cooperation with colleges, establish central computing facilities capable of serving several institutions simultaneously. A group, established jointly by the National Science Fourndation and the Office of Education, is recommended to investigate and publish data on computer use in secondary schools. Statistics and forecasts concerning computers and the jobs and personnel associated with them can be made available by the Federal Government. Appendices to the report include estimates of the cost and capacity of an adequate computer service as well as data on existing computer facilities and present government expenditures in the field. (JY)
Almost periodic solutions of forced Li&#x00E9;nard-type equations with time delays
Authors: Chunhua Feng, Peiguang Wang
Venue: Journal of Computational and Applied Mathematics (2003)

By using the exponential dichotomy theory, this paper investigated the existence of almost periodic solutions of forced Liénard-type equations with time delays. A sufficient condition on the existence of almost periodic solutions for this class equation is obtained.
Using Trade-Off Analysis to Uncover Links between Functional and Non-Functional Requirements in Use-Case Analysis
Authors: Tal Pasternak
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

Non-functional requirements, such as resource usageand performance are of principal importance becausethey directly affect costs and benefits of developing anddeploying software. However, an approach to objectoriented analysis that is use-case driven risks neglectingthe analysis of non-functional requirements. A solutionto this problem is proposed based on the observationthat some non-functional requirements are implementedby functional requirements at a lower level.Trade-off analysis is proposed as a technique to uncoverthe connection between a non-functional requirementand the objects and methods which realize it,thereby enabling a non-functional requirement to beanalyzed within the framework of a use-case realization.
Towards Verification of C Programs: Axiomatic Semantics of the C-kernel Language
Authors: V. A. Nepomniaschy, I. S. Anureev, A. V. Promskii
Venue: Programming and Computing Software (2003)

With the aim of the verification of programs in the C-light language &lsqb;1&rsqb;, its kernel C-kernel is separated, and an axiomatic semantics for it is suggested. A theorem on soundness of the axiomatic semantics of C-kernel with respect to its operational semantics is proved. The C-light language is used as an input language of the program verification system, which includes a translator to C-kernel and a generator of the correctness conditions for C-kernel programs, which is based on its axiomatic semantics.
Nanometer scale linewidth control during etching of polysilicon gates in high-density plasmas
Authors: O. Joubert, E. Pargon, J. Foucher, X. Detter, G. Cunge, L. Vallier
Venue: Microelectronic Engineering (2003)

We address some of the plasma issues encountered for ultimate silicon gate patterning that should be fixed in order to establish the long term viability of plasma processes in integrated circuits manufacturing. For sub-100-nm gate dimensions, one of the main issues is to precisely control the shape of the etched feature. This requires a detailed knowledge of the various physico-chemical mechanisms involved in plasma etching and deposition.
Electrochemical aspects of new materials and technologies in microelectronics
Authors: Valery M. Dubin
Venue: Microelectronic Engineering (2003)

Major scaling issues, which need to be addressed to continue scaling according to Moore's law, include increase of transistor leakage due to use of thin gate oxide (about 1 nm limit for SiO2), power (reaching 100 W/cm2) and RC delay (dielectric constant limit is 1 for air and Cu resistivity increases with scaling down the feature sizes). Integration of new materials and technologies will allow us to continue scaling and improve device performance. Examples of new materials include high-k dielectrics and strained silicon in the frond end of wafer processing, low-k carbon-doped oxide and electroplated copper in the back end of wafer processing as well as electroplated bumps, high thermal conductivity interface, heat sink and heat spreader materials in packaging. Electrochemical technologies will play an increasingly important role in silicon technology due to low cost, use of self-assembly processing and self-aligned growth ability. New electrochemical technologies in silicon processing include copper electroplating (replaced Al interconnect to reduce RC delay and increase reliability), bump electroplating (replaced wire bonding to allow increased I/O and improve reliability), and porous silicon for silicon on isolator fabrication (to reduce transistor leakage). Copper electroplating allows a low R, an excellent gap fill capability and superior materials properties with (111) textured Cu films and large grain size, and a stable and controlled process.
Representative threats for research in public health surveillance
Authors: Michael M. Wagner, Virginia Dato, John N. Dowling, Michael Allswede
Venue: Journal of Biomedical Informatics (2003)

A large number of biological agents can cause natural or bioterroristic disease outbreaks and each can present in a bewildering number of ways (e.g., a few cases versus many cases, confined to a building versus widely disseminated). This 'problem space' is a challenge for designers of early warning systems for disease outbreaks and the sheer size of this space is a barrier to progress.This paper addresses this problem by deriving nine categories of threats that represent a parsimonious characterization of the problem space. A literature search also identified one or more example outbreaks for each of the nine categories. These outbreaks have occurred in recent times and could be used by researchers in need of actual outbreak data for investigations of the role of different types of surveillance data and algorithms in outbreak detection.The methodological contribution of this research is a Criterion Set of threats for analysis and evaluation of detection systems. This set characterizes the problem space in a tractable manner with less loss of generality than analyses based on one or two selected diseases, which is representative of current analyses.
Manhattan-diagonal routing in channels and switchboxes
Authors: Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2004)

New techniques are presented for routing straight channels, L-channels, switchboxes, and staircase channels in a two-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical, and &plusmn; 45&deg; directions. First, an O(l.d) time algorithm is presented for routing a straight channel of length l and density d with no cyclic vertical constraints. It is shown that the number of tracks h used by the algorithm for routing multiterminal nets satisfies d &le; h &le; (d + 1). Second, an output-sensitive algorithm is reported that can route a channel with cyclic vertical constraints in O(l.h) time using h tracks, allowing overlapping of wire segments in two layers. Next, the routing problem for a multiterminal L-channel of length l and height h is solved by an O(l.h) time algorithm. If no cyclic vertical constraints exist, its time complexity reduces to O(l.d) where d is the density of the L-channel. Finally, the switchbox routing problem in the MD model is solved elegantly. These techniques, easily extendible to the routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results on benchmarks show significantly low via count and reduced wire length, thus establishing the superiority of MD routing to classical strategies. The proposed algorithms are also potentially useful for general non-Manhattan area routing and multichip modules (MCMs).
Context Aware Deployment for Mobile Users
Authors: Chantal Taconet, Erik Putrycz, Guy Bernard
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

With the development of mobile computing, applicationshave to be accessible at any time, from any device and inany place in a wide variety of execution contexts. Consequently,applications have to adapt to different terminal capabilitiesboth for efficiency and ergonomics.In this paper, we present a deployment infrastructure,called Smart Deployment Infrastructure (SDI), which aimsto ease the installation of large distributed applications forany kind of user terminal. SDI is designed to take into accountthe execution context (including available resourcesand the user's terminal capabilities) in order to bring an applicationto the user and adapt it to the execution context.By considering an application as an assembly of distributedsoftware components, SDI provides the opportunity todecide at installation time which components, among packagedcomponents, will be instantiated on the terminal andwhich ones will be installed on other hosts.SDI implementation demonstrates that the deploymentinfrastructure offers acceptable application deploymenttimes and, at the same time, lowers both the application executiontimes and terminal resource consumption.