ppxscal/embedding_network huggingface dataset:
New Database Operators for Sensor Networks
Authors: Seungjae Lee, Changhwa Kim, Sangkyung Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, researches on relational database approaches to sensor networks are being tried. There occur, however, some problems in applying directly the traditional relational database concepts into a sensor network in that every database operation is performed only on the real existing data which are tuples in database relations. The reason is because in a sensor network viewpoint situations under which some operations should be performed on non-existing data may occur frequently. For instance, Can we write a query to get temperature of a spot with no sensor node? Additionally, let us assume a sensor network that two different classes of nodes are scattered in the same area. We cannot get join results to know the relationship between two different classes of sensing values because there might be no nodes at a exact same location. For a solution about the above described problems we propose in this paper new database operators. This new database operators can provide more effective data management and standard interfaces to application programs in sensor networks.
Threshold Gate Approximations Based on Chow Parameters
Authors: R. O. Winder
Venue: IEEE Transactions on Computers (1969)

Seven methods are compared for deriving approximate realizing weights and threshold for a threshold function, given its Chow parameters. These include use of the parameters themselves, methods published by Dertouzos and the author, and several new methods. The comparison is made over all seven-argument self-dual threshold function types, and establishes a certain "geometric rule" as best. One third of the types were exactly realized by the approximation, and the average number of mistakes was very small.
Partition-based workload scheduling in living data warehouse environments
Authors: Maik Thiele, Ulrike Fischer, Wolfgang Lehner
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

The demand for so-called living or real-time data warehouses is increasing in many application areas such as manufacturing, event monitoring and telecommunications. In these fields users usually expect short response times for their queries and high freshness for the requested data. However, meeting these fundamental requirements is challenging due to the high loads and the continuous flow of write-only updates and read-only queries, which may be in conflict with each other. Therefore, we present the concept of Workload Balancing by Election (WINE), which allows users to express their individual demands on the Quality of Service and the Quality of Data respectively. WINE applies this information to balance and prioritize over both types of transactions -- queries and update -- according to the varying user needs. A simulation study shows that our proposed algorithm outperforms competitor baseline algorithms over the entire spectrum of workloads and user requirements.
Mobility management in all-IP two-tier cellular networks
Authors: Wen-Yen Lin, Jung-Shyr Wu
Venue: Computer Communications (2007)

The seamless internetworking among multiple heterogeneous networks is in demand to provide ''always-on'' connectivity services with QoS provision quality, anywhere, at any time. The hybrid two-tier networks can provide high data rate and enhanced multimedia services. Because they may have different MAC and PHY mechanism, there is a great challenge to provide QoS, seamless handover and suitable internetworking architecture. the next generation wireless networks will be a major move toward seamless high-quality wireless services that provides more and more data transmission capabilities using the IP packets. Therefore, the mobility management will enable different mobile networks to interoperate with each other to ensure terminal and personal mobility and global mobility services. In this paper, we will propose two mobility management schemes in two-tier cellular networks and compare the system performance. In addition, an overflow threshold is assumed in the mobility management scheme to avoid too many overflows occurred to reduce the blocking and dropping probabilities.
Tan-Like State Assignments ror Synchronous Sequential Machines
Authors: H. A. Curtis
Venue: IEEE Transactions on Computers (1973)

Recently, Tan developed a heuristic state assignment algorithm for asynchronous sequential machines. In this paper a state assignment algorithm based on Tan's is developed for synchronous sequential machines. It shares with Tan's algorithm the advantages of simplicity of execution and economy of logic elements in the resulting realizations.
Distributed CDMA-based MAC Protocol for Underwater Sensor Networks
Authors: Hwee-Xian Tan, Winston K. G. Seah
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Underwater Sensor Networks are typically distributed in nature and the nodes communicate using acoustic waves over a wireless medium. Such networks are characterized by long and variable propagation delays, intermittent connectivity, limited bandwidth and low bit rates. Due to the wireless mode of communication between the sensor nodes, a Medium Access Control (MAC) protocol is required to coordinate access to the shared channel and enable efficient data communication. However, conventional terrestrial wireless network protocols that are based on RF technologies cannot be used underwater. In this paper, we propose PLAN -- a MAC Protocol for Long-latency Access Networks that is designed for use in half-duplex underwater acoustic sensor networks. We utilize CDMA as the underlying multiple access technique, due to its resilience to multi-path and Doppler's effects prevalent in underwater environments, coupled with an RTS-CTS handshaking procedure prior to the actual data transmission. Using simulations, we study the performance and efficiency of the proposed MAC protocol in underwater acoustic networks.
Enhanced Appearance Models for Object Tracking
Authors: An Zhao, Michael J. Brooks, Anthony R. Dick
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper is concerned with improving target appearance models to realize robust object tracking. We explore the use of feature space other than the commonly used color space for object tracking. Specifically, we employ gradient information to be used separately as well as in conjunction with color information. Our target appearance model is then represented in the form of a histogram using its gradient and color feature spaces, and frame-to-frame tracking is performed using mean shift or local exhaustive search. By combining gradients with color, we build new appearance models with combined feature spaces. Based on our extensive testing of these models, we find that they can be used to track complex objects, such as full 360-degree rotating objects, appearance-changing objects, occluding objects and zooming objects.
A context type model for context-aware discovery of web services
Authors: Aimrudee Jongtaveesataporn, Twittie Senivongse
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

