ppxscal/embedding_network huggingface dataset:
Indoor Localisation of Humans, Objects, and mobile Robots with RFID Infrastructure
Authors: Jan Koch, Jens Wettach, Eduard Bloch, Karsten Berns
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The need for robust indoor localisation for all types of entities has been under continuous research by the ubiquitous community. Intelligent environments have to be supported with contextual information in order to facilitate intelligent behaviour. These contextual information include the location of humans and objects within the particular environment. Intelligent environments can be living areas with home automation, smart industrial plants, sensorequipped office areas and indoor-emergency applications. So far technical solutions are either quite expensive or lack of precision for robust usage as components in intelligent service federations. We present rather low-cost localisation systems with great scalability based on active and passive RFID technology to locate humans, mobile service robots and objects of the daily use. The trade-off between technical effort and costs on the one hand and sufficient data accuracy for the application on the other hand is discussed. A motivation of our scenario, the technical concept and solution as well as the implementation and the integration that so far have been performed will be presented. Current prototypes of the proposed system are already being tested in a project aiming on development of smart assisted living environments.
Optimization of Grid Resource Allocation Combining Fuzzy Theory with Generalized Assignment Problem
Authors: Li Mingbiao, Chen Xinmeng, Jiao Feng, Wu Zhijian
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In the existing economy based models of grid resource allocation and management, just as commodity market model and posted price model, sharing resource is based on negotiating about the usage duration or time, the usage fee, QoS (Quality of Service) and some other items between the owner or his broker and the consumer of grid resource. That will cost so much time for a great deal of grid users no matter whether they are grid resource owners or grid resource consumers, which reduced the sharing efficiency in the grid environment and some time is even unaccepted. In this paper, the idea of GRS (Grid Resource Supermarket) is introduced. Posted price model based on GRS and optimization based on GAP (Generalized Assignment Problem) are proposed. Our scheme can help to solve the problem in the previous description. In the end an example is given to show the feasibility of this scheme.
State Minimization of Incompletely Specified Sequential Machines
Authors: N. N. Biswas
Venue: IEEE Transactions on Computers (1974)

A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.
Tracking potential security violations
Authors: R. L. Lehmann
Venue: ACM SIGSAC Review (1981)

Security concerns not only involve providing restricted access to computer resources, but frequently require investigative studies to track suspicious utilization for potential company violations. For such studies it is important to have pertinent information for the entire job in order to trace what is being done. Sometimes very little information is available to use as a key for isolating the jobs in question. This paper describes a tool developed at Union Carbide Corp. to enhance such investigations on IBM MVS systems.
The isoperimetric constant of the random graph process
Authors: Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky
Venue: Random Structures Algorithms (2008)

The isoperimetric constant of a graph G on n vertices, i(G), is the minimum of |&part;S| / |S|, taken over all nonempty subsets S &sub; V (G) of size at most n/2, where &part;S denotes the set of edges with precisely one end in S. A random graph process on n vertices, G(t), is a sequence of $n \choose 2$ graphs, where $\tilde{G}(0)$ is the edgeless graph on n vertices, and $\tilde{G}(t)$ is the result of adding an edge to $\tilde{G}(t-1)$, uniformly distributed over all the missing edges. The authors show that in almost every graph process $i(\tilde{G}(t))$ equals the minimal degree of $\tilde{G}(t)$ as long as the minimal degree is o(log n). Furthermore, it is shown that this result is essentially best possible, by demonstrating that along the period in which the minimum degree is typically &tilde;(log n), the ratio between the isoperimetric constant and the minimum degree falls from 1 to $1\over 2$, its final value. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
The Web: For Sharing or Snaring?
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

Editor-in-chief Norman Chonacky explores Web technology and its implications for CiSE magazine, in particular.
An Augmented Iterative Array for High-Speed Binary Division
Authors: M. Cappa
Venue: IEEE Transactions on Computers (1973)

An augmented iterative array for binary division (IAD), is described. It uses carry-save reduction and carry-look-ahead principles to achieve high speed. Logic cost and speed comparisons with two other design techniques are presented. An 8-bit prototype model that operates in under 500 ns has been built from commercially available high-speed MSI TTL integrated circuits to verify the feasibility of the IAD scheme.
The Gamma Network
Authors: D. S. Parker
Venue: IEEE Transactions on Computers (1984)

