ppxscal/embedding_network huggingface dataset:
Data Consistency for Cooperative Caching in Mobile Environments
Authors: Jiannong Cao, Yang Zhang, Guohong Cao, Li Xie
Venue: Computer (2007)

A 3D framework provides a basis for designing, analyzing, and evaluating strategies to address data consistency issues in mobile wireless environments. A proposed relay-peer-based cache consistency protocol offers a generic and flexible method for carrying out cache invalidation.
The Registry for Sensor Network Discovery
Authors: Jeongkyu Park, Jiung Han, Kibong Kang, Keung Hae Lee
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

The sensor network service has emerged as a new technical research area. The sensor network service provides useful functions to the user by sensing the condition of physical entities. One important issue that is rarely addressed by current studies on the sensor network service is that they only use sensor-derived data to achieve local service goals. However, once external users can discover globally deployed sensor networks, the information which is created by such networks will be more expansible to various novel services. Recently, few studies have addressed the importance of sensor-derived data sharing, but they have not shown deep concern about ways to share sensor-derived data with external users. This paper proposes the sensor network registry for the sensor network registration and discovery. We explore the information that the sensor network registry should maintain in order to enable sensor network services to be shared, and also design the architecture of the system. We expect the sensor network registry will make sensor network technology more useful, just as a good Web search engine makes the Internet more useful.
Digital Technology and the Skills Shortage
Authors: Neville Holmes
Venue: Computer (2007)

The computing profession has the means to demolish the present skills shortage
Enhancing data locality in a fully decentralised P2P cycle stealing framework
Authors: Richard Mason, Wayne Kelly
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Peer-to-peer (P2P) networks such as Gnutella and Bit Torrent have revolutionised Internet based applications. P2P approaches provide a number of benefits, however most cycle stealing projects, such as SETI@home, have concentrated on centralised methods which still require massive amounts of concentrated network bandwidth in order to scale. More recent P2P research has developed the concept of distributed hash table (DHT) P2P overlays. These overlays provide efficient and guaranteed message delivery unlike earlier P2P networks which relied on large scale replication to probabilistically find data. Our G2:P2P framework makes use of a DHT overlay to provide a fully decentralised P2P cycle stealing system. Its distributed object programming model allows direct communication between objects and it remains reliable even as the set of peer nodes changes. In this paper we describe extensions to G2:P2P which allow us to optimise object distribution for locality. The importance of optimising data locality is well understood and has received extensive research, however, in the context of cycle-stealing systems and more generally DHT based P2P networks it is completely unexplored. Whilst our work is motivated by parallel programming, it is generic in nature and may have applicability to other DHT applications.
Non-parametric Mixture Model Based Evolution of Level Sets
Authors: Niranjan Joshi, Michael Brady
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We present a novel region based level set algorithm. We first model the image histogram with non-parametric mixture of probability density functions( PDFs). The individual densities are estimated using a recently proposed PDF estimation method which relies on a continuous representation of the discrete signals. Prior probabilities are calculated using an inequality constrained least squares method. The log ratio of the posterior probabilities is used to drive the level set evolution. We also take into account the image artifact called the partial volume effect, which is quite important in medical image analysis. Results are presented on natural as well as medical two dimensional images. Visual inspection of our results show the effectiveness of the proposed algorithm.
Cell-Locomotion-Based Agent Migration over Distributed Systems
Authors: Ichiro Satoh
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

This paper presents a middleware for multi-agents on a distributed system as a general test-bed for bio-inspired approaches. It is unique to other approaches, including distributed object systems, because it can maintain and migrate a dynamic federation of multiple agents on different computers. It enables each agent to explicitly define its own deployment policy as a relocation between itself and another agent. This paper describes a prototype implementation of the middleware and its practical applications to illustrate its utility and effectiveness in real distributed systems instead of using simulation-based evaluations.
Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices
Authors: V. M. Demidenko, A. Dolgui
Venue: Cybernetics and Systems Analysis (2007)

