ppxscal/embedding_network huggingface dataset:
ReDAC Dynamic Reconfiguration of Distributed Component-Based Applications with Cyclic Dependencies
Authors: Andreas Rasche, Andreas Polze
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

This paper introduces ReDAC, a new algorithm for dynamic reconfiguration of multi-threaded applications. In order to achieve high reliability and availability, distributed component software has to support dynamic reconfiguration. Typical examples include the application of hot-fixes to deal with security vulnerabilities. ReDAC can be implemented on top of the modern component-platforms Java and .NET. We extend the statical term component, denoting a unit of deployment, to runtime by defining a capsule (runtime component instance) to be a set of interconnected objects. This allows us to apply dynamic updates at the level of components during runtime without stopping whole applications. Using system-wide unique identifiers for threads (logical thread IDs), we can detect and also bring capsules into a reconfigurable state by selectively blocking threads, relying on data structures maintained by additional logic integrated into the capsules using aspect-oriented programming. An important contribution of this paper is that ReDAC supports the dynamic reconfiguration of distributed multi-threaded and re-entrant components with cyclic call dependencies.
Joshua Lederberg (1925-2008)
Authors: Bruce G. Buchanan
Venue: IEEE Intelligent Systems (2008)

This article looks at the life of Joshua Lederberg (1925-2008).
Design of Fair Multi-user Transceivers with QoS and Imperfect CSI
Authors: M. Botros Shenouda, T. N. Davidson
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

We consider the downlink of cellular systems in which the users have Quality of Service (QoS) requirements, and we study the design of robust fair broadcasting schemes that maximize the minimum QoS over all users when the users' channel state information (CSI) is imperfect at the transmitter. Using a bounded uncertainty model for the transmitter's estimate of users' channels we formulate each user's QoS requirement as a constraint on the mean square error (MSE) in its received signal, and we demonstrate that these MSE constraints imply constraints on the received signal-to-interference-plus-noise-ratio (SINR) of each user. Using these MSE constraints, we present a unified design approach for robust linear and non-linear transceivers with QoS requirements, and we provide quasi-convex formulations that can be efficiently solved using a one-dimensional bisection search. The proposed designs overcome the limitations of existing approaches that only provide conservative solutions and only applicable to the case of linear precoding. Furthermore, we provide tractable and computationally-efficient design formulations for a quite general model of channel uncertainty that subsumes many uncertainty regions. Our numerical results demonstrate that in the presence of uncertainty in the transmitter's knowledge of users' channels, the proposed designs provide guarantees to a larger set of minimum QoS requirements than existing approaches.
Using cognitive conflict and visualisation to improve mental models held by novice programmers
Authors: Linxiao Ma, John D. Ferguson, Marc Roper, Isla Ross, Murray Wood
Venue: ACM SIGCSE Bulletin (2008)

Recent research has found that many novice programmers often hold non-viable mental models of basic programming concepts such as assignment and object reference, which can limit their potential to develop programming skills. This paper proposes a constructivist-based teaching model that integrates cognitive conflict and program visualisation with the aim of supporting novice programmers in the formulation of appropriate mental models. The results of an initial empirical study produced three findings of note. Firstly, a teaching model based on either visualisation alone or cognitive conflict integrated with visualisation can help students develop viable models of value assignment. Secondly, there was evidence to suggest that cognitive conflict integrated with visualisation outperformed visualisation alone in helping students develop viable models of the more challenging concept of object reference assignment. And thirdly, there was evidence of an improvement in students' understanding of value and object reference assignment using the teaching model based on visualisation and cognitive conflict.
SWEVM: a software EVM for embedded system programming
Authors: Jian-Hong Liu, Jing Chen, Chen-Yung Wang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