The Gamma network is an interconnection network connecting N = 2n inputs to N outputs. It is a multistage network with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via "power of two" and identify connections in such a way that redundant paths exist between the input and output terminals. In this network, a path from a source to a destination may be represented using one of the redundant forms of the difference between the source and destination numbers. The redundancy in paths may thus be studied using the theory of redundant number systems. Results are obtained on the distribution of paths connecting inputs and outputs, and the permuting capabilities of the Gamma network. Frequently used permutations and control mechanisms are discussed briefly. We also perform a detailed terminal reliability analysis of the Gamma network, deriving expressions for the reliability between an input and output terminal.
A Novel Immunity-Growth Genetic Algorithm for Traveling Salesman Problem
Authors: Cong-wen Zeng, Tian-long Gu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

A novel genetic algorithm based on immunity and growth for the traveling salesman problem is presented in the paper. To start with, a reversal exchange crossover and mutation operator is proposed to preserve the good sub tours and to make individuals various. Next, a new immune operator is proposed to restrain individuals' degeneracy. In addition, a novel growth operator is proposed to obtain the optimal solution with more chances. Finally, we test the convergent rate of the algorithm and the best solution obtained by the algorithm after some generators. Experimental results show that the algorithm is feasible and effective.
Parametric model for video content analysis
Authors: Wei Chen, Yu-Jin Zhang
Venue: Pattern Recognition Letters (2008)

In this paper, we propose a parametric model for the video content analysis. We use the autoregressive (AR) modeling to model the frame feature sequence over time and make the future analysis in the AR parametric space. Based on our parametric framework, applications of detecting shot boundaries in video sequences, extracting key frames and combined spatial-temporal features for shot classification are proposed. Experiments show that our new parametric framework can present the video content better than the traditional color histogram.
A Basis for Setting Burn-in Yield Criteria
Authors: Anthony Van Den Heuvel, Noshir Khory
Venue: IEEE Design Test (1985)

This simple, useful, and practical approach to assess the cost benefits from using burned-in plastic ICs assumes a simpleapproximation for early life failure during burn-in and predicts the failure rate of the residual parts on the basis of yieldpercentage. Because product applications, end-user environment, and device quality vary, the simplicity of this method isobtained at the cost of some rigor. Nonetheless, the results are useful and are consistent with measured data.
N-gram Statistics in English and Chinese: Similarities and Differences
Authors: Stewart Yang, Hongjun Zhu, Ariel Apostoli, Pei Cao
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Chinese and English belong to two very different families of human languages. Yet, since the underlying human concepts are universal, one can expect that there are many statistical similarities between Chinese texts and English texts. In this paper, we present results of analyzing the quantity and frequency of N-grams in 200 million randomly-sampled English and Chinese web pages. The similarities and differences in N-gram frequency distributions yield important insights about the two languages. First, the distribution of the unique number of N-grams is similar between English and Chinese, yet the Chinese distribution is "shifted" to larger N. The distribution indicates that on average, 1.5 Chinese characters correspond to 1 English word. Second, while frequency distributions of uni-grams and bi-grams are very different between Chinese and English, the frequency distribution for 3-grams and 4- grams are strikingly similar between Chinese and English. This leads to the conjecture that in both languages, frequent 3-grams and 4-grams represent the same set of concepts and patterns.
Enhancing interoperability and stateful analysis of cooperative network intrusion detection systems
Authors: Michele Colajanni, Daniele Gozzi, Mirco Marchetti
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

A traditional Network Intrusion Detection System (NIDS) is based on a centralized architecture that does not satisfy the needs of most modern network infrastructures characterized by high traffic volumes and complex topologies. The of decentralized NIDS based on multiple sensors is that each of them gets just a partial view of the network traffic and this prevents a stateful and fully reliable traffic analysis. We propose a novel cooperation mechanism that the previous issues through an innovative state management and state migration framework. It allows multiple decentralized sensors to share their internal state, thus accomplishing innovative and powerful traffic analysis. The advanced functionalities and performance of the proposed cooperative framework for network intrusion detection systems are demonstrated through a fully operative prototype.
Building an Octree from a Set of Parallelepipeds
Authors: Wm. Franklin, Varol Akman
Venue: IEEE Computer Graphics and Applications (1985)

