ppxscal/embedding_network huggingface dataset:
Revocation of privacy-enhanced public-key certificates
Authors: N. Zhang, Q. Shi, M. Merabti
Venue: Journal of Systems and Software (2005)

This paper presents a novel protocol for the revocation of privacy-enhanced/anonymous public-key certificates in relation to a protocol for anonymous public-key certificate issuing published previously. Not only can this certificate revocation protocol revoke an anonymous public-key certificate upon a request from its holder, but also automatically revoke any certificate issued directly or indirectly based on the certificate revoked, in an anonymous and accountable manner. In case the private key associated with an anonymous public-key certificate is suspected of having been compromised, the certificate holder can operate the protocol to easily revoke the compromised certificate together with its related ones so as to stop them being abused. The protocol is also assessed with regard to requirements such as accountability and anonymity.
Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach
Authors: Shoshana Anily, Michal Tzur
Venue: Transportation Science (2005)

We consider a system in which multiple items are transferred from a warehouse or a plant to a retailer through identical capacitated vehicles, or by identical freight wagons. Any mixture of the items may be loaded onto a vehicle. The retailer is facing dynamic deterministic demand for several items, over a finite planning horizon. A vehicle incurs a fixed cost for each trip made from the warehouse to the retailer. In addition, there exist item-dependent variable shipping costs and inventory holding costs at the retailer, which are both constant over time. The objective is to find a shipment schedule that minimizes the total cost, while satisfying demand on time.We address and partially resolve the question regarding the problem's complexity by introducing a dynamic programming algorithm whose complexity is polynomial for a fixed number of items, but exponential otherwise. Our dynamic programming formulation is based on properties satisfied by the optimal solution, and uses an innovative way for partitioning the problem into subproblems.
Texture Discrimination and Classification using Pulse Images
Authors: Guisong Wang, Jason Kinser
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Neural models of the mammalian visual cortex have been used in digital image processing for many years. The neural models have demonstrated a robust talent for extracting image segments that are inherent in the image. This paper will explore the use of a simple neural model for the extraction of texture information. The neural firing patterns in the model are dependent upon the input texture and by examining the neural patterns it is possible to classify the texture in the input image. Two applications presented here are the comparison of performance to other texture analysis techniques using two standard databases and the classification of texture regions in a medical image.
Fluency and completeness in instance-based natural language generation
Authors: Sebastian Varges
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A fundamental assumption underlying candidate ranking in corpus-based approaches to Natural Language Generation is the idea that in order to be fluent the output should be as similar to a (human-authored) corpus as possible. However, the goal of maximizing fluency can conflict with other goals, like conveying the maximal amount of input and being faithful. We employ an instance-based sentence generation system to investigate how the right balance between the different goals can be struck and show empirical results supporting our proposals.
Rapid Pose Estimation of Mongolian Faces using Projective Geometry
Authors: Li Hua-ming, Zhou Ming-quan, Geng Guo-hua
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

We present a new method to estimate the pose of human head from a monocular image in this paper. The method only uses a face model that formed by five points (four eye-corners and subnasale) in human face, does not need any auxiliary equipment. The estimation involves the research result of the anthropometry in the Mongolian race's feature we had obtained, and employs the theory of the projective geometry. We divide the pose computation into separate estimation of the orientation about X, Y and Z-axis, respectively. For the automatic detectionof these points, Active Appearance Models (AAM) is utilized in our experiment. It had been shown that the results of experiment were very close with actual rotational angles of human face. Especially when facial rotation in a naturally small angle, less than 30°, we can obtainthe approximate accurate value of rotational angles by using this method.
New high-speed frame detection method: Side Trace Algorithm (STA) for i-appli on cellular phones to detect watermarks
Authors: Atsushi Katayama, Takao Nakamura, Masashi Yamamuro, Noboru Sonehara
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

We developed a system that enables a camera-equipped cellular phone to read digital watermarks embedded in various media in real time, and that presents to the user a link to a Web page, video, or music associated with that watermark information. A picture captured by a camera is the result of applying a projective transformation combining rotation, scaling, and tilting to the original picture, The picture must be subjected to an inverse projective transformation prior to reading the watermark in order to return it to the same geometric form as the original picture. This inverse transformation requires transformation parameters, and the corners of the picture outline can be used as feature points for determining these parameters. In this paper, we propose a Side Trace Algorithm (STA) that reduces the processing time required to find corners of the picture less than 1/100 that when using the Hough transform and the conventional pattern matching, and present results of its implementation.
A Smooth Transition Model between Kinetic and Diffusion Equations
Authors: Pierre Degond, Shi Jin
Venue: SIAM Journal on Numerical Analysis (2004)

