ppxscal/embedding_network huggingface dataset:
CONLAN: a formal construction method for hardware description languages: language application
Authors: Robert Piloty, Mario Barbacci, Dominique Borrione, Donald Dietmeyer, Fredrick Hill, Patrick Skelly
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

CONLAN is a formal semantic and syntactic base for the description of all phases in the design and documentation of digital systems. Previous papers[1, 2] have presented the basic concepts and models underlying the whole CONLAN language family. On the example of the construction of Base CONLAN, the first level which can be of some operational interest to the hardware designer, it has been shown how a coherent set of special purpose application languages can be derived from a common mathematical base, Primitive Set CONLAN.
Seattle: a platform for educational cloud computing
Authors: Justin Cappos, Ivan Beschastnikh, Arvind Krishnamurthy, Tom Anderson
Venue: ACM SIGCSE Bulletin (2009)

Cloud computing is rapidly increasing in popularity. Companies such as RedHat, Microsoft, Amazon, Google, and IBM are increasingly funding cloud computing infrastructure and research, making it important for students to gain the necessary skills to work with cloud-based resources. This paper presents a free, educational research platform called Seattle that is community-driven, a common denominator for diverse platform types, and is broadly deployed. Seattle is community-driven -- universities donate available compute resources on multi-user machines to the platform. These donations can come from systems with a wide variety of operating systems and architectures, removing the need for a dedicated infrastructure. Seattle is also surprisingly flexible and supports a variety of pedagogical uses because as a platform it represents a common denominator for cloud computing, grid computing, peer-to-peer networking, distributed systems, and networking. Seattle programs are portable. Students' code can run across different operating systems and architectures without change, while the Seattle programming language is expressive enough for experimentation at a fine-grained level. Our current deployment of Seattle consists of about one thousand computers that are distributed around the world. We invite the computer science education community to employ Seattle in their courses.
Information system architecture for customizing touristic trips
Authors: Alberto Salguero, Francisco Araque, Cecilia Delgado
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

There is so many information available (Internet, books, magazines...) that sometimes, when we want to plan a visit to a certain touristic place, we have to employ a big effort selecting we would like to visit in that place. Knowing our personal characteristics is it possible to discard some of the possibilities and obtain a list of spots we might be interested in. In this paper we present a data warehouse architecture which, by mean of a customer clustering and a classification processes, is able to give us the spots we might be interested in and build the best plan for visiting them according to our personal characteristics and other environment changing circumstances.
Technical Section: Normals estimation for digital surfaces based on convolutions
Authors: Sébastien Fourey, Rémy Malgouyres
Venue: Computers and Graphics (2009)

In this paper, we present a method that we call on-surface convolution which extends the classical notion of a 2D digital filter to the case of digital surfaces (following the cuberille model). We also define an averaging mask with local support which, when applied with the iterated convolution operator, behaves like an averaging with large support. The interesting property of the latter averaging is the way the resulting weights are distributed: given a digital surface obtained by discretization of a differentiable surface of R^3, the masks isocurves are close to the Riemannian isodistance curves from the center of the mask. We eventually use the iterated averaging followed by convolutions with differentiation masks to estimate partial derivatives and then normal vectors over a surface. The number of iterations required to achieve a good estimate is determined experimentally on digitized spheres and tori. The precision of the normal estimation is also investigated according to the digitization step.
Dynamic Multiple-Threshold Call Admission Control Based on Optimized Genetic Algorithm in Wireless/Mobile Networks
Authors: Shengling Wang, Yong Cui, Rajeev Koodli, Yibin Hou, Zhangqin Huang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Due to the dynamics of topology and resources, Call Admission Control (CAC) plays a significant role for increasing resource utilization ratio and guaranteeing users' QoS requirements in wireless/mobile networks. In this paper, a dynamic multi-threshold CAC scheme is proposed to serve multi-class service in a wireless/mobile network. The thresholds are renewed at the beginning of each time interval to react to the changing mobility rate and network load. To find suitable thresholds, a reward-penalty model is designed, which provides different priorities between different service classes and call types through different reward/penalty policies according to network load and average call arrival rate. To speed up the running time of CAC, an Optimized Genetic Algorithm (OGA) is presented, whose components such as encoding, population initialization, fitness function and mutation etc., are all optimized in terms of the traits of the CAC problem. The simulation demonstrates that the proposed CAC scheme outperforms the similar schemes, which means the optimization is realized. Finally, the simulation shows the efficiency of OGA.
Unified formulas for arbitrary order symbolic derivatives and anti-derivatives of the power-inverse hyperbolic class 1
Authors: Mhenni M. Benghorbal
Venue: ACM Communications in Computer Algebra (2009)