EVM (Evaluation Module), also known as EVB, has become an important tool in developing embedded systems because it can shorten the development cycle. It is also very useful in course modules which cover embedded system programming. However, an EVM with the configuration suitable for the diversity in embedded system programming is quite expensive such that setting up a laboratory for students to practice programming embedded system sums a large amount of funding. This paper presents the design and the implementation of a software EVM, namely SWEVM, which serves as an effective tool in teaching embedded system programming. SWEVM can emulate the main functionality of Creator PreSOC kit which is an EVM product of Mircotime Inc., a Taiwanese company. Its design is highly modularized with good configurability for both flexibility and expandability. Students can easily exercise the common make-load-execute cycle of embedded system programming using SWEVM with no hardware device other than an ordinary PC. Therefore, SWEVM serves as a good alternative to the costly hardware EVM for education purposes.
IT Convergence Application System for Eco Aquafarm
Authors: Heeteak Ceong, Jeong-Seon Park, Soonhee Han
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This study includes basic technology and a convergence application system to create eco-friendly fish cultures using IT technology. The information of environmental factors which highly influencing fish health, such as water temperature, dissolved oxygen and salinity were acquired through sensors in aquaculture farm, and transferred through a mobile terminal into a server at a remote site. When the ranges of environmental information are abnormal, the monitoring system sends immediate alarm to a manager in the IT center as well as a user at the aquaculture site. In addition, acquired sensor information was accumulated, modeled, and analyzed in the eco aquaculture system to make predictions about dramatic changes in the aquaculture environment and disease occurrence, and to access integrated information on simulation system. Also, an image-based system for rapid diagnosis was developed, allowing for earlier treatment of affected fish to prevent the spread of disease. The IT convergence application system in this study contributed to eco-friendly aquaculture and increased economic benefits for the aquaculture industry by continuous monitoring and analysis of environmental factors, feeding, history of drug usage etc.
Preliminary comparison of the ozone vertical profiles from Umkehr and ozonesonde measurements over Poland with EOS-MLS Aura spacecraft overpasses, 2004-2005
Authors: J. W. Krzyscin, B. Rajewska-Więch
Venue: International Journal of Remote Sensing (2007)

Ozone vertical profiles derived from Umkehr observations by the Dobson spectrophotometer at Belsk (52.50° N, 20.47° E) and from ozone soundings carried out at the nearest aerological station, Legionowo (52.24° N, 20.58° E), have been compared with those measured by the MLS instrument on board the Aura spacecraft during the sites' overpasses for the period 2004-2005. It is assumed that the satellite station distance should be less than 2° and less than 4° for the latitudinal and longitudinal difference, respectively. The bias, RMS error, and the correlation coefficients between the ozone content in the Umkehr layers have been calculated using Dobson/sonde/MLS data. The ozone mixing ratio at selected levels in the lower and mid-stratosphere (from 215 hPa up to 6.8 hPa) have been compared using the sonde/MLS data. The number of analysed daily values was ∼40 (Dobson/MLS), 60 (sonde/MLS), and 60 (Dobson/sonde) since August 2004. The comparisons show a good correspondence (bias ∼±5%, RMS
The last excluded case of Dirac's map-color theorem for choosability
Authors: Daniel Král', Riste Skrekovski
Venue: Journal of Graph Theory (2006)

In 1890, Heawood established the upper bound $H ( \varepsilon )= \left \lfloor 7+\sqrt {24\varepsilon +1}/{2}\right \rfloor$ on the chromatic number of every graph embedded on a surface of Euler genus ε &ge; 1. Almost 80 years later, the bound was shown to be tight by Ringel and Youngs. These two results have became known under the name of the Map-Color Theorem. In 1956, Dirac refined this by showing that the upper bound H(ε) is obtained only if a graph G contains KHε as a subgraph except for three surfaces. Albertson and Hutchinson settled these excluded cases in 1979. This result is nowadays known as Dirac's Map-Color Theorem. B&ouml;hme, Mohar, and Stiebitz extended Dirac's Map-Color Theorem to the case of choosability by showing that G is (H(ε) - 1)-choosable unless G contains KH(ε) as a subgraph for ε &ge; 1 and ε &ne; 3. In the present paper, we settle the excluded case of ε = 3. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 51: 319&ndash;354, 2006
Enhancing portability with multilingual ontology-based knowledge management
Authors: Aviv Segev, Avigdor Gal
Venue: Decision Support Systems (2008)