This paper presents a model which provides a smooth transition between a kinetic and a diffusion domain. The idea is to use a buffer zone, in which both diffusion and kinetic equations will be solved. The solution of the original kinetic equation will be recovered as the sum of the solutions of these two equations. We use an artificial connecting function which makes the equation on each domain degenerate at the end of the buffer zone. Thus no boundary condition is needed at the transition point. This model avoids the delicate issue of finding the interface condition or iteration in a typical domain decomposition method that couples a kinetic equation with hydrodynamic equations. A new asymptotic-preserving method for this model is introduced, and numerical examples are used to validate this new model and the new numerical method.
A dynamic foundational architecture for semantic web services
Authors: Brahim Medjahed, Athman Bouguettaya
Venue: Distributed and Parallel Databases (2005)

The combination of Web services and ontologies is gaining momentum as the potential silver bullets for tomorrow's Web, i.e., the Semantic Web. We propose an architectural foundation for managing semantic Web services in dynamic environments. We introduce the concept of community to cater for an ontological organization of Web services. We develop an ontology called community ontology that serves as a "template" for describing communities of Web services. We also propose a peer-to-peer approach for managing communities in dynamic environments.
Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace
Authors: Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Marina Mongiello, Francesco M. Donini
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper we present a Description Logic approach to extended matchmaking between Demands and Supplies in an Electronic Marketplace, which allows the semantic-based treatment of negotiable and strict requirements in the description.To this aim we exploit two novel non-standard Description Logic inference services, Concept Contraction -which extends satisfiability-and Concept Abduction -which extends subsumption.Based on these services we devise algorithms to find negotiation spaces and to determine the quality of a possible match, also in the presence of a distinction between strictly required and optional elements.
Feasibility study of convenient automatic identification system of medical articles using LF-band RFID in hospital
Authors: Ryosuke Hosaka
Venue: Systems and Computers in Japan (2004)

The number of medical accidents has recently been increasing in patient environments in Japan. Most of these accidents are ascribed to errors by nurses. Among these, however, are cases that could have been prevented by appropriate management of medical articles. In the patient environment, the patient is placed at the center, and medical articles are in a dependency relation to the patient. An accident may arise if such a dependency is not fulfilled. This paper proposes the use of low-frequency-band RFID tags in order to monitor the patient environment. In the proposed method, tags are attached to the patient and all related medical articles. By monitoring the tags at any time by wireless communications, mistaken inclusion of articles related to other patients can be avoided. In this system, tags are automatically identified, which avoids placing an extra burden on the nurses and other medical professionals. In this study, the identification performance of RFID tags is improved and the feasibility of their use as a practical system is verified by an experiment in an environment simulating an actual site. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 74&ndash;82, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10581
Designing and testing a control unit
Authors: Pierre A. von Kaenel
Venue: Journal of Computing Sciences in Colleges (2004)

A virtual CPU whose control unit is either hard-wired or microcoded and a software simulator of the CPU are presented. The simulator can be used in a computer organization or architecture course and requires students to design circuits to implement the microcode or to define a memory array to generate control signals that interpret a machine language program. Designing the control unit, especially when hard-wired, requires an understanding of circuits, Boolean algebra, Karnaugh maps, and machine language format and use.
VLSI Architecture for Lifting-Based Shape-Adaptive Discrete Wavelet Transform with Odd-Symmetric Filters
Authors: Chao-Tsung Huang, Po-Chih Tseng, Liang-Gee Chen
Venue: Journal of VLSI Signal Processing Systems (2005)

In this paper, a VLSI architecture for lifting-based shape-adaptive discrete wavelet transform (SA-DWT) with odd-symmetric filters is proposed. The proposed architecture is comprised of a stage-based boundary extension strategy and the shape-adaptive boundary handling units. The former could reduce the complexity of multiplexers that are introduced to solve the shape-adaptive boundary extension. The latter consists of two multiplexers and can solve the shape-adaptive boundary extension locally without any additional register. Two case studies are presented, including the JPEG 2000 default (9, 7) filter and MPEG-4 default (9, 3) filter. According to comparison results with previous architectures, the efficiency of the proposed architectures is proven.
DeDe: design and evaluation of a context-enhanced mobile messaging system
Authors: Younghee Jung, Per Persson, Jan Blom
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

