ppxscal/embedding_network huggingface dataset:
Ambi Graph: Modeling Ambient Intelligent System
Authors: K. Chandrasekaran, I. R. Ramya, R. Syama
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

In computing, ambient intelligence (AmI)[2,3] refers to electronic environments that are sensitive and responsive to the presence of people. In an ambient intelligent world, devices work in concert to support people in carrying out their everyday life activities, tasks and rituals in easy, natural way using information and intelligence that is hidden in the network connecting these devices. The ambient intelligence paradigm builds upon ubiquitous computing [4] and human-centric computer interaction design. In this paper, we introduce a notation, called Ambi Graphs, for specifying the work flow in any ambient intelligence system. An ambi graph is elegant when it is designed to adapt to the wide range of users that work on it.
Symbolic execution with abstraction
Authors: Saswat Anand, Corina S. P&#x0103;s&#x0103;reanu, Willem Visser
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2009)

We address the problem of error detection for programs that take recursive data structures and arrays as input. Previously we proposed a combination of symbolic execution and model checking for the analysis of such programs: we put a bound on the size of the program inputs and/or the search depth of the model checker to limit the search state space. Here we look beyond bounded model checking and consider state matching techniques to limit the state space. We describe a method for examining whether a symbolic state that arises during symbolic execution is subsumed by another symbolic state. Since the number of symbolic states may be infinite, subsumption is not enough to ensure termination. Therefore, we also consider abstraction techniques for computing and storing abstract states during symbolic execution. Subsumption checking determines whether an abstract state is being revisited, in which case the model checker backtracks&#x2014;this enables analysis of an under-approximation of the program behaviors. We illustrate the technique with abstractions for lists and arrays. We also discuss abstractions for more general data structures. The abstractions encode both the shape of the program heap and the constraints on numeric data. We have implemented the techniques in the Java PathFinder tool and we show their effectiveness on Java programs. This paper is an extended version of Anand et al. (Proceedings of SPIN, pp. 163&#x2013;181, 2006).
Reliable routings in networks with generalized link failure events
Authors: Stamatis Stefanakos
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We study routing problems in networks that require guaranteed reliability against multiple correlated link failures. We consider two different routing objectives: The first ensures "local reliability," i.e., the goal is to route so that each connection in the network is as reliable as possible. The second ensures "global reliability," i.e., the goal is to route so that as few as possible connections are affected by any possible failure. We exhibit a trade-off between the two objectives and resolve their complexity and approximability for several classes of networks. Furthermore, we propose approximation algorithms and heuristics. We perform experiments to evaluate the heuristics against optimal solutions that are obtained using an integer linear programming solver. We also investigate up to what degree the routing trade-offs occur in randomly generated instances.
A structured information system design for a newspaper organization: a case study
Authors: Mohan R. Tanniru
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Designing an information system, whether it is one of decision making or decision supporting, often starts with the identification of the objectives of the system. Information is then generated and processed to meet these objectives. In many transaction processing systems (also known as life-stream systems or programmed systems) the objectives are expressed in terms of reports, both scheduled and ad hoc (output design). The content portion of this output design is used to determine the information needs. Some of this information may be computed internally (process design) or input directly from an external source (input design).
Bridging the memory access gap
Authors: Dennis E. Speliotis
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The rapid growth of electronic data processing over the past two decades has been characterized by an almost insatiable appetite for larger and faster memories. In fact, over this period of time, on-line storage capacity has increased about three times as much as CPU power. Yet, in spite of this impressive growth rate, memory represents perhaps the most limiting area in the development of more advanced computer systems. Furthermore, the increasing diversity of storage devices and the wide disparity in the price-performance of these devices, present a difficult challenge to the system designer, and account for a large part of the complexity of the software and hardware system to manage the storage facilities.
Critical Edition of Sanskrit Texts
Authors: Marc Csernel, François Patte
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

