ppxscal/embedding_network huggingface dataset:
The Genesis of an Early Stored-Program Computer: CSIRAC
Authors: M. Beard, T. Pearcey
Venue: IEEE Annals of the History of Computing (1984)

One of the earliest vacuum-tube stored-program computers (CSIRAC) was developed in 1947-1951 under the auspices of the Australian Council for Scientific and Industrial Research. The word length was 20 bits, and storage consisted of about 1000 words in mercury delay lines and about 4000 words on a magnetic disk. Its execution rate approached 1000 instructions per second. The computer was notable for its logical design, which made programming easy and led to economic use of the limited storage. A multiplier was incorporated, and various single-word and single-bit registers were used to assist in relative addressing, subroutine linking, reentrant programming, and decision making. Input was from paper tape and output to paper tape and a modified teletypewriter.
Discovering Frequent Generalized Episodes When Events Persist for Different Durations
Authors: Srivatsan Laxman, P. Sastry, K. Unnikrishnan
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

This paper is concerned with the framework of frequent episode discovery in event sequences. A new temporal pattern, called the generalized episode, is defined which extends this framework by incorporating event duration constraints explicitly into the pattern?s definition. This new formalism facilitates extension of the technique of episodes discovery to applications where data appears as a sequence of events that persist for different durations (rather than being instantaneous). We present efficient algorithms for episode discovery in this new framework. Through extensive simulations we show the expressive power of the new formalism. We also show how the duration constraint possibilities can be used as a design choice to properly focus the episode discovery process. Finally, we briefly discuss some interesting results obtained on data from manufacturing plants of General Motors .
Embedded typesafe domain specific languages for Java
Authors: Jevgeni Kabanov, Rein Raudjärv
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

Projects like jMock and Hibernate Criteria Query introduced embedded DSLs into Java. We describe two case studies in which we develop embedded typesafe DSLs for building SQL queries and engineering Java bytecode. We proceed to extract several patterns useful for developing typesafe DSLs for arbitrary domains. Unlike most previous Java DSLs we find that mixing the Fluent Interface idiom with static functions, metadata and closures provides for a better user experience than pure method chaining. We also make very liberal use of the Java 5 Generics to improve the type safety properties of the DSLs.
Can Social Tagging Improve Web Image Search?
Authors: Makoto Kato, Hiroaki Ohshima, Satoshi Oyama, Katsumi Tanaka
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Conventional Web image search engines can return reasonably accurate results for queries containing concrete terms, but the results are less accurate for queries containing only abstract terms, such as "spring" or "peace." To improve the recall ratio without drastically degrading the precision ratio, we developed a method that replaces an abstract query term given by a user with a set of concrete terms and that uses these terms in queries input into Web image search engines. Concrete terms are found for a given abstract term by making use of social tagging information extracted from a social photo sharing system, such as Flickr. This information is rich in user impressions about the objects in the images. The extraction and replacement are done by (1) collecting social tags that include the abstract term, (2) clustering the tags in accordance with the term co-occurrence of images, (3) selecting concrete terms from the clusters by using WordNet, and (4) identifying sets of concrete terms that are associated with the target abstract term by using a technique for association rule mining. Experimental results show that our method improves the recall ratio of Web image searches.
Robustness of systems with various PI-like fuzzy controllers for industrial plants with time delay
Authors: Snejana Yordanova
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