This paper presents the design, implementation and validation of an enhanced mobile phone messaging system (DeDe), allowing the sender to define the context in which the message will be delivered to the recipient. A field trial among a socially tight group of teenagers showed that the DeDe feature was incorporated as part of the participants' existing messaging culture. 11,4% of their total messaging output made use of the DeDe feature. The most frequently used context parameters were location (based on network cell-ID) and time. Novel message practices emerged, as compared to 'normal' messaging, both in terms of timing of message sending, as well as creating content that specifically exploited the DeDe feature. Some use barriers were recognized, the most important being the sender's uncertainty of delivery success. Implications for design are discussed.
Transcoding media for bandwidth constrained mobile devices
Authors: Kevin Curran, Stephen Annesley
Venue: International Journal of Network Management (2005)

Bandwidth is an important consideration when dealing with streaming media. More bandwidth is required for complex data such as video as opposed to a simple audio file. When delivering streaming media, sufficient bandwidth is required to achieve an acceptable level of performance. If the information streamed exceeds the bandwidth capacity of the client the result will be 'choppy' and incomplete with possible loss of transmission. Transcoding typically refers to the adaptation of streaming content. Typical transcoding scenarios exploit content-negotiation to negotiate between different formats in order to obtain the most optimal combination of requested quality and available resources. It is possible to transcode media to a lesser quality or size upon encountering adverse bandwidth conditions. This can be accomplished without the need to encode multiple versions of the same file at differing quality levels. This study investigates the capability of transcoding for coping with restrictions in client devices. In addition, the properties of transcoded media files are examined and evaluated to determine their applicability for streaming in relation to a range of broad device types capable of receiving streaming media.
Interactive web usage mining with the navigation visualizer
Authors: Eelco Herder, Harald Weinreich
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Web usage mining, the analysis of user navigation paths through web sites, is a common technique for evaluating site designs or adaptive hypermedia techniques. However, often it is hard to relate aggregated clusters or measures to actual user navigation behavior. By contrast, basic graph-based visualizations of user navigation paths are easier to interpret, but it is difficult to find effective views that convey all the required information. In this paper we present the Navigation Visualizer, a web usage analysis tool that combines the two approaches. The Navigation Visualizer makes use of the rich data set that is collected by the Scone proxy-based web enhancement framework and facilitates dynamic selection of the data and interactive exploration with various layout mechanisms, color codings and markers. Several aggregated measures can be calculated and exported to statistical and data mining packages.
Don't take my folders away!: organizing personal information to get ghings done
Authors: William Jones, Ammy Jiranida Phuwanartnurak, Rajdeep Gill, Harry Bruce
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

A study explores the way people organize information in support of projects ("teach a course", "plan a wedding", etc.). The folder structures to organize project information - especially electronic documents and other files - frequently resembled a "divide and conquer" problem decomposition with subfolders corresponding to major components (subprojects) of the project. Folders were clearly more than simply a means to one end: Organizing for later retrieval. Folders were information in their own right - representing, for example, a person's evolving understanding of a project and its components. Unfortunately, folders are often "overloaded" with information. For example, folders sometimes included leading characters to force an ordering ("aa", "zz"). And folder hierarchies frequently reflected a tension between organizing information for current use vs. repeated re-use.
Evolution of grid computing architecture and grid adoption models
Authors: J. Joseph, M. Ernest, C. Fellenstein
Venue: IBM Systems Journal (2004)