A critical edition takes into account all the different known versions of the same text in order to show the differences between any two distinct versions. The construction of a critical edition is a long and, sometimes, tedious work. Some software that help the philologist in such a task have been available for a long time for the European languages. However, such software does not exist yet for the Sanskrit language because of its complex graphical characteristics that imply computationally expensive solutions to problems occurring in text comparisons.This paper describes the Sanskrit characteristics that make text comparisons different from other languages, presents computationally feasible solutions for the elaboration of the computer assisted critical edition of Sanskrit texts, and provides, as a byproduct, a distance between two versions of the edited text. Such a distance can then be used to produce different kinds of classifications between the texts.
Consistency checking of all different constraints over bit-vectors within a SAT solver
Authors: Armin Biere, Robert Brummayer
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging experimental results in applying this technique to encode simple path constraints in bounded model checking. Finally, we present a new compact encoding of equalities and inequalities over bit-vectors in CNF.
On the Numerical Solution of a Transmission Eigenvalue Problem
Authors: S. Gegovska-Zajkova, Boško S. Jovanović, Irena M. Jovanović
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A transmission eigenvalue problem in disjoint intervals is examined. Distribution of the eigenvalues is obtained. The corresponding difference scheme is proposed and tested on few numerical examples.
Codimension 2 bifurcation of twisted double homoclinic loops
Authors: Qiuying Lu
Venue: Computers Mathematics with Applications (2009)

A local active coordinates approach is employed to obtain bifurcation equations of twisted double homoclinic loops. Under the condition of one twisted orbit, we obtain the existence and uniqueness and of the 1-1 double homoclinic loop, 2-1 double homoclinic loop, 2-1 right homoclinic loop, 1-1 large homoclinic loop, 2-1 large homoclinic loop and 2-1 large period orbit. For the case of double twisted orbits, we obtain the existence or non-existence of 1-1 double homoclinic loop, 1-2 double homoclinic loop, 2-1 double homoclinic loop, 2-2 double homoclinic loop, 2-1 large homoclinic loop, 1-2 large homoclinic loop, 2-2 large homoclinic loop, 2-2 right homoclinic loop, 2-2 large homoclinic loop, 2-2 left homoclinic loop and 2-2 large period orbit. Moreover, the bifurcation surfaces and their existence regions are given. Besides, bifurcation sets are presented on the 2 dimensional subspace spanned by the first two Melnikov vectors.
From concept to commercialiazed product: the challenges of privacy technologies
Authors: Mike Gurski
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Mike Gurski will draw on experience heading the Bell Security Solutions' Privacy Centre of Excellence (PCE), and examine this issue from various perspectives, the roles of government, the private sector, entrepreneurs, and academia in successfully bringing privacy technologies to market. The discussion will examine some open cases involving National Research Council, U of Toronto, Ontario Centres of Excellence, Credentica, Quebec Government, and Bell Privacy Centre of Excellence. Side roads into the vast minefields of IP, Patents, Licensing will also be touched on. The case studies will come from projects currently championed by the PCE and are in various states of commercial readiness and adoption so will provide an insight into the making of a commercially viable privacy technology. As context the presentation will also provide perspective on the privacy research houses in the private sector such as IBM Zurich labs and in Canadian and U.S. Universities. Finally the presentation will take a look ahead at where privacy technology opportunities reside for both academic institutions, governments and the private sector. 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
Assumption adequacy averaging as a concept for developing more robust methods for differential gene expression analysis
Authors: Stan Pounds, Shesh N. Rai
Venue: Computational Statistics Data Analysis (2009)

The concept of assumption adequacy averaging is introduced as a technique for developing more robust methods that incorporate assessments of assumption adequacy into the analysis. The concept is illustrated by using it to develop a method that averages results from the t-test and nonparametric rank-sum test with weights obtained from using the Shapiro-Wilk test to test the assumption of normality. Through this averaging process, the proposed method is able to rely more heavily on the statistical test that the data suggests is superior for each individual gene. Subsequently, this method developed by assumption adequacy averaging outperforms its two component methods (the t-test and rank-sum test) in a series of traditional and bootstrap-based simulation studies. The proposed method showed greater concordance in gene selection across two studies of gene expression in acute myeloid leukemia than did the t-test or rank-sum test. An R routine for implementing the method is available from www.stjuderesearch.org/depts/biostats.
Microsoft Office 2007: Illustrated Introductory Windows Vista Edition, Spanish Edition, 1st edition
Authors: David Beskeen, Carol M. Cram, Jennifer Duffy, Lisa Friedrichsen, Elizabeth Eisner Reding
Venue:  (2008)