A service registry such as UDDI is an important component for service discovery in an open Web services environment. Service discovery is refined if the registry is context-aware, i.e. realising the contexts of the querying service consumers as well as the contexts of the published services and service providers. Such awareness results in better matchmaking and service consumers will obtain query results that match better with their requirements. This paper presents an approach to enhance the standard UDDI registry with the context awareness capability. A context type model is proposed to model relevant contexts of the service consumers, service providers, and published Web services. The contexts can be static or dynamic and are associated with the semantics for context evaluation. Meanings of contexts are also considered, based on relevant ontologies, for better interpretation of the context information. With this approach, the context-aware UDDI can discover Web services whose contexts fit well to the contexts of the consumers. An architecture that supports the context type model is also presented.
Clusters and Dialogues for Set Implementations
Authors: J. Katzenelson
Venue: IEEE Transactions on Software Engineering (1979)

The extensible set language (ESL) uses clusters for extending the set oriented language and for mapping the sets and their operators into base language data structure and operators. The main difficulty in this mapping is the dependency among clusters, i.e., the use of one data structure requires the modification or the constraint of another. The dialogue is a compile time procedure which is part of a cluster. It manipulates data structures and enables each cluster to appear independent; it also enables the user to choose one of a family of data implementations defmed by the cluster. Thus the dialogue makes it possible for a data structure to appear as a building block which can be used simply and flexibly.
RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks
Authors: Yilin Wang, Wenzhong Li, Jianzhong Chen, Sanglu Lu, Fang Wang, Daoxu Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Peer-to-Peer (P2P) technology has been widely applied in today's Internet. Unstructured P2P systems, where peers connect with each other to form dynamic, flexible and scalable networks, are commonly used for resource sharing. Resource location in unstructured P2P systems tends to use "blind search" strategies (i.e. flooding and random walk) for its simplicity and low maintenance cost. However, due to lack of location information, the performance of "blind search" is heavily relied on the network topology. Topology adaptation, by properly adjusting the topology of the P2P overlay network, is a promising approach to improve the search performance. In this paper, we use Relative Search Betweenness (RSB) to estimate nodes' search ability. A RSB-based topology adaptation algorithm (RSB-Topo) is proposed, where peers spontaneously adjust their connections to achieve better performance. Simulation results show that our algorithm could greatly increase search success rate and search coverage, and also decrease response delay to improve the search performance in unstructured P2P networks.
Two Sides of Structuring Multi-Functional Software Systems: Function Hierarchy and Component Architecture
Authors: Manfred Broy
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

We introduce a theory for the identification, modeling, and formalization of two methodologically essential, complementary views onto software and software intensive systems. One view addresses mainly tasks in requirements engineering when describing the overall system functionality from the users' point of view. By this view we aim at the specification of the comp rehensive user functionalities of multi-functional systems in terms of their functions, features, and services as well as their mutual dependencies. This view leads to a function or service hierarchy. The other view essentially addresses the design phase with its task to develop logical ar chitectures formed by networks of cooperating compone nts that are specified by their interface behavior.
Short coverings in tridimensional spaces arising from sum-free sets
Authors: E. L. Monte Carmelo, I. N. Nakaoka
Venue: European Journal of Combinatorics (2008)

