ppxscal/embedding_network huggingface dataset:
Implementing Scenarios in a Smart Learning Environment
Authors: Christoph Burghardt, Christiane Reisse, Thomas Heider, Martin Giersich, Thomas Kirste
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Among the scenarios for pervasive learning are teleteaching andproject work. The former tries to deliver a lecture to adistributed audience, while the latter tries to enhance thelearning effect by concentrated collaboration. In this paper, we want to show how an ambient environment, designedto support teams in a meeting, can be used to support pervasive learning scenarios as well as meetings. The developed applications help the users in both types of scenarios with pro-active assistance, enabling the usersto focus on their task, rather than fiddling with the controlsof the devices.
System for Automated Aircraft Seat Floatation Device Inspection
Authors: Arun Ayyagari, Craig F. Battles, Brian J. Smith, Stephen A. Uczekaj, Kevin Y. Ung
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Airlines are governed by government and/or safety regulations that require each aircraft seat is properly equipped with a floatation device for use by the passenger in the unlikely event of a water landing. The current known aircraft inspection process to verify that each seat has the requisite floatation device is time consuming and labor intensive. The Boeing Company has defined and developed a radio frequency identification (RFID) based automated floatation device inspection system that leverages temporal and location awareness mechanisms to automate aircraft inspection process for floatation devices. The developed automated aircraft seat flotation device inspection system mitigates time consuming and labor intensive characteristics and thereby improves aircraft turn-around time and operational efficiencies.
Local statistical spatial analysis: Inventory and prospect
Authors: B. Boots, A. Okabe
Venue: International Journal of Geographical Information Science (2007)

The past decade has witnessed extensive development of measures that examine characteristics of spatial subsets (local spaces) defined with respect to a complete data set (global space). Such procedures have evolved independently in fields such as geography, GIS, cartography, remote sensing, and landscape ecology. Collectively, we label these procedures as local spatial methods. We focus on those methods that share a common goal of identifying subsets whose characteristics are statistically 'significant' in some way. We propose the concept of local spatial statistical analysis (LoSSA) both as an integrative structure for existing methods and as a framework that facilitates the development of new local and global statistics. By formalizing what is involved when a particular local statistic is used, LoSSA helps to reveal the key features and limitations of the procedure. These include a consideration of the nature of the spatial subsets, their spatial relationship to the complete data set, and the relationship between a given global statistic and the corresponding local statistics computed for the data set.
Iterative operator-splitting methods for linear problems
Authors: I. Farago, J. Geiser
Venue: International Journal of Computational Science and Engineering (2007)

The operator-splitting methods are based on splitting of the complex problem into a sequence of simpler tasks. A useful method is the iterative splitting method which ensures a consistent approximation in each step. In our paper, we suggest a new method which is based on the combination of the splitting time interval and the traditional iterative operator splitting. We analyse the local splitting error of the method. Numerical examples are given in order to demonstrate the method.
An efficient approach for identifying and storing syntactic and semantic sentence patterns in english natural language
Authors: Mansoor Al-A'ali
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

One of the most challenging difficulties in English Natural Language Processing is putting words and expressions into the context of the syntactic and semantic knowledge of the sentence. This paper presents an approach to learn the different sentence patterns of the Language which are kept in a knowledge base which can then be used for a variety of applications such as word and phrase predictions, syntactic and semantic checking of sentences. This paper demonstrates the approach.
Hybrid BIST optimization using reseeding and test set compaction
Authors: Gert Jervan, Elmet Orasson, Helena Kruus, Raimund Ubar
Venue: Microprocessors Microsystems (2008)

Classical built-in self-test (BIST) approaches are largely based on pseudorandom testing, and using linear feedback shift registers (LFSR) for test set generation and test response compaction. In this paper, we are concentrating on one possible extension of the classical BIST, namely hybrid BIST, where pseudorandom test patterns are complemented with pre-computed deterministic test patterns to increase the fault coverage and to reduce test time. We will propose a novel method for hybrid BIST optimization, based on reseeding and test set compaction. The objective is to minimize the test time at given test memory constraints, without losing test quality. We will compare the proposed method with hybrid BIST methods developed earlier and analyze its suitability for testing core-based systems.
The structure of local search diversity
Authors: Alexandre Linhares
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Discrete mathematicians, operations researchers and computer scientists have been developing local search models to solve combinatorial optimization problems for the last decades. A major concern in this development has been to keep the algorithms with a high level of search diversity. There is, however, a lack of precision and definition in what is actually meant by "local search diversity". Authors have continually referred to such terms without any attempt of actually defining or modeling diversity. We propose two metrics for a structure of diversity based on distance metrics between solutions. The first metric is an absolute one in that it measures the diversity of the explored solutions given the whole of the solution space. The second one considers the level of diversity that might be theoretically achievable under each specific number of solutions explored. Finally, a discussion of the computational complexity of the proposed metrics is also provided.
Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
Authors: Hans Daduna, Victor Pestien, S. Ramakrishnan
Venue: Queueing Systems: Theory and Applications (2008)