Now available in Spanish! This Microsoft Office 2007 Illustrated Series book covers the essential information that you need to know about how to use Office 2007 applications. Our signature two-page spread design has been updated and refreshed to take full advantage of the new features of the Office 2007 software. This practical, easy to navigate book provides you with the essential knowledge you need to succeed at both work and beyond.
Constant Bandwidth vs Proportional Share Resource Allocation
Authors: Luca Abeni, Giuseppe Lipari, Giorgio Buttazzo
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Due to the success of new multimedia technologies, there is a great interest for providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in literature are based on proportional share resource allocation, such as WFQ, WF$^2$Q, EEVDF, or SFQ. In a previous paper, we showed how to perform resource reservation according to a Constant Bandwidth allocation. In this paper we compare Proportional Share and Constant Bandwidth resource allocation strategies, by showing advantages and drawbacks of both techniques.
Surface roughness prediction in machining using soft computing
Authors: B. Samanta
Venue: International Journal of Computer Integrated Manufacturing (2009)

A study is presented to model surface roughness in end milling using adaptive neuro-fuzzy inference system (ANFIS) and genetic algorithms (GAs). The machining parameters, namely, the spindle speed, feed rate, depth of cut and the workpiece-tool vibration amplitude have been used as inputs to model the workpiece surface roughness. The number and the parameters of membership functions used in ANFIS along with the most suitable inputs are selected using GAs maximising the modelling accuracy. The ANFIS with GAs (GA-ANFIS) are trained with a subset of the experimental data. The trained GA-ANFIS are tested using the set of validation data. The procedure is illustrated using the experimental data of a CNC vertical machining centre in end-milling of 6061 aluminum. Results are compared with other soft computing techniques like genetic programming (GP) and artificial neural network (ANN). The results show the effectiveness of the proposed approach in modelling the surface roughness.
Self-healing control flow protection in sensor applications
Authors: Christopher Ferguson, Qijun Gu, Hongchi Shi
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Since sensors do not have a sophisticated hardware architecture or an operating system to manage code for safety, attacks injecting code to exploit memory-related vulnerabilities can present threats to sensor applications. In a sensor's simple memory architecture, injected code can alter the control flow of a sensor application to either misuse existing routines or download other malicious code to achieve attacks. To protect the control flow, this paper proposes a self-healing scheme that can detect attacks attempting to alter the control flow and then recover sensor applications to normal operations with minimum overhead. The self-healing scheme embeds diversified protection code at particular locations to enforce access control in program memory. Both the access control code and the recovery code are designed to be resilient to control flow attacks that attempt to evade the protection. Furthermore, the self-healing scheme directly processes application code at the machine instruction level, instead of performing control or data analysis on source code. The implementation and evaluation show that the self-healing scheme is lightweight in protecting sensor applications.
A New Dynamic Logic Circuit Design for an Effective Trade-Off between Noise-Immunity, Performance and Energy Dissipation
Authors: Fabio Frustaci, Pasquale Corsonello, Stefania Perri, Giuseppe Cocorullo
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Dynamic CMOS gates are widely used in high performance circuits even though they are less noise tolerant than their static CMOS counterparts. In the literature, several techniques are known that enhance the noise-tolerance but sacrifice speed performances and energy dissipation. This paper presents a new technique for increasing the noise tolerance of dynamic CMOS gate minimizing speed and energy penalties. A wide comparison with previous techniques has been carried out. When the STMicroelectronics CMOS 90nm-1V technology is used, the proposed design technique exhibits the highest level of noise robustness (718mV). Moreover, at a parity of the noise-robustness, it achieves an energy-delay product (EDP) up to 54% lower than previous proposals.
Fast analysis of nontree-clock network considering environmental uncertainty by parameterized and incremental macromodeling
Authors: Hai Wang, Hao Yu, Sheldon X.-D. Tan
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