Information systems in multilingual environments, such as the EU, suffer from low portability and high deployment costs. In this paper we propose an ontology-based model for multilingual knowledge management in information systems. Our unique feature is a lightweight mechanism, dubbed context, that is associated with ontological concepts and specified in multiple languages. We use contexts to assist in resolving cross-language and local variation ambiguities. Equipped with such a model, we next provide a four-step procedure for overcoming the language barrier in deploying a new information system. We also show that our proposed solution can overcome differences that stem from local variations that may accompany multilingual information systems deployment. The proposed mechanism was tested in an actual multilingual eGovernment environment and by using real-world news syndication traces. Our empirical results serve as a proof-of-concept of the viability of the proposed model. Also, our experiments show that news items in different languages can be identified by a single ontology concept using contexts. We also evaluated the local interpretations of concepts of a language in different geographical locations.
A Study of the Structure of Chinese Customer Satisfaction in a Web-Based Shopping Environment
Authors: Hui Chen, Zheng Li
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Based on 500 data (252 in Study One, 248 in Study Two) collected from China, this study investigated the structure of customer satisfaction in Web-based shopping environment. The author designed a model which can describe this structure after two related studies (Exploratory Factor Analysis was used in Study 1 and Confirmatory Factor Analysis was used in Study 2). Results showed there were 6 factors (Web framework and information, Logistic system, Service, Ease of use, Currency, and Security) in the structure of Chinese customer satisfaction in Web-based shopping environment. Besides, Logistic system was found to be a special factor which is extremely important to Chinese online shoppers .The author hopes these findings will give some help to researchers who study behavior of online shoppers.
Graphs-at-a-time: query language and access methods for graph databases
Authors: Huahai He, Ambuj K. Singh
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

With the prevalence of graph data in a variety of domains, there is an increasing need for a language to query and manipulate graphs with heterogeneous attributes and structures. We propose a query language for graph databases that supports arbitrary attributes on nodes, edges, and graphs. In this language, graphs are the basic unit of information and each query manipulates one or more collections of graphs. To allow for flexible compositions of graph structures, we extend the notion of formal languages from strings to the graph domain. We present a graph algebra extended from the relational algebra in which the selection operator is generalized to graph pattern matching and a composition operator is introduced for rewriting matched graphs. Then, we investigate access methods of the selection operator. Pattern matching over large graphs is challenging due to the NP-completeness of subgraph isomorphism. We address this by a combination of techniques: use of neighborhood subgraphs and profiles, joint reduction of the search space, and optimization of the search order. Experimental results on real and synthetic large graphs demonstrate that our graph specific optimizations outperform an SQL-based implementation by orders of magnitude.
N3logic: A logical framework for the world wide web
Authors: Tim Berners-lee, Dan Connolly, Lalana Kagal, Yosi Scharf, Jim Hendler
Venue: Theory and Practice of Logic Programming (2008)

The Semantic Web drives toward the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the Semantic Web provides a unifying representation of richly structured data. Adding logic to the Web implies the use of rules to make inferences, choose courses of action, and answer questions. This logic must be powerful enough to describe complex properties of objects but not so powerful that agents can be tricked by being asked to consider a paradox. The Web has several characteristics that can lead to problems when existing logics are used, in particular, the inconsistencies that inevitably arise due to the openness of the Web, where anyone can assert anything. N3Logic is a logic that allows rules to be expressed in a Web environment. It extends RDF with syntax for nested graphs and quantified variables and with predicates for implication and accessing resources on the Web, and functions including cryptographic, string, math. The main goal of N3Logic is to be a minimal extension to the RDF data model such that the same language can be used for logic and data. In this paper, we describe N3Logic and illustrate through examples why it is an appropriate logic for the Web.
Parameterized and programmable low power soft FIR filtering IP cores
Authors: Muhammad Akhtar Khan, A. T. Erdogan
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