We consider networks where at each node there is a single exponential server with a service rate which is a non-decreasing function of the queue length. The asymptotic profile of a sequence of networks consists of the set of persistent service rates, the limiting customer-to-node ratio, and the limiting service-rate measure. For a sequence of cyclic networks whose asymptotic profile exists, we compute upper and lower bounds for the limit points of the sequence of throughputs as functions of the limiting customer-to-node ratio. We then find conditions under which the limiting throughput exists and is expressible in terms of the asymptotic profile. Under these conditions, we determine the limiting queue-length distributions for persistent service rates. In the absence of these conditions, the limiting throughput need not exist, even for increasing sequences of cyclic networks.
E-commerce adoption of travel and tourism organisations in South Africa, Kenya, Zimbabwe and Uganda
Authors: Tonderai Maswera, Ray Dawson, Janet Edwards
Venue: Telematics and Informatics (2008)

Africa, with its great wealth in wildlife and unique resorts, can benefit from the ever increasing user population of the Internet, particularly in the USA and Western Europe where most of the tourists to Africa come from (Internet World Stats, 2004. World Internet Users and Population Stats. .). A first survey was carried out to find the nature and extent of e-commerce adoption by tourism organisations from South Africa, Kenya, Zimbabwe and Uganda which are all popular tourist destinations in eastern and southern Africa. For comparison, a second survey of tourism organisations from USA and Western Europe was also carried out. A total of 373 websites from the four African countries and 180 from the USA and Western Europe were accessed and then evaluated against a list of e-commerce features. The surveys revealed that few of the African organisations are embracing e-commerce and that, although some websites were comparable to those of their western counterparts, the majority had room for considerable improvements. The African websites were found to be generally informative but lacked interactive facilities for online transactions. It is recommended that these African organisations evolve their websites into marketing tools to capitalise on the potential Internet market.
Tightening the upper bound for the minimum energy broadcasting
Authors: Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
Venue: Wireless Networks (2008)

In this paper we present a new upper bound on the approximation ratio of the Minimum Spanning Tree heuristic for the basic problem on Ad-Hoc Networks given by the Minimum Energy Broadcast Routing (MEBR). We introduce a newanalysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound [4], almost closing the gap with the lower bound of 6 [12].
Entry control in network-on-chip for memory power reduction
Authors: Dongwook Lee, Sungjoo Yoo, Kiyoung Choi
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

As high-end mobile embedded systems become data-intensive, the off-chip memory is becoming a major contributor to the total energy consumption. Especially, high-end mobile chips accommodate dedicated hardware blocks, e.g., codec and 3D graphics IP's, required for both performance and power consumption reasons. Those IP's usually do not have a large shared memory on chip. Thus, they communicate with each other via the off-chip DDR memory increasing off-chip memory accesses, which increases memory energy consumption during read/write operations. In this paper, we present a method of reducing memory energy consumption during read/write operations. It aims at minimizing the number of row opens and closes, which are the major source of energy consumption during read/write operations. The basic idea is to apply network entry control to prioritize consecutive open row memory accesses. The experimental results show up to 35% reduction in memory energy consumption with an industrial strength multimedia mobile SoC.
A note on embeddings of S4 and A5 into the two-dimensional Cremona group and Versal Galois covers
Authors: Shinzo Bannai Hiro-o Tokunaga
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

In this article, we prove that two versal Galois covers for S4 and A5 introduced in [17], [18] and [19] are birationally distinct to each other. As a corollary, we obtain two non-conjugate embeddings of S4 and A5 into Cr2(C).
Support set expansion sensitivity analysis in convex quadratic optimization
Authors: Kamal Mirnia, Alireza Ghaffari Hadigheh
Venue: Optimization Methods Software (2007)