The robustness of the systems with fuzzy logic controllers (FLC) has lately focused the attention of researchers in relation with the expansion of their industrial application. The contemporary complex, nonlinear, time varying processes with time delay and various disturbances and the high demands for their control require to account for system stability and robustness in the FLC's design. The simplicity of the design is of great importance in connection to its easy practical application. The aim of the present investigation is to develop a generalised procedure for the design of various PI-like FLCs with regard to system performance robustness and to compare the robustness of the control systems. The approach is developed for PI incremental and position FLCs based on the single input fuzzy controller (SI FC), Popov stability and Morari robustness and considers the control of industrial plants with time delay and model uncertainty. The main contributions are: 1) a generalised design procedure for FLCs accounting for system stability and robustness; 2) FLCs' general tuning algorithm. The results are applied for the stabilisation of the air temperature in a furnace using MATLAB™. The performance of the designed FLC systems is assessed and compared to the performance of control systems with internam model controller via simulations.
The Predicted Model of International Roughness Index for Drainage Asphalt Pavement
Authors: Chien-Ta Chen, Ching-Tsung Hung, Chien-Cheng Chou, Ziping Chiang, Jyh-Dong Lin
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Roughness is a very important performance indicator in pavement maintenance management systems. The international rough index (IRI) of indicators was used as the core of roughness measuring of degree gradually in recent years domestically, but to predict a smooth degree of indicators the method is set up differently as there is a different prediction indicator because the theoretical foundation is different. This research bases its measurement data on the porous asphalt pavement of national highway number 3. We predicts the deterioration of IRI by different ways, including grey forecast, multiple regression, genetic programming. The result of this research found that there are better results in genetic programming method prediction than roughness index foundation method. The reason that it accords with the best prediction result is that heredity can carry on the change to plan in the parameter.
Exploiting host availability in distributed systems
Authors: Brian D. Noble
Venue:  (2008)

As distributed systems become more decentralized, fluctuating host availability is an increasingly disruptive phenomenon. Older systems such as AFS used a small number of well-maintained, highly available machines to coordinate access to shared client state; server uptime (and thus service availability) were expected to be high. Newer services scale to larger number of clients by increasing the number of servers. In these systems, the responsibility for maintaining the service abstraction is spread amongst thousands of machines. In the extreme, each client is also a server who must respond to requests from its peers, and each host can opt in or out of the system at any time. In these operating environments, a non-trivial fraction of servers will be unavailable at any give time. This diffusion of responsibility from a few dedicated hosts to many unreliable ones has a dramatic impact on distributed system design, since it is difficult to build robust applications atop a partially available, potentially untrusted substrate. This dissertation explores one aspect of this challenge: how can a distributed system measure the fluctuating availability of its constituent hosts, and how can it use an understanding of this churn to improve performance and security? This dissertation extends the previous literature in three ways. First, it introduces new analytical techniques for characterizing availability data, applying these techniques to several real networks and explaining the distinct uptime patterns found within. Second, this dissertation introduces new methods for predicting future availability, both at the granularity of individual hosts and clusters of hosts. Third, my dissertation describes how to use these new techniques to improve the performance and security of distributed systems.
Energy-based adaptive transform scheme in the DPRT domain and its application to image denoising
Authors: Yun-Xia Liu, Yu-Hua Peng, Wan-Chi Siu
Venue: Signal Processing (2009)

In this paper, an energy-based adaptive transform scheme in the discrete periodic Radon transform domain is proposed for an efficient representation of linear singularities in images. Experimental results using non-linear approximation show that it possesses the superior property of energy concentration compared with the discrete wavelet transform and finite ridgelet transform. Furthermore, we have applied the scheme to the denoising problem and proposed a novel threshold selection method. Results of our experimental work, carried out on images containing strong linear singularities and texture components with varying levels of additive white Gaussian noise, show that our approach achieves a substantial improvement in terms of both signal-to-noise ratio and in visual quality as compared with that of the discrete wavelet transform and finite ridgelet transform.
Versatile Design of Changing Mesh Topologies for Surgery Simulation
Authors: Barbara André, Hervé Delingette
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

In the context of surgery simulation, this paper presents a generic and efficient solution to handle topological changes on deformable meshes under real-time constraints implemented in the SOFA [4] platform. The proposed design is based on a simulation tree gathering software components acting on a mesh. The mesh topology is described by a topological component which also provides algorithms for performing topological changes (cutting, refinement). An important aspect of the design is that mesh related data is not centralized in the mesh data structure but stored in each dedicated component. Furthermore, topological changes are handled in a transparent way for the user through a mechanism of propagation of topological events from the topological components toward other components. Finally, the previous concepts have been extended to provide multiple topologies for the same degrees of freedom. Examples of cataract surgery simulation based on this versatile design are shown.
Propos: A Dynamic Web Tool for Managing Possibilistic and Probabilistic Temporal Constraint Networks
Authors: Francisco Guil, Ivan Gomez, Jose M. Juarez, Roque Marin
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