Given a prime power q, define c(q) as the minimum cardinality of a subset H of the tridimensional space F"q^3 which satisfies the following property: every vector in this space differs in at most 1 coordinate from a multiple of a vector in H. On the basis of suitable actions of group, there is established a connection between sum-free sets and corresponding coverings. As an application of our method, there is constructed a class of short coverings which yields c(q)@?3(q+4)/4, improving the earlier upper bound c(q)@?q+1.
A Weighted Stego Image Detector for Sequential LSB Replacement
Authors: Andrew D. Ker
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

We describe a simple modification of the so-called Weighted Stego Image (WS) steganalysis method, due to Fridrich and Goljan, to detect sequential replacement of least significant bits. The most sensitive methods for the detection of bit replacement do not work well when the payload is concentrated at the start of the cover instead of being spread evenly over it, so this detector fills a gap in the literature. Experimental results show that the adapted method gives sequentially-embedded payload estimation typically 10 times more accurate than the standard WS method.
SmartSmooth: A linear time convexity preserving smoothing algorithm for numerically convex data with application to VLSI design
Authors: Sanghamitra Roy, Charlie Chung-Ping Chen
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Convex optimization problems are very popular in the VLSI design society due to their guaranteed convergence to a global optimal point. While optimizing tabular data, significant fitting efforts are required to fit the data into convex form. Fitting the tables into analytically convex forms like posynomials, suffers from excessive fitting errors, as the fitting problem may be non-convex. In recent literature optimal numerically convex tables have been proposed. Since these tables are numerical, it is extremely important to make the table data smooth, and yet preserve its convexity. The smoothness ensures that the convex optimizer behaves predictably and converges quickly to the global optimal point. The existing smoothing techniques either cannot preserve convexity, or require very high execution time. In this paper, we propose a linear time algorithm to smoothen a given numerically convex data and at the same time preserve convexity. Our proposed algorithm SmartSmooth can smoothen the data in linear time without introducing any additional error on the numerically convex data. We present our SmartSmooth results on industrial cell libraries. SmartSmooth when applied on convex tables produced by ConvexFit shows a 30 reduction in fitting square error over a posynomial fitting algorithm.
Opinion Mining in e-Learning System
Authors: Dan Song, Hongfei Lin, Zhihao Yang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

As an education pattern, e-learning systems are becoming more and more popular. For developing of e-learning systems, it is important to know users' opinions and evaluation about them. It is involved in applying the automatic text analysis to extract the opinions and adopting automatic sentiment analysis to identify the sentiment of opinions from the web pages on which users are discussing or describing their personal opinions and evaluation of the services. Conditional Random Fields is used for identifying and extracting the opinions. The negative sentences and degree adverbs are specially considered in sentiment processing. Then, we present the strength calculation for opinion sentiment orientation. The experiment shows that it is with high analysis precision on opinions extraction and sentiment analysis and helpful to e-learning system.
A Practical Model for Measuring Maintainability
Authors: Ilja Heitlager, Tobias Kuipers, Joost Visser
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

The amount of effort needed to maintain a software system is related to the technical quality of the source code of that system. The ISO 9126 model for software product quality recognizes maintainability as one of the 6 main characteristics of software product quality, with adaptability, changeability, stability, and testability as subcharacteristics of maintainability. Remarkably, ISO 9126 does not provide a consensual set of measures for estimating maintainability on the basis of a system's source code. On the other hand, the Maintainability Index has been proposed to calculate a single number that expresses the maintainability of a system. In this paper, we discuss several problems with the MI, and we identify a number of requirements to be fulfilled by a maintainability model to be usable in practice. We sketch a new maintainability model that alleviates most of these problems, and we discuss our experiences with using such as system for IT management consultancy activities.
Semiconductor Memories and Minicomputers
Authors: D. L. House
Venue: Computer (1971)

The effect of semiconductor memories on minicomputer organization is Just beginning to be felt. The high speeds and projected low cost of semiconductor memories will make them exceptionally attractive to the field of minicomputers but they may have an unexpected effect on the organization of the machines.
On the Analysis of Memory Conflicts and Bus Contentions in a Multiple-Microprocessor System
Authors: Kwok-Tung Fung
Venue: IEEE Transactions on Computers (1979)

This paper studies one of the most difficult and important problems in the design of cost-effective multiple-microprocessor systems. The combined effect of interference due to bus contentions and that due to memory conflicts is investigated. Reference models are defined and applied to obtain analytic results which can prove to be valuable tools in the design of multiple-microprocessor systems for time-critical control processes. The effect of memory mapping is also investigated and an algorithm is developed to obtain a mapping which can be used to minimize memory conflicts.
New Directions in Machine-Pattern Analysis
Authors: E. A. Parrish
Venue: Computer (1975)