It is challenging to verify clock-skew for large-scale nontree clock network with environmental uncertainties such as supply voltage fluctuation and thermal temperature gradient. This paper presents a fast clock-skew analysis via parameterized incremental truncated-balanced-realization, called piTBR method. Environmental uncertainties are parametrically and structurally added into the state equation of clock network. A compact macromodel is obtained by the subspace projection constructed from the singular value decomposition (SVD) of circuit output waveforms. To reduce the computational cost, we propose an incremental SVD method that only needs to partially update the projection matrix by analyzing the perturbed output waveform owning to environmental uncertainties. Experiments on a number of clock networks show that compared with the macromodeling by the fast TBR method, our method reduces the computational cost in the order of 100x with a similar accuracy. In addition, compared with the macromodeling by the Krylov-subspace-based method, our method reduces the waveform error by 2x with a similar runtime.
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
Authors: Willy Susilo
Venue: Theoretical Computer Science (2009)

Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. A decade after its invention, there have been several FSS schemes proposed in the literature. Nonetheless, the notion of short FSS scheme has not been addressed yet. Furthermore, the short size in signature schemes has been done mainly with the use of pairings. In this paper, we propose a construction of short FSS scheme based on factorization and discrete logarithm assumption. However, in contrast to the known notion in the literature, our signature scheme does not incorporate any pairing operations. Nonetheless, our scheme is the shortest FSS scheme compared to all existing schemes in the literature that are based on the same assumption. The efficiency of our scheme is comparable to the best known FSS scheme, that is based on the discrete logarithm assumption.
Integrating data base management into operating systems: an access method approach
Authors: Alberto Cezar De Souza Moreira, Claudio Pinheiro, Luiz Fernando D'Elia
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

It appears that the final word about Data Management and Data Base Management has not yet been said. Different authors stress different points in the rather sparse bibliography on the subject. Different program products and packages are oriented toward completely distinct approaches, diverging progressively from a standardization rather than converging to it.
Development of a model of data-flows for precision agriculture based on a collaborative research project
Authors: Edward Nash, Frank Dreger, Jürgen Schwarz, Ralf Bill, Armin Werner
Venue: Computers and Electronics in Agriculture (2009)

The understanding of actual and potential data-flows in the practice of precision agriculture (PA) is an essential prerequisite for the optimisation and automation of information management in this field. As a contribution to this process, this paper presents an analysis of the data-flows within the work of a collaborative research project concerned with the testing of the methods developed within the project on two demonstration fields. This work provides a good case study for the modelling of a range of data-flows covering a broad spectrum of PA techniques. Using the notation and software tools for the Unified Modeling Language (UML), a complete model of all identified data-flows was created. Individual data-streams relating to particular source or product datasets were then extracted from this model. These data-streams present a practical application of the model in identifying the benefit that may be obtained from a particular gathered dataset (e.g. yield data) or in identifying the data that must be gathered to generate a particular product dataset (e.g. sustainability indicators). Whilst the current model is focussed on one particular research project, it has potential to be extended to cover more generally the common practice of precision agriculture. Such a model may then be used by farmers as a roadmap for the adoption for precision agriculture by allowing them to determine what datasets are available to them or may be easily collected and what products they may generate from these, or vice versa to identify what datasets they must obtain in order to generate a particular dataset of interest.
Towards a Capability Repository For Java-ME Enabled Devices
Authors: Fatma Meawad
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper discusses an initiative to construct a capability repository that will assist Java-ME developers in device recognition. The repository will act as a collaboration tool for developers by allowing contributions and recommendations of capability attributes. The structure and the dynamics of the proposed repository are discussed. Throughout the paper, the value of such an initiative is emphasized based on the author’s observations from evaluating a Java-ME mini browser. 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