What do you call an algorithm designed to stack things up to build larger things? Why, STACK, of course.
On Using Classical Poetry Structure for Indian Language Post-Processing
Authors: A. Namboodiri, P. Narayanan, C. Jawahar
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Post-processors are critical to the performance of lan- guage recognizers like OCRs, speech recognizers, etc. Dictionary-based post-processing commonly employ either an algorithmic approach or a statistical approach. Other linguistic features are not exploited for this purpose. The language analysis is also largely limited to the prose form. This paper proposes a framework to use the rich metric and formal structure of classical poetic forms in Indian lan- guages for post-processing a recognizer like an OCR en- gine. We show that the structure present in the form of the vrtta and pr¯asa can be efficiently used to disambiguate some cases that may be difficult for an OCR. The approach is efficient, and complementary to other post-processing ap- proaches and can be used in conjunction with them.
QoS Performance Analysis in Deployment of DiffServ-aware MPLS Traffic Engineering
Authors: Dongli Zhang, Dan Ionescu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

It is a trend that the integrated voice, video and data will be transported in the converged IP/MPLS core network. The combined use of the differentiated services (DiffServ) and multiprotocol label switching (MPLS) technologies is envisioned to provide guaranteed quality of service (QoS). However, such a scheme only dictates per hop behavior (PHB) and it does not control the end to end path the traffic is taking. If some link of the path is congested, packets will be dropped and QoS can not be guaranteed. Another attractive application of MPLS is for Traffic Engineering (TE), which sets up end to end routing path before forwarding data. Unfortunately, MPLS TE only reserves resource in one aggregated class, so that it can not provide QoS for differentiated services. MPLS DiffServ-aware TE makes MPLS TE aware of QoS, by combining the functionalities of both DiffServ and TE. In this paper, the QoS performance is analyzed for different type of services including VoIP, Real time Video, and best effort data traffic. The results show that the guaranteed bandwidth service can give better QoS for real time traffic such as VoIP, but worse QoS for the variable video traffic.
A technical architecture for enforcing usage control requirements in service-oriented architectures
Authors: Agreiter Berthold, Muhammad Alam, Ruth Breu, Michael Hafner, Alexander Pretschner, Jean-Pierre Seifert, Xinwen Zhang
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

We present an approach to modeling and enforcing usage control requirements on remote clients in service-oriented architectures. Technically, this is done by leveraging a trusted software stack relying on a hardware-based root of trust and a trusted Java virtual machine to create a measurable and hence trust worthy client-side application environment. We define a model-driven approach to specifying remote policies that makes the technical intricacies of the target platform transparent to the policy modeler.
Cache tables: paving the way for an adaptive database cache
Authors: Mehmet Altinel, Christof Bornhövd, Sailesh Krishnamurthy, C. Mohan, Hamid Pirahesh, Berthold Reinwald
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We introduce a new database object called Cache Table that enables persistent caching of the full or partial content of a remote database table. The content of a cache table is either defined declaratively and populated in advance at setup time, or determined dynamically and populated on demand at query execution time. Dynamic cache tables exploit the characteristics of typical transactional web applications with a high volume of short transactions, simple equality predicates, and 3-4 way joins. Based on federated query processing capabilities, we developed a set of new technologies for database caching: cache tables, "Janus" (two-headed) query execution plans, cache constraints, and asynchronous cache population methods. Our solution supports transparent caching both at the edge of content-delivery networks and in the middle-tier of an enterprise application infrastructure, improving the response time, throughput and scalability of transactional web applications.
Text Mining and Expert Systems Applied in Labor Laws
Authors: Antonio Alexandre Mello Ticom
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Based on the technological evolution of data processing, mainly the capacity of processing and storage, a new research field has emerged, called Knowledge Discovery in Database (KDD). Data mining (DM) is the essential and important step in the process of KDD with the goal of extracting high-level knowledge from low-level data. Unstructured DM or Text Mining is an essential part of discovering previously unknown patterns useful for particular purposes from textual data bases. The objective of this paper is to present a Labor- related Judicial application of Unstructured Data Mining techniques using probabilistic methodologies, linear regression and Rule Induction in Text Categorization, as well as an Expert System. Key words expert systems, text mining, classification, decision rules.
Finding Frequent Items in SlidingWindows over Data Streams Using EBF
Authors: ShuYun Wang, HeXiang Xu, YunFa Hu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper introduces the algorithm FIS-EBF for estimating the frequent items in sliding windows over data streams. FIS-EBF is Based the data structure named EBF(extensible Bloom Filter). Experiments show that FISEBF can work with high precision and recall, it is also showed that FIS-EBF is very efficient in terms of processing time.
Computation of the Hadamard Transform and the R- Transform in Ordered Form
Authors: L. J. Ulman
Venue: IEEE Transactions on Computers (1970)