In this paper, the authors present implementation of a number of low power FIR filter architectures to design reuse-able, programmable and parameterized soft FIR filter IP Cores and compare their performance in terms of area and power. An overall 22.1% power saving is achieved. The paper provides an analysis of the programmable cores and the impact of their constituent components on the overall power saving with different algorithms. The paper also presents analysis of power and area overhead due to the introduction of programmability in cores. The cores are fully parameterized and dynamically programmable up to 128 taps of filter. The programming can be done by just applying a load signal and loading the new coefficients in RAM. The loading of new coefficients will completely change the personality of filter without any hardware change and in this way programmability enhances the reusability of Cores. The design of cores is technology independent.
Isomorphic Cayley graphs on nonisomorphic groups
Authors: Joy Morris
Venue: Journal of Graph Theory (1999)

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 3: 345&ndash;362, 1999
E-commerce and E-commerce Fraud in Saudi Arabia: A Case Study
Authors: Saleh Alfuraih
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This paper will discusses the potential market for e-commerce in Saudi Arabia, the current infrastructure available and plans for future infrastructure developments to better support the growing e-commerce marketplace. During a field trip to Saudi Arabia the following information was collected to describe the current situation of e-commerce in Saudi and to help determine its future. The choice of Saudi Arabia for this study arose from two factors, first: Saudi is a growing market for e-commerce and disputes; second: some important information was needed to be collected to test the proposed e-commerce taxonomy, and Saudi has less strict privacy rules.
Autonomous agent learning by a creativity optimization
Authors: Chi-Kin Chow, Hung-Tat Tsui
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In robot applications, the performance of a robot agent is measured by the quantity of award received from its responses to the environment. Many literatures define the response as either a state diagram or a neural network. For some robot applications, the duration and the cost of response evaluating are excessive. Therefore, it is necessary to use as few trials as possible to determine the optimal response. In this paper, a novel global optimization algorithm called "Creativity Optimization" is proposed to tackle this process of response learning. By introducing the concept of creativity, the algorithm can search for the optimum with fewer numbers of trials than those of other popular optimization techniques. Three benchmark functions are provided to illustrate the performance of the proposed algorithm. The results show that it can effectively search the global optima with fewer solution evaluations.
An Efficient Quorum-Based Fault-Tolerant Approach for Mobility Agents in Wireless Mobile Networks
Authors: Yeong-Sheng Chen, Chien-Hsun Chen, Hua-Yin Fang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In this paper, we propose an efficient quorum-based mechanism to the fault-tolerance problem in mobile IP protocol. In a network with N HAs, all the HAs are grouped into N quorums with logical circular structure. Every HA has backup quorums and divides the network that it manages into equal parts. According to the home address of the MN, each HA finds out the backup quorum in the network segment and stores the mobility bindings of the MN in backup HAs. When a HA crashes, the system will select the HA with minimum load from each backup quorum to take over the bindings of the faulty HA. In comparison with previous related works, our experimental results show that the proposed fault-tolerant protocol has many advantages: better system load balance, less latency for registration process, less system resource requirements, and no extra hardware cost.
Robust model selection using fast and robust bootstrap
Authors: Matias Salibian-Barrera, Stefan Van Aelst
Venue: Computational Statistics Data Analysis (2008)

Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function when measuring either the goodness-of-fit or the expected prediction error of each model. Furthermore, to avoid favoring over-fitting models, these two measures can be combined with a penalty term for the size of the model. The expected prediction error conditional on the observed data may be estimated using the bootstrap. However, bootstrapping robust estimators becomes extremely time consuming on moderate to high dimensional data sets. It is shown that the expected prediction error can be estimated using a very fast and robust bootstrap method, and that this approach yields a consistent model selection method that is computationally feasible even for a relatively large number of covariates. Moreover, as opposed to other bootstrap methods, this proposal avoids the numerical problems associated with the small bootstrap samples required to obtain consistent model selection criteria. The finite-sample performance of the fast and robust bootstrap model selection method is investigated through a simulation study while its feasibility and good performance on moderately large regression models are illustrated on several real data examples.
Error detection and concealment for video transmission using information hiding
Authors: Ayhan Yılmaz, A. Aydın Alatan
Venue: Image Communication (2008)

Video transmission over noisy channels makes error concealment an indispensable job. Utilization of data hiding for this problem provides a reserve information about the content at the receiver, while unchanging the transmitted bit-stream syntax; hence, improves the reconstructed video quality with almost no extra channel utilization. A spatial domain error concealment technique, which hides edge orientation information of a block, and a resynchronization technique, which embeds bit-length of a block into other blocks are composed. The proposed method also exploits these two techniques for detecting errors via some extra parity information. Moreover, the motion vectors between consecutive frames are also embedded into the consecutive frames for better concealment at the receiver. Finally, as a novel approach, the bit-streams are further protected against errors via channel codes and the parity bits of these codes are embedded into other slices. In this manner, implicit utilization of error correction codes improves the reconstruction quality significantly. The simulation results show that the proposed approaches perform quite promising for concealing the errors in any compressed video bit-stream.
Defending against false-endorsement-based dos attacks in wireless sensor networks
Authors: Christoph Krauß, Markus Schneider, Claudia Eckert
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Node compromise is a serious threat in wireless sensor networks. An adversary can use compromised sensor nodes to inject false data to deceive the base station or he can try to deplete the energy resources of the sensor nodes. One approach to mitigate the impact of node compromise exploits the redundancy property of many wireless sensor networks. If a node initiates a report generation for the base station, then this report must be endorsed by multiple neighboring sensor nodes. Already proposed schemes using this approach introduce a new possible attack, called False-Endorsement-Based Denial of Service attack, where a compromised node sends a false endorsement which invalidates the collaboratively generated report. We propose an extension scheme, which enables the detection and exclusion of false endorsing nodes and is efficient in terms of storage and energy consumption.