During recent years, we have witnessed a major paradigm shift in distributed computing principles, with a focus towards service orientation, open standards integration, collaboration, and virtualization. One particular area of interest centers on the evolution of grid computing principles into the mainstream of distributed computing and Web services. In this paper, we focus our analysis on this evolution and the significance of achieving some form of standardization of grid-computing architecture principles. This paper presents the technology standards that are driving major grid initiatives and explains in simple terms how these standards and technologies are aligned with the IBM on demand business concepts. In addition, we discuss the recent Web services specifications related to stateful resources (i.e., resources whose behavior is defined with respect to their underlying state) and how these standards relate to grid computing. We conclude with discussions exploring major aspects of grid-computing adoption models and some significant attributes that influence the transformation, collaboration, and virtualization features of these models.
Misbehavior Detection in Clustered Ad-hoc Networks with Central Control
Authors: Spyridon Vassilaras, Dimitrios Vogiatzis, Gregory S. Yovanof
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Although individual node cooperation is necessary for the correct execution of network protocols in Mobile Ad-hoc Networks, it is not always guaranteed. Therefore, misbehavior detection and reputation mechanisms need to be implemented in order to reinforce node cooperation. In this paper, we address the issue of detecting non-cooperative behavior during packet forwarding in clustered mobile Ad-hoc networks which operate under the coordination and supervision of a central entity. The proposed solution uses end-to-end authenticated acknowledgments for every transmitted packet. Low computational overhead is achieved by employing an adapted version of the TESLA symmetric key broadcast authentication protocol.
Procedural security analysis of electronic voting
Authors: Alexandros Xenakis, Ann Macintosh
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Security is among the most important constraints in the implementation of electronic voting because, to date, commercially available technology does not provide a completely secure e-transaction environment. In this paper, we explore the issue of security of e-voting procedures, given the established limitations of technology. We examine security in the context of the increased complexity of multiple-channel voting, provided by a multiplicity of agents involved in the administration of e-elections. As previously suggested, security in e-voting has two aspects, the technical and the procedural one. In the course of interviews and observations conducted during the 2003 UK local government legally binding e-voting pilots we have identified several procedural security gaps and related procedural security measures. After defining the norms of procedural security in e-voting, we adopt an existing framework of e-voting security objectives and use it as an analytical tool to indicate the importance of the procedural aspect of security. In concluding we extend the use of procedural aspect of security. In concluding we extend the use of procedural security measures to the need for transparency in electronic voting and the development of trust and public confidence towards the newly introduced voting practices.
IEEE Internet Computing's 2005 Editorial Board Members
Venue: IEEE Internet Computing (2005)

Short biographies on our 2005 Editorial board members.
Adaptive recommendation: putting the best foot forward
Authors: John O'Donovan, John Dunnion
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Information is becoming increasingly available in digital formats such as Web Pages, MP3 files and many others. This puts more emphasis on the need for reliable information filtering techniques. New recommendation algorithms are continuously being developed to deal with the problem of information overload. In this paper we present a new, regression-based approach to the application of recommendation algorithms. We classify five different datasets based on a range of metrics, including sparsity, user-item ratio and the distribution of user ratings. From performance analysis tests of four predictive algorithms over these sets, we develop a regression function to predict the suitability of a particular recommendation algorithm for a previously unseen dataset. Our results show that the best-performing algorithm on the new set is the one predicted by our regression analysis.
Specialization of functional logic programs based on needed narrowing
Authors: María Alpuente, Salvador Lucas, Germán Vidal, Michael Hanus
Venue: Theory and Practice of Logic Programming (2005)

Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolution principle of logic languages. Needed narrowing is an optimal evaluation strategy which constitutes the basis of modern (narrowing-based) lazy functional logic languages. In this work, we present the fundamentals of partial evaluation in such languages. We provide correctness results for partial evaluation based on needed narrowing and show that the nice properties of this strategy are essential for the specialization process. In particular, the structure of the original program is preserved by partial evaluation and, thus, the same evaluation strategy can be applied for the execution of specialized programs. This is in contrast to other partial evaluation schemes for lazy functional logic programs which may change the program structure in a negative way. Recent proposals for the partial evaluation of declarative multi-paradigm programs use (some form of) needed narrowing to perform computations at partial evaluation time. Therefore, our results constitute the basis for the correctness of such partial evaluators.
DigSig: Runtime Authentication of Binaries at Kernel Level
Authors: Axelle Apvrille, David Gordon, Serge Hallyn, Makan Pourzandi, Vincent Roy
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

This paper presents a Linux kernel module, DigSig, which helps system administrators control Executable and Linkable Format (ELF) binary execution and library loading based on the presence of a valid digital signature. By preventing attackers from replacing libraries and sensitive, privileged system daemons with malicious code, DigSig increases the difficulty of hiding illicit activities such as access to compromised systems.DigSig provides system administrators with an efficient tool which mitigates the risk of running malicious code at run time. This tool adds extra functionality previously unavailable for the Linux operating system: kernel level RSA signature verification with caching and revocation of signatures.