In this paper we present Propos, a novel dynamic Web tool for managing probabilistic and possibilistic temporal constraint networks. These networks are a special sort of temporal constraint satisfaction problems, useful for representing and reasoning with uncertain temporal relations between temporal points. They can be applied as an effective formalism in a very different kind of domains. Propos has been developed using dynamic Web technology for mainly, make easier the complex process of interpreting, evaluating, and finally, extracting useful knowledge from the network. It can be viewed as a novel knowledge acquisition tool and, for practical purposes, it will be used for work with temporal patterns extracted from temporal data mining processes.
Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers
Authors: Hyunho Lee, Wonsuk Lee
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.
Implementation of Highly Available Memory Database as SAF Component
Authors: Tadashiro Yoshida, Masaki Hisada, Seiji Tomita
Venue: Proceedings of the 4th international symposium on Service Availability (2007)

This paper describes the implementation of a highly available memory database with HA (High Availability) middleware based on the SAF (Service AvailabilityTM Forum) specification. The database achieves high availability in conjunction with AMF and MSG in a loosely coupled cluster. We describe its startup and re-synchronization methods; they reduce service interruption and system downtime, and are significant determiners of the availability of the shared-nothing architecture. To further enhance availability, we describe an additional SAF-AIS interface that accepts request from components.
Data Synchronization in Distributed and Constrained Mobile Sensor Networks
Authors: Shuai Hao, Hock Beng Lim
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

Data fusion in sensor networks involves the processing of data from multiple sources. For distributed settings, the fusion operation has to be executed at individual nodes, which makes data synchronization among nodes a crucial task to ensure consistency. If the sensor nodes are mobile, the communication channel between them can sometimes be broken. When communication is re-established, the snapshots of the nodes may no longer be consistent. The challenge is further made more difficult given limited communication bandwidth.In this paper, we propose two algorithms for data synchronization in distributed and constrained mobile sensor networks. The first one uses timestamps to locate data records to be transferred between nodes. The second one employs hash digest and index tree to locate the discrepancy set between two sensor nodes. For the hash-based algorithm, we further investigate the cases for complete and rounded data. The evaluation results show that the timestamp-based algorithm is better if complete data are required for fusion, while the hash-based algorithm can outperform the timestamp-based one if the fusion algorithm can tolerate errors within some given threshold.
A QoS Scheme for Multimedia Contents in Diffserv. Networks
Authors: Tae-Wook Kim, Jun-Ho Lee, Kyung-Sang Sung, Hae Seok Oh
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper proposes an approach to transmit of Multimedia Contents effectively in a rapidly changing Internet environment. At present, guaranteeing QoS in network has become an important subject to consider. When transmitting AF packets in a Multi-DiffServ network environment, A network gives priority in an order of AF1, AF2, AF3 and AF4; on the other hand, B network reverses the order with priority of AF4, AF3, AF2 and AF1. In this case, AF1 packets that received the best quality service in A network will receive the lowest in B network, which results in dropping packets in B network and vice versa. This paper suggests a way to guarantee QoS between hosts by minimizing the loss of AF packet class when one network transmits AF Class packets to another network with differing principles.
Enhanced connectors to support hierarchical dependencies in software architecture
Authors: Abdelkrim Amirat, Mourad Oussalah
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

The more important level of abstraction in the description of large and complex software is its architecture description. So, at this abstraction level we can describe the principal system components and their pathways of interaction. Software architecture is considered to be the driving aspect of the development process; it allows specifying which aspects and models in each level needed according to the software architecture design. Early Architecture Description Languages (ADLs), nearly exclusive, focus on structural abstraction hierarchy ignoring behavioural description hierarchy, conceptual hierarchy, and metamodeling hierarchy. In this paper we show that all those hierarchies constitute views to appropriately "reason about" software architectures described using our C3 metamodel which is a minimal and complete ADL. We provide a set of mechanisms to deal with different levels of each hierarchy; also we introduce a new enhanced definition for connector concept deployed in C3 architectures.
Is Estonian local e-government responsive to citizens' needs? The case study of Tartu
Authors: Kristina Reinsalu
Venue: Information Polity (2006)