The paper describes new sufficient conditions that provide optimum to a quadratic assignment problem for a given substitution. The conditions separate out sets of matrices in the matrix space. The sets are formed by incomplete Anti-Monge matrices, which permit opposite ordering of rows and columns, and by additive monotone matrices, which are outside the class of Toeplitz matrices.
An integrated model of acoustics and language using semantic classification trees
Authors: E. Noth, R. De Mori, J. Fischer, A. Gebhard, S. Harbeck, R. Kompe, R. Kuhn, H. Niemann, M. Mast
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose multilevel semantic classification trees to combine different information sources for predicting speech events (e.g. word chains, phrases, etc.). Traditionally in speech recognition systems these information sources (acoustic evidence, language model) are calculated independently and combined via Bayes rule. The proposed approach allows one to combine sources of different types it is no longer necessary for each source to yield a probability. Moreover the tree can look at several information sources simultaneously. The approach is demonstrated for the prediction of prosodically marked phrase boundaries, combining information about the spoken word chain, word category information, prosodic parameters, and the result of a neural network predicting the boundary on the basis of acoustic-prosodic features. The recognition rates of up to 90% for the two class problem boundary vs. no boundary are already comparable to results achieved with the above mentioned Bayes rule approach that combines the acoustic classifier with a 5-gram categorical language model. This is remarkable, since so far only a small set of questions combining information from different sources have been implemented.
Filesystem daemons as a unifying mechanism for network information access
Authors: Steve Summit
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

As the Net burgeons, new tools and protocols are being introduced to permit some orderly use to be made of the wealth of information available. These new protocols, however, often presuppose the use of new, nonstandard, highly interactive user interfaces. This paper presents a mechanism for unifying access to diverse network services through filesystem daemons, which allow network information services to be treated as if they were conventional files and directories, residing in the local namespace, and accessed transparently with standard tools. Besides normal filesystem operations ("open", "read", "write", etc.), the daemons may introduce extended operations, which provide generic access to such features as network database lookup operations.
Power is Only Skin Deep: An Institutional Ethnography of Nurse-Driven Outpatient Psoriasis Treatment in the Era of Clinic Web Sites
Authors: Warren J. Winkelman, Nancy V. Davis Halifax
Venue: Journal of Medical Systems (2007)