The Fourth Machine Pattern Analysis Workshop, sponsored by the Machine Pattern Analysis Technical Committee of the IEEE Computer Society (formerly the Pattern Recognition Committee) and supported by the United States Postal Service, took place on March 3-5, 1975, with relatively little fanfare but a good deal of enthusiasm at the Asilomar Conference Grounds in Pacific Grove, California. Many of the participants were relics of the earlier meetings, but there were also a number of new faces.
A correlation-based model for unsupervised feature selection
Authors: Michael Edward Houle, Nizar Grira
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We propose a new model for feature evaluation and selection that assesses the propensity of the features to support two-set classification. For each item of the data set, the collection of features induce a ranking (ordered list) of the remaining items. The evaluation criterion favors features that result in the most consistent discrimination between relevant and non-relevant items within these ranked lists. The discrimination boundaries within a single list are determined combinatorially, according to the degree of correlation among the relevant sets of its members. The model makes no special assumptions on the nature of the data. A selection heuristic based on the model is also proposed using sequential forward generation, and an experimental comparison is made with other unsupervised feature selection methods.
Layered Diffusion based Coverage Control in Wireless Sensor Networks
Authors: Bang Wang, Cheng Fu, Hock Beng Lim
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Coverage is an important performance metric for many applications such as surveillance in Wireless Sensor Networks (WSNs). Coverage control is used to select as few active nodes as possible from all deployed sensor nodes such that sufficient coverage of the monitored area can be guaranteed, while reducing the energy consumption of each individual sensor node to prolong the network lifetime. This paper presents a distributed and localized technique called the Layered Diffusion based Coverage Control (LDCC). The LDCC protocol does not require information on the node location coordinates when selecting active nodes. Instead, it exploits the hop count information, which is easily obtained in a WSN, to select active sensor nodes. Furthermore, the LDCC protocol is very simple and does not require any sophisticated computation such as distance or covered area computation. Our simulation results show that the LDCC protocol achieves high coverage ratio while incurring very low message overhead compared with other existing protocols.
Programming wireless sensor networks with logical neighborhoods: a road tunnel use case
Authors: Luca Mottola, Gian Pietro Picco
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Wireless sensor networks (WSNs) involving actuation are increasingly envisioned in a range of fields. For instance, there is considerable interest in leveraging off WSNs to improve safety in road tunnels [3]. Researchers are envisioning tunnels equipped with WSN nodes that gather physical readings (e.g., light), monitor the structural integrity of the tunnel, and sense the presence of vehicles to detect a possible traffic congestion. Based on sensed data, the system operates a variety of devices, such as ventilation fans inside the tunnel, and traffic lights at the entrances. For instance, when a sensor detects the presence of a fire in a sector, the fans in the same sector are activated, and the traffic lights are turned red to prevent further vehicles from entering the tunnel.
New Travel Demand Models with Back-Propagation Network
Authors: Qian Zhou, Hua-pu Lu, Wei Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper explores the application of backpropagation network (BPN) to travel demand analysis. Models are developed to simulate travelers' inner-city behaviors and all of them adopt BPNs as main paradigm, for its virtue in non-linear analysis and prediction. Compared to the past researches, which were generally based on aggregate data, the models here are more comprehensive and developed based on disaggregate survey data. At first, three categories of models using BPNs are established to respectively realize trip generation, OD estimation and mode choice analysis-the first three steps in classical "four-step" models for travel demand forecasting. Furthermore, the integrated models are researched in two ways. One method is to use a simple combination of the former separate BPN models, and the other is to create a multilayer back-propagation network (MLBPN). Results show that BPN can be a feasible tool for travel demand analysis.
An Integrated Crosscutting Concern Migration Strategy and its Application to JHOTDRAW
Authors: Marius Marin, Leon Moonen, Arie van Deursen
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

In this paper we propose a systematic strategy for migrating crosscutting concerns in existing object-oriented systems to aspect-based solutions. The proposed strategy consists of four steps: mining, exploration, documentation and refactoring of crosscutting concerns. We discuss in detail a new approach to aspect refactoring that is fully integrated with our strategy, and apply the whole strategy to an object-oriented system, namely the JHOTDRAW framework. The result of this migration is made available as an open-source project, which is the largest aspect refactoring available to date. We report on our experiences with conducting this case study and re- flect on the success and challenges of the migration process, as well as on the feasibility of automatic aspect refactoring.