This paper examines citizens' interaction with local government. The main concern of the paper is how the citizens of Estonia use the Internet for local services. It presents an empirical study supported by direct observation of websites with an accompanying description of e- and m-services being implemented or planned, and provides data from a survey conducted among citizens of a major city. My findings show that the indicators of access to the Internet, use of the Internet and mobile phones are very high in all age groups. Also, the evaluation given by the people to the website of the city council is high in different categories. The e- and m-services the city government has implemented or is planning to implement are innovative. However, the citizens' readiness to use them is low. If there is any interest, it is mainly limited to every-day-life services like m-parking etc. Forums or other services implemented to provoke citizens' involvement are not attractive. Finally, my paper discusses the impact of these results, referring to the theoretical framework, and states that the key factor for interactive communication is motivation. Should interactive communication - even if only "consumerism" of entertainment services - become a routine, it might provide a solution to problems stemming from the perceived disconnection of political and administrative institutions from citizens' everyday concerns.
Modal Semirings Revisited
Authors: Jules Desharnais, Georg Struth
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

A new axiomatisation for domain and codomain on semirings and Kleene algebras is proposed. It is simpler, more general and more flexible than a predecessor, and it is particularly suitable for program analysis and construction via automated deduction. Different algebras of domain elements for distributive lattices, (co-)Heyting algebras and Boolean algebras arise by adapting this axiomatisation. Modal operators over all these domain algebras can then easily be defined. The calculus of the previous axiomatisation arises as a special case. An application in terms of a fully automated proof of a modal correspondence result for Löb's formula is also presented.
Ambulance Decision Support Using Evolutionary Reinforcement Learning in Robocup Rescue Simulation League
Authors: Ivette C. Martínez, David Ojeda, Ezequiel A. Zamora
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

We present a complete design of agents for the RoboCup Rescue Simulation problem that uses an evolutionary reinforcement learning mechanism called XCS, a version of Holland's Genetic Classifiers Systems, to decide the number of ambulances required to rescue a buried civilian. We also analyze the problems implied by the rescue simulation and present solutions for every identified sub-problem using multi-agent cooperation and coordination built over a subsumption architecture. Our agents' classifier systems were trained in different disaster situations. Trained agents outperformed untrained agents and most participants of the 2004 RoboCup Rescue Simulation League competition. This system managed to extract general rules that could be applied on new disaster situations, with a computational cost of a reactive rule system.
DSML for Developing Repository-Based Eclipse Plug-Ins
Authors: Sanna Sivonen
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Eclipse is a popular open source platform which can be extended by its users by writing plug-ins. Developing Eclipse plug-ins manually can be time-consuming and challenging since it requires Java programming skills and knowledge about the various extension points provided by the Eclipse platform. Domain-specific modelling (DSM) is about using domain-specific modelling languages (DSMLs) instead of general-purpose modelling languages such as UML. DSM enables 100 percent code generation since the modelling language and the code generator are built for a narrow domain [1]. This paper presents a successful case of utilising DSM in software product line development: DSML and code generator for creating repository-based Eclipse plug-ins. 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
System architecture and interactivity model for mobile TV applications
Authors: M. Mohsin Saleemi, Jerker Björkqvist, Johan Lilius
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Interactive services and applications for Mobile TV are considered to be one of the promising concepts that offer new opportunities for mass media, mobile and broadcast industry. This article explores the concepts of interactivity, interactive applications and system architecture aspects in interactive mobile TV. It investigates demands and constraints for the software platform of mobile TV, suggests possible solutions for them and proposes prototype software architecture for mobile TV based on this investigation and proposed solutions. Interactivity model for the interactive mobile TV applications is proposed that facilitate the evaluation of these applications to prospect the terminal and server side's requirements. This model has significance because it specifies the overall image of mobile interactive system that will be helpful for defining common application framework based on the user's perception.