We continue on tackling and giving a complete solution to the problem of finding the nth derivative and the nth anti-derivative, where n can be an integer, a fraction, a real, or a symbol, of elementary and special classes of functions. In general, the solutions are given through unified formulas in terms of the Fox H-function which in many cases can be simplified to less general functions. In this work, we consider two subclasses of the power-inverse hyperbolic class. Namely, the power-inverse hyperbolic sine class {f(x) : f(x) = Σlj=1Pj(xαj)arcsinh(βjxγj), αj ∈ C, βj ∈ C\{0},γj ∈ R\{0}, (1) and the power-inverse hyperbolic cosine class {f(x) : f(x) = Σlj=1Pj(xαj)arccosh(βjxγj), αj ∈ C, βj ∈ C\{0},γj ∈ R\{0}, (2) where pj's are polynomials of certain degrees. One of the key points in this work is that the approach does not depend on integration techniques The arbitrary order of differentiation is found according to the Riemann-Liouville definition, whereas the generalized Cauchy n-fold integral is adopted for arbitrary order of integration. The motivation of this work comes from the area of symbolic computation. The idea is that: Given a function f in a variable x, can CAS find a formula for the nth derivative, the nth anti-derivative, or both of f? This enhances the power of integration and differentiation of CAS. In Maple, the formulas correspond to invoking the commands diff(f(x) for the nth derivative and int(f(x), x$n) for the nth anti-derivative. A software exhibition will be given using Maple. Example: A unified formula for arcsinh(√x) in terms of the Meijer G-function (arcsinh(√x)) (n) = x(1/2--nover2√π G1,2over1,2 (1/2,1/2over0,n--1/2│x) , │x│ The above G-function reduces to the original function if n = 0. It gives derivatives of any order if n > 0 and anti-derivatives of any order if n
A Distributed Approximate Algorithm for Minimal Connected Cover Set Problem in Sensor Networks
Authors: Zou Sai, Xu YuMing, Zou Fei, Jiang XiaoQi, Deng HongWei, Yu Ying
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

For wireless sensor networks, it is an effective approach for energy conservation in wireless sensor networks to keep the most of redundant sensors asleep while the remaining nodes stay active to maintain both sensing coverage and network connectivity, i.e., to form the Minimal Connected Cover Set. A novel concept named "square grid partition" is proposed, and based on the good characteristics of "square grid partition", a new distributed approximate algorithm for constructing the Minimal Connected Cover Set is presented, in which, Sink partitions its area of interest into square grids firstly, and then broadcasts the partition information to all the sensors in the whole network. According to those received partition information of the area of interest, each sensor node will construct the Minimal Connected Cover Set of G through information exchanges among its neighbors only. Algorithm analysis and simulation results show that, the newly given algorithm outperforms the traditional similar algorithms in terms of the time complexity and the size of constructed connected cover set.
Approximate dynamic programming: lessons from the field
Authors: Warren B. Powell
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applied to a wide range of problems spanning complex financial management problems, dynamic routing and scheduling, machine scheduling, energy management, health resource management, and very large-scale fleet management problems. It offers a modeling framework that is extremely flexible, making it possible to combine the strengths of simulation with the intelligence of optimization. Yet it remains a sometimes frustrating algorithmic strategy which requires considerable intuition into the structure of a problem. There are a number of algorithmic choices that have to be made in the design of a complete ADP algorithm. This tutorial describes the author's experiences with many of these choices in the course of solving a wide range of problems.
Automatic formal verification of clock domain crossing signals
Authors: Bing Li, Chris Ka-Kei Kwok
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic. After that a fully automatic, on-the-fly formal CDC approach is proposed. To the best of our knowledge, this is the first paper discussing fully automatic, on-the-fly formal verification of CDC signals. Experiment results show that our automatic formal CDC, when compared with the conventional post-CDC formal CDC, takes much less time, but still prove significant number of CDC checks.
An expert system portal for environmental health and safety
Authors: Ates Vuran, Eralp Ozil, Alper Ozpinar
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper definition and technical details of E3P Enviromental Pollution Preventation Portal has been explained. The scope of the E3P Expert System is to develop an information management, sharing and controlling system, or simply an environmental pollution portal. The portal aims for collaboration, information sharing, record tracking, management of the issues for sustainable environmental health and safety. One of the major roles of the system is tracking of legal issues, coordination between different bodies such as private companies, governments, ministry of environments, and municipalities.
Task decomposition on abstract states, for planning under nondeterminism
Authors: Ugur Kuter, Dana Nau, Marco Pistore, Paolo Traverso
Venue: Artificial Intelligence (2009)

Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains. Yoyo combines an HTN-based mechanism for constraining its search and a Binary Decision Diagram (BDD) representation for reasoning about sets of states and state transitions. We provide correctness theorems for Yoyo, and an experimental comparison of it with MBP and ND-SHOP2, the two previously-best algorithms for planning in nondeterministic domains. In our experiments, Yoyo could easily deal with problem sizes that neither MBP nor ND-SHOP2 could scale up to, and could solve problems about 100 to 1000 times faster than MBP and ND-SHOP2.
Predicting the continuance usage of information systems: a comparison of three alternative models
Authors: S. C. Wang, Y. S. Lii, K. T. Fang
Venue: WSEAS Transactions on Information Science and Applications (2009)

This study seeks to examine, through empirical evidence, the relative explanatory power of three prospective models in predicting users' continuous adoption of information system (IS). The three models include: Expectation-Confirmation Theory Model (ECTM, Model 1), the integration of ECTM with Technology Acceptance Model (TAM) (ECT-TAM model, Model 2), and a hybrid model integrating ECT, TAM and emotions (Model 3). Three hundred and fifty web portal site users were obtained from a survey. The paper assessed the psychometric properties of the measures through confirmatory factor analysis and then employed structural equation modeling analysis in order to examine and compare the ability of the three prospective models to better predict users' continuous adoption of IS. Data analysis using LISREL shows that all three models meet the various goodness-of-fit criteria. In terms of variance explained for intention to continue IS usage, all three models perform equally well. As for the explanatory power of satisfaction, Model 3 has the highest R2 (71%), followed by Model 2 (69%), and Model 1 (68%). This result confirms the erstwhile discussion of continuance intention behavior in which adding emotion factors to the cognitive process model will enhance the predictive power of the satisfaction. Perceived usefulness and perceived ease of use predict the level of user satisfaction better than emotions and perceived usefulness is the stronger predictor of user satisfaction than other variables. The Model 3 provides additional information to increase our understanding of IS continuance intention behavior.
A Protocol Composition-Based Approach to QoS Control in Collaboration Systems
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

This paper considers the problem of application-level QoS control in group collaboration systems. The QoS parameters considered, latency, jitter, packet-loss, and asynchrony, are controlled by the receiver. The QoS control is based on a novel protocol composition-based approach, wherein the protocol is modularized such that each module controls a single QoS parameter. Each module is then assigned a priority and the modules are {\em composed} such that the actions taken by a module do not violate a QoS parameter controlled by a higher priority module. This allows for more flexible QoS control. The performance of the approach is evaluated through experiments, which illustrate how the compositions are able to successfully tradeoff the QoS parameters in an appropriate manner. 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
A system for detection of liver disorders based on adaptive neural networks and artificial immune system
Authors: Humar Kahramanli, Novruz Allahverdi
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Although Artificial Neural Network (ANN) may achieve high accuracy of classification, the knowledge acquired by them is incomprehensible for humans. This fact is causing a serious problem in data mining applications. The rules that are derived from ANN are needed to be formed to solve this problem and various methods have been improved to extract these rules. Selection of the activation function is important in the performance of ANN. Networks with adaptive activation function seem to provide better fitting properties than classical architectures with fixed activation function neurons [1]. In this study, first neural network has been trained with adaptive activation function. Then for the purpose of extracting rules from adaptive ANN which has been trained for classification, OptaiNET that is an Artificial Immune Algorithm (AIS) has been used and a set of rules has been formed for liver disorder.
SEMPATH: Semantic Adaptive and Personalized Clinical Pathways
Authors: Dimitrios Alexandrou, Fotis Xenikoudakis, Gregoris Mentzas
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

As scientific achievements in the area of Healthcare have increased during the last decade, inevitably there has been an increase of treatment quality. One of the challenges to be confronted is the personalization of treatment. The personalization requires the continuous reconfiguration of the treatment schemes since the clinical status of each patient and circumstances inside a healthcare organization constantly change. In this paper we present a prototype that provides an IT solution concerning the real-time adaptation of healthcare processes. The software comprises a healthcare process execution engine assisted by a semantic info-structure for reconfiguring the pathways. The semantic info-structure utilizes an ontology enclosing the required knowledge and a semantic rule-set. During the execution of clinical pathways, the system reasons over the rules, the knowledge and information, and reconfigures the next steps of the treatment. The results of the rule-set execution may generate knowledge objects to be inserted in the ontology.
Lookahead networks
Authors: G. Jack Lipovski, Ambuj Goyal, Miroslaw Malek
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A fail-soft and easily reconfigurable interconnection network is proposed that can function like a bus or like a shift register ring. Its performance as a bus exceeds the performance of an Ethernet, and its performance as a ring is similar to that of a distributed local computer network (DLCN). It can be reconfigured to a sufficient degree to prune out faults or to partition the network into subnetworks that can use possibly different protocols that are the most suitable for the subnetwork. Its multiple-level priority arbitration appears very useful for mixed voice-data networks, to give guaranteed response times to voice packets. Finally, though it functions like a bus or shift register ring, it is physically connected like a tree; so its cost is linear and delay is logarithmic with the number of processors in the network, and it is relatively easy to install in a building by using practices similar to those used in telephone line networks. This paper describes functions of network-level and some data link and physical-level protocols and develops several key mechanisms to achieve ease of diagnosis and fail-softness.
Supporting the social uses of television: sociability heuristics for social tv
Authors: David Geerts, Dirk De Grooff
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Various social television systems and applications, enabling remote communication and interaction between viewers, are currently in development. Although usability guidelines exist for interactive television to ensure a usable system, there are no sociability guidelines for designing or evaluating the social interaction these systems enable. In this paper we present twelve sociability heuristics for evaluating social TV, based on several user studies with social TV systems.
FPGAs with time-division multiplexed wiring: an architectural exploration and area analysis
Authors: Rosemary M. Francis, Simon W. Moore
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Time-division multiplexed (TDM) wiring is explored to increase the capacity of FPGA wiring channels while decreasing the silicon area. More efficient use of hard IP blocks is made possible by time multiplexing them in conjunction with TDM data transport. Look-up table utilization is reduced through automatic serialization of system-on-FPGA interconnect and off-chip communication. Our scheduling tool is able to share wires effectively and reduce the amount of wiring required on the FPGA. The wiring is clocked many times faster than the user clock so the signals can be pipelined and the wires shared without changing the functionality of the circuit. Previous work using an earlier version of our tool showed that wiring reductions were possible, but it is only now we have shown them to be practical. Important improvements to this work have included the move from bidirectional to unidirectional wires. There is also no longer a mix of TDM and static wiring: all wires are shared, but not necessarily pipelined. The scheduling tool trades-off between effective wire sharing and critical path delay. Following these changes the wiring was redesigned to encode configuration bits more efficiently and reduce the silicon area. This transistor-level model of the wiring was used to estimate the silicon area of our new TDM architecture. Our results indicate that the amount of wiring required can be reduced by as much as 82% whilst running the interconnect clock 16 times faster than the user clock. The interconnect cycles through 16 wiring configurations every user clock cycle. Area estimations indicate that this wire reduction is sufficient to reduce the silicon area, despite the extra configuration SRAM. This reduction in silicon area comes with an increase in channel routing capacity.
A compiler and runtime system for enabling data mining applications on gpus
Authors: Wenjing Ma, Gagan Agrawal
Venue: ACM SIGPLAN Notices (2009)

With increasing need for accelerating data mining and scientific data analysis on large data sets, and less chance to improve processor performance by simply increasing clock frequencies, multi-core architectures and accelerators like FPGAs and GPUs have become popular. A recent development in using GPU for general computing has been the release of CUDA (Compute Unified Device Architecture) by NVIDIA. CUDA allows GPU programming with Clanguage-like features, thus easing the development of non-graphics applications on a GPU. However, several challenges still remain in programming the GPUs with CUDA, because CUDA involves explicit parallel programming and management of its complex memory hierarchy, as well as allocating device memory, moving data between CPU anddevice memory, and specification of thread grid configurations. In this paper, we offer a solution for the programmers to generate CUDA code by specifying the sequential reduction loop(s) with some information about the parameters. With program analysis and code generation, the applications are mapped to a GPU. Several additional optimizations are also performed by the middleware. We have evaluated our system using three popular data miningapplications, k-means clustering, EM clustering, and Principal Component Analysis (PCA). The speedup that each of these applications achieve over a sequential CPU version ranges between 20 and 50.