We present an institutional ethnography of hospital-based psoriasis day treatment in the context of evaluating readiness to supplement services and support with a new web site. Through observation, interviews and a critical consideration of documents, forms and other textually-mediated discourses in the day-to-day work of nurses and physicians, we come to understand how the historical gender-determined power structure of nurses and physicians impacts nurses' work. On the one hand, nurses' work can have certain social benefits that would usually be considered untenable in traditional healthcare: nurses as primary decision-makers, nurses as experts in the treatment of disease, physicians as secondary consultants, and patients as co-facilitators in care delivery processes. However, benefits seem to have come at the nurses' expense, as they are required to maintain a cloak of invisibility for themselves and for their workplace, so that the Centre appears like all other outpatient clinics, and the nurses do not enjoy appropriate economic recognition. Implications for this negotiated invisibility on the implementation of new information systems in healthcare are discussed.
Blind channel and linear MMSE receiver determination in DS-CDMA systems
Authors: I. Ghauri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We consider p users in a DS-CDMA system operating asynchronously in a multipath environment. Oversampling w.r.t. the chip rate is applied to the cyclostationary received signal and multi-antenna reception is considered, leading to a linear multichannel model. Channels for different users are considered to be FIR and of possibly different lengths. We consider an individualized linear MMSE receiver for a given user, exploiting its spreading sequence and timing information. The blind determination of the receiver boils down to the blind channel identification. We explore blind channel identifiability requirements. Sufficiency of these requirements is established and it is shown that if zero-forcing conditions can be satisfied, then the CDMA channel (and hence the receiver) is identifiable with probability 1. It is also shown that linear MMSE receivers obtained by different criteria (including a new one) have the same identifiability requirements asymptotically in SNR.
A New Interactive Hashing Theorem
Authors: Iftach Haitner, Omer Reingold
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92), plays an important role in many cryptographic protocols. In particular, it is a major component in all known constructions of statistically-hiding commitment schemes and of zero-knowledge arguments based on general one-way permutations and on one-way functions. Interactive hashing with respect to a one-way permutation f, is a two-party protocol that enables a sender that knows y = f(x) to transfer a random hash z = h(y) to a receiver. The receiver is guaranteed that the sender is committed to y (in the sense that it cannot come up with x and x' such that f(x) \ne f(x') but h(f(x)) = h(f(x')) = z). The sender is guaranteed that the receiver does not learn any additional information on y. In particular, when h is a two-to-one hash function, the receiver does not learn which of the two preimages {y, y'} = h^{-1}(z) is the one the sender can invert with respect to f. This paper reexamines the notion of interactive hashing. We give an alternative proof for the Naor et. al. protocol, which seems to us significantly simpler and more intuitive than the original one. Moreover, the new proof achieves much better parameters (in terms of how security preserving the reduction is). Finally, our proof implies a more versatile interactive hashing theorem for a more general setting than that of the Naor et. al. protocol. One generalization relates to the selection of hash function h (allowing much more flexibility). More importantly, the theorem applies to the case where the underlying function f is hardto- invert only on some given (possibly sparse) subset of the output strings. In other words, the theorem is tuned towards hashing of a value y that may be distributed over a sparse subset of the domain (rather than uniform on the entire domain as a random output of a one-way permutation is). Our interest in interactive hashing is in part as a very appealing object (i.e., independent of any particular application). Furthermore, a major motivation for looking into interactive hashing is towards improving and simplifying previous constructions of statistical zero-knowledge and statistical commitments (that employ interactive hashing as a central building block). We make some preliminary progress in this direction as well.
ITC 2006 panels
Authors: Carol Stolicny
Venue: IEEE Design Test (2007)

The International Test Conference technical program has long included panel sessions that provide an informal, entertaining opportunity for ITC audiences to engage in discussion and debates with industry and research experts on a wide range of subjects. This tradition continued in a new venue in 2006 with an intriguing slate of panel sessions. In this column, the ITC 2006 panel organizers capture the deliberations and results from their respective panels for D&T readers who may not have had the opportunity to attend the conference or perhaps attended different, parallel panel discussions.
Modeling interactive 3D and multimedia animation with an embedded language
Authors: Conal Elliott
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

While interactive multimedia animation is a very compelling medium, few people are able to express themselves in it. There are too many low-level details that have to do not with the desired content-e.g., shapes, appearance and behavior-but rather how to get a computer to present the content. For instance, behaviors like motion and growth are generally gradual, continuous phenomena. Moreover, many such behaviors go on simultaneously. Computers, on the other hand, cannot directly accommodate either of these basic properties, because they do their work in discrete steps rather than continuously, and they only do one thing at a time. Graphics programmers have to spend much of their effort bridging the gap between what an animation is and how to present it on a computer. We propose that this situation can be improved by a change of language, and present Fran, synthesized by complementing an existing declarative host language, Haskell, with an embedded domain-specific vocabulary for modeled animation. As demonstrated in a collection of examples, the resulting animation descriptions are not only relatively easy to write, but also highly composable.
Robust pixel classification for 3D modeling with structured light
Authors: Yi Xu, Daniel G. Aliaga
Venue: Proceedings of Graphics Interface 2007 (2007)

Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences and reconstruct a densely sampled 3D model. In such structured light systems, determining whether a pixel is directly illuminated by the projector is essential to decoding the patterns. In this paper, we introduce a robust, efficient, and easy to implement pixel classification algorithm for this purpose. Our method correctly establishes the lower and upper bounds of the possible intensity values of an illuminated pixel and of a non-illuminated pixel. Based on the two intervals, our method classifies a pixel by determining whether its intensity is within one interval and not in the other. Experiments show that our method improves both the quantity of decoded pixels and the quality of the final reconstruction producing a dense set of 3D points, inclusively for complex scenes with indirect lighting effects. Furthermore, our method does not require newly designed patterns; therefore, it can be easily applied to previously captured data.
Can't Be Built
Authors: Richard P. Gabriel
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

"An ultra-large-scale (ULS) system is one that is impossible to build (today) because it exceeds some critical limit of today's software engineering technology." This means that only ULS systems of the past can be built. This logical problem provides the key for how to proceed.
Should I call now? understanding what context is considered when deciding whether to initiate remote communication via mobile devices
Authors: Edward S. De Guzman, Moushumi Sharmin, Brian P. Bailey
Venue: Proceedings of Graphics Interface 2007 (2007)

Requests for communication via mobile devices can be disruptive to the current task or social situation. To reduce the frequency of disruptive requests, one promising approach is to provide callers with cues of a receiver's context through an awareness display, allowing informed decisions of when to call. Existing displays typically provide cues based on what can be readily sensed, which may not match what is needed during the call decision process. In this paper, we report results of a four week diary study of mobile phone usage, where users recorded what context information they considered when making a call, and what information they wished others had considered when receiving a call. Our results were distilled into lessons that can be used to improve the design of awareness displays for mobile devices, e.g., show frequency of a receiver's recent communication and distance from a receiver to her phone. We discuss technologies that can enable cues indicated in these lessons to be realized within awareness displays, as well as discuss limitations of such displays and issues of privacy.
A smart virtual glove for the hand telerehabilitation
Authors: Giuseppe Placidi
Venue: Computers in Biology and Medicine (2007)

Hand rehabilitation, following stroke or hand surgery, is repetitive and long duration and can be facilitated with the assistance of complex, heavy and cumbersome haptic gloves based on sensors. The present paper describes a virtual glove, software based, which tracks hand movements by using images collected from webcams and numerical analysis. Finger forces are calculated from the deformations impressed to some objects (of known elastic coefficient) grasped by the patient hand. The presented system is notable for simplicity, generality and low cost. Implementation and results of the proposed virtual glove will be the objects of a future paper.
A Context-aware Reminding System for Daily Activities of Dementia Patients
Authors: Hua Si, Seung Jin Kim, Nao Kawanishi, Hiroyuki Morikawa
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Older people with dementia often decline in short-term memory and forget what to do next to complete their activities of daily living (ADLs), such as tea-making and toothbrushing. Therefore, they need caregivers to remind they what to do to complete these activities. However, the steady growth of aging population makes the (relatively) shortage of traditional care resources more and more serious. In this paper, we propose a prototype called CoReDA (Context-aware Reminding system for Daily Activities) to help elderly with dementia complete different ADLs instead of caregivers. By using the wireless sensor node - PAVENET, CoReDA can obtain elderly people's information of tool usage in different ADLs. Based on this information, CoReDA uses TD (\lambda) Q-Learning technique to provide elderly people their personalized guidance to complete ADLs.
User-friendly image sharing using polynomials with different primes
Authors: Ching-Nung Yang, Kun-Hsuan Yu, Rastislav Lukac
Venue: International Journal of Imaging Systems and Technology (2007)

Recently, Thien and Lin proposed a user-friendly (k, n)-threshold scheme which employs Lagrange interpolation to produce shadow images representing a shrunken version of the original image. In this paper, we introduce a new framework which uses more (k - 1)-degree polynomials with different primes to enhance the functionality of the user-friendly (k, n)-threshold framework and obtain more effective performance for large k. Since the proposed framework significantly reduces reconstruction errors compared to the previously published user-friendly schemes, it is suitable for modern visual communication applications where features such as distributed trust, secure transmission and storage, fault tolerance, and high-quality image reconstruction are required. &copy; 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 17, 40&ndash;47, 2007
A New Investigation on Edge detection Filters Operation for Feature Extraction under Histogram Equalization Effect
Authors: Gholamali Rezai-Rad, Houtan Haddad Larijani
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

A new investigation about one of the most important preprocessing steps so-called histogram equalization is proposed in this paper. We are about to probe effect of histogram equalization on operation of some useful edge detection filters. First for this reason, we applied specific edge detection filter on sample image, solely. For the next time before applying edge detector, we used histogram equalization to expand the gray level range of sample image and then applied edge detector. We have compared the consequences by means of standard deviation to mean ratio. It is demonstrated that minimum values for this ratio exhibit better gray level expansion and smoother edges. Finally, we have made a practical guide for researchers by our experimental results to choose proper edge detection filter for their special feature extraction work in presence of histogram equalization.
Disk drive level workload characterization
Authors: Alma Riska, Erik Riedel
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

In this paper, we present a characterization of disk drive workloads measured in systems representing the enterprise, desktop, and consumer electronics environments. We observe that the common characteristics across all traces are disk drive idleness and workload burstiness. Our analysis shows that the majority of characteristics, including request disk arrival rate, response time, service time, WRITE performance, and request size, are environment dependent. However, characteristics such as READ/WRITE ratio and access pattern are application dependent.
High Altitude Platform Station (HAPS): A Review of New Infrastructure Development for Future Wireless Communications
Authors: Anggoro K. Widiawan, Rahim Tafazolli
Venue: Wireless Personal Communications: An International Journal (2007)

This paper looks into the relatively new field of high altitude platform stations. HAPS is seen as a `middle ground' between the terrestrial and satellite cases, and aims to exploit of the advantages of both types of system. Since HAPS is such a new field, this paper focuses on the technology behind a HAPS communications system, how this has developed, and compares it to the terrestrial and satellite equivalents. One important area that is being investigated is the applications for which HAPS should be used. This is a critical issue if a significant business case is to be made for HAPS. Worldwide HAPS projects and research issues are also highlighted. Finally, the review concludes with the remarks on the future of HAPS for wireless communications systems.