In support set expansion sensitivity analysis, one concerns to find the range of parameter variation where the perturbed problem has an optimal solution with the support set that includes the support set of the given optimal solution of the unperturbed problem. In this article, we consider the perturbed convex quadratic optimization problem and present a method to identify the support set expansion sets for this problem.
Digraphs containing every possible pair of dicycles
Authors: Hong Wang
Venue: Journal of Graph Theory (2000)

Let D&thinsp;=&thinsp;(V, A) be a directed graph of order n&thinsp;&ge;&thinsp;4. Suppose that the minimum degree of D is at least (3n&thinsp;-&thinsp;3)-2. Then for any two integers s and t with s&thinsp;&ge;&thinsp;2, t&thinsp;&ge;&thinsp;2 and s&thinsp;+&thinsp;t&thinsp;&le;&thinsp;n, D contains two vertex-disjoint directed cycles of lengths s and t, respectively. Moreover, the condition on the minimum degree is sharp. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 154&ndash;162, 2000 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 criterion for filtering code clone related bugs
Authors: Yasuhiro Hayase, Yii Yong Lee, Katsuro Inoue
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

Software reviews are time-consuming task especially for large software systems. To reduce the efforts required, Li et al. developed CP-Miner, a code clone detection tool that detects identifier naming inconsistencies between code clones as bug candidates. However, reviewers using CP-Miner still have to assess many inconsistencies, since the tool also reports many false-positive candidates. To reduce the false-positive candidates, we propose a criterion for filtering the candidates. In our experiments, filtering with the proposed criterion removed 30% of the false-positive candidates and no true-positive candidates. This result shows that the proposed criterion helps the review task by effectively reducing the number of bug candidates.
Modeling Input Validation in UML
Authors: Pedram Hayati, Nastaran Jafari, S. Mohammad Rezaei, Saeed Sarenche, Vidyasagar Potdar
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Security is an integral part of most software systems but it is not considered as an explicit part in the development process yet. Input validation is the most critical part of software security that is not covered in the design phase of software development life-cycle resulting in many security vulnerabilities. Our objective is to extend UML to new integrated framework for model driven security engineering leading to ideal way to design more secure software. Input validation in UML has not been addressed previously, hence we incorporate input validation into UML diagrams such as use case, class, sequence and activity. This approach has some advantages such as preventing from common input tampering attacks, having both security and convenience in software at high level of abstraction and ability of solving the problem of weak security background for developers.
A gradually locating method of indoor locating estimation based on likelihood
Authors: Letian Ye, Zhihai Liu, Lingzhou Xue, Ping He, Zhi Geng
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Locating using wireless signal is a popular field now, and the real time indoor locating is a difficult problem for its complexity and sensitivity to environments. This paper proposes a gradually locating method based on Euclidean distance and the maximum likelihood, which maintains both Euclidean distance's robusticity and the maximum likelihood's high precision under complex environments. To reduce the number of supervised vertices in training data required by the grid-matching algorithm, this paper also presents an interpolation method based on the received signal strength (RSS) model in the local area, which successfully simulates the real signal distribution on the interpolation point. By using the above method, we can obtain unbiased locating result, and the locating can approach to the real position steadily as the amount of signals increases.
Comparing AMRIS and ODMRP in Ad-Hoc Networks by QualNet
Authors: Elham Mazinan, Zahra Arabshahi, Javad Adim
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Multicasting is the transmission of packets to a group of zero or more hosts identified by a single destination address. There are a considerable number of advantages in multicasting. It can significantly support various applications with some collaboration, typical for many ad-hoc applications currently envisioned. Within the wired network, well-established routing protocols exist to offer an efficient multicasting service. As nodes become increasingly mobile, these protocols need to evolve to similarly provide an efficient service in the new environment. This paper is mainly focusing on the performance of AMRIS and ODMRP as two proposed multicast protocol for ad-hoc network. AMRIS builds and maintains a multicast tree based on hard state information but ODMRP maintains a mesh based on soft state. Our results show that in many scenarios ODMRP achieves a higher packet delivery ratio, but results in much higher overheads.
Recommendation Quality Evolution Based on Neighbors Discrimination
Authors: Zied Zaier, Robert Godin, Luc Faucher
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