This correspondence describes a method of computing the Hadamard transform and the R-transform. This method produces the transform components in the order of the increasing sequency of the Walsh functions represented by the rows of a symmetric Hadamard matrix for which the sequency of each row is larger than the sequency of the preceding row.
Update exchange with mappings and provenance
Authors: Todd J. Green, Grigoris Karvounarakis, Zachary G. Ives, Val Tannen
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over related data from other peers as well. To achieve this, every peer's updates propagate along the mappings to the other peers. However, this update exchange is filtered by trust conditions --- expressing what data and sources a peer judges to be authoritative --- which may cause a peer to reject another's updates. In order to support such filtering, updates carry provenance information. These systems target scientific data sharing applications, and their general principles and architecture have been described in [20]. In this paper we present methods for realizing such systems. Specifically, we extend techniques from data integration, data exchange, and incremental view maintenance to propagate updates along mappings; we integrate a novel model for tracking data provenance, such that curators may filter updates based on trust conditions over this provenance; we discuss strategies for implementing our techniques in conjunction with an RDBMS; and we experimentally demonstrate the viability of our techniques in the ORCHESTRA prototype system.
Relaying Packets in a Two-tiered Wireless Network Using Binary Integer Programming
Authors: Wenxuan Guo, Xinming Huang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Relay transmissions improve performance and save communication energy in wireless network. We present an optimal relay nodes assignment algorithm to maximize the number of information packets received at the sink for a two-tiered wireless network, in which the relay nodes are temporarily placed and have energy constraint. We first derive the optimal transmit power theory from relay node to sink node. Provided the limited energy at the relay nodes, we prove that the total transmission periods or the relay network lifetime is fixed. Subsequently, we determine the optimal dynamic association between edge nodes and relay nodes (multiple-to-one mapping) using binary integer programming (BIP). Experimental results show that the proposed method has significantly better performance than two other schemes in terms of the total number of information packets received at the sink. Combined with the optimal relay transmit power technique, the two-tiered wireless network can achieve the highest capacity considering the energy constraint of relay nodes.
Research on Topology Discovery for IPv6 Networks
Authors: Junhai Luo, Mingyu Fang, Danxia Ye
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

With some new features introduced by IPv6 network, such as a wider address space, a different scope based on addressing scheme, a modified protocol field and so on, IPv6 topology discovery faces some challenging problems. And many of topology discovery algorithms developed to collect IPv4 network topology information can not be readily applied to IPv6 network. In this paper, a few problems generated by IPv6 network, some methods and algorithms for IPv6 network topology discovery are discussed in detail. Their advantages and disadvantages are fully summarized. Finally, the new problems and some suggestions for the research work are put forward.
An RBF Network Based Beamformer for Mimo Wireless Communication Systems
Authors: Ling Zhang, X. Z. Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we propose a beamforming scheme based on a radial basis function (RBF) network for multiple input multiple output (MIMO) wireless communication systems. The RBF network is an effective forward neural network, which has the advantages of easy training and fast convergence rate. This RBF network beamforming technique performs better than the higher order statistics based beamformer.
Number of Faults per Line of Code
Authors: M. Lipow
Venue: IEEE Transactions on Software Engineering (1982)

In this note, the number of faults or "bugs" per line of code is estimated based upon Halstead's software science relationships. This number is shown to be an increasing function of the number of lines of code in a program, a result in agreement with intuition and some current theories of complexity. The form of this function is investigated and an easy-to-use approximation is developed. An application to a moderately large software project is shown in which the predicted number of faults for program modules of various sizes agrees fairly well with the actual numbers of faults discovered.
Compressing table data with column dependency
Authors: Binh Dao Vo, Kiem-Phong Vo
Venue: Theoretical Computer Science (2007)

Tables are two-dimensional arrays given in row-major order. Such data have unique features that could be exploited for effective compression. For example, tables often represent database files with rows as records so certain columns or fields in a table may have few distinct values. This means that simply transposing the data can make it compress better. Further, a large source of information redundancy in a table is the correlation among columns representing related types of data. This paper formalizes the notion of column dependency as a way to capture this information redundancy across columns and discusses how to automatically compute and use it to substantially improve table compression.