An “Automated Recommender System” plays an essential role in e-commerce applications. Such systems try to recommend items (movies, music, books, news, etc.) which the user should be interested in. The spectrum of proposed recommendation algorithms are based on information including content of the items, ratings of the users, and demographic information about the users. These systems hold the promise of delivering high quality recommendations. However, the incredible growth of users and applications bring some key challenges for recommender systems. One of the concerns in current recommenders is that the quality of recommendations is strongly dependant on the neighborhood size and quality. In this paper, we propose a new peer-to-peer architecture based on prior selection of the neighbors. We investigate the evolution of different recommendation techniques performance, coverage and quality of prediction. Also, we identify which recommendation method would be the most efficient with this new peer-to-peer architecture.
Ring of Masters (ROM): A new ring structure for Bluetooth scatternets with dynamic routing and adaptive scheduling schemes
Authors: Tarek Hassan, Ayman Kayssi, Ali Chehab
Venue: Pervasive and Mobile Computing (2008)

This paper attempts to address the scatternet problem in Bluetooth through a comprehensive approach. We propose a new decentralized ring structure to combat the formation of traffic bottlenecks. The adopted construction protocol ensures flexibility of node selection and a good level of fault tolerance. The routing protocol combines both simplicity and robustness by taking advantage of the ring structure and relying on the collective memory of piconets to make forwarding and discarding decisions. The intra- and inter-piconet scheduling algorithm, called ROM adaptive scheduling (RAS), dynamically allocates time slots and is responsive to the varying workload conditions. We demonstrate, through analysis and simulations, that the various components of ROM yield a system that has good performance in terms of throughput, latency, delivery, and link utilization.
Optimum forming of plates by application of boundary forces
Authors: Abdolreza Joghataie, Amin Heidarpour
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

For repair purposes, it was desired to study the problem of covering a square area by a plate of an arbitrary shape, through applying optimal tension and compression forces on the plate boundary so that the obtained square plate could carry as large as possible a uniformly distributed load on its surface. The plate was considered made up of steel. The technique might have broader applications especially in metal forming and the repair of cracks in plate structures.
Analyzing fault effects in the 32-bit OpenRISC 1200 microprocessor
Authors: Nima Mehdizadeh, Mohammad Shokrolah-Shirazi, Seyed Ghassem Miremadi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper presents an analysis of the effects and propagation of faults in the open-core 32-bit OpenRISC 1200 microprocessor. The analysis is based on a total of 13,000 transient faults injected into 65 parts of the CPU module in the OpenRISC 1200 core described at the RTL model. A comparison of the effects of faults on the various parts of the CPU including the pipeline’s registers, the CPU component such as the register file, the control unit, and the ALU, and the data and address buses is done. It is shown that about 30%, 40% and 27% of injected faults terminated in address, data, and control errors respectively. About 28% of all injected faults resulted in failures.
Adaptive log domain filters for system identification using floating gate transistors
Authors: Yiming Zhai, Pamela Ann Abshire
Venue: Analog Integrated Circuits and Signal Processing (2008)

We describe an adaptive log domain filter with integrated learning rules for model reference estimation. The system is a first-order low pass filter implemented using multiple input floating gate transistors operating in subthreshold to realize on-line learning of gain and cut-off frequency. We use adaptive dynamical system theory to derive robust control laws for gain and cut-off frequency adaptation in a system identification task. Simulation results show that convergence is slower using simplified control laws but still occurs within milliseconds. Experimental results confirm that the estimated gain and cut-off frequency track the parameters of the reference filter. The adaptive log domain filter has measured power consumption of 33 μW. During operation, deterministic errors are introduced by mismatch within the analog circuit implementation. An analysis is presented which attributes the errors to current mirror mismatch.
Approximating the traffic grooming problem in tree and star networks
Authors: Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Venue: Journal of Parallel and Distributed Computing (2008)

We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2ln(@d@?g)+o(ln(@d@?g)) for any fixed node degree bound @d and grooming factor g, and 2lng+o(lng) in unbounded degree directed trees, respectively. In the attempt to extend our results to general undirected trees, we completely characterize the complexity of the problem in star networks by providing polynomial time optimal algorithms for g@?2 and proving the intractability of the problem for any fixed g>2. While for general topologies, the problem was known to be NP-hard g not constant, the complexity for fixed values of g was still an open question.
Quadratic forms, pythagorean triples, and the equation Σxk=(Σx)2
Authors: Cordelia Aitkin, Thomas Colthurst, Kathryn Kollett, Steven Levandosky, Andrew Perry, Eugene Stern
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

We find all integer solutions to equation x13+x23+...+xn3=(x1+x2+...+xn)2 as well as to a generalized equation, in which cubes are replaced by arbitrary odd k-th powers. We then discuss how to generate positive integer solutions.