ppxscal/embedding_network huggingface dataset:
Piloting RFID Along the Supply Chain: A Case Analysis
Authors: Claudia Loebbecke
Venue: Electronic Markets (2007)

The paper examines a project utilizing Radio Frequency Identification (RFID) systems between a department store chain (Kaufhof) and a fashion goods manufacturer (Gerry Weber). It analyses the project according to the '5 Ps' of RFID, a concept, proposed by Loebbecke and Palmer (2006b), which suggests that firms considering RFID should investigate: the Physics of the transponder, the reader, and the data transfer; the Processes being changed and enhanced, the Prices for technical components and their installation, the Privacy aspects of capturing and retaining customer data, and the Performance impacts, the business case contribution of RFID implementations. The paper shows project results which support the business case for RFID adoption with benefits for both project partners and the entire supply chain. It concludes with a brief summary and an outlook to future research opportunities in the emerging RFID field.
Knowledge-based organization evaluation
Authors: Liang-Chuan Wu, Chorng-Shyong Ong, Yao-Wen Hsu
Venue: Decision Support Systems (2008)

Knowledge has become the main value driver for modern organizations. In particular, knowledge-based organizations (KBOs) allocate resources to intangible assets (e.g., R&D) in the rapidly changing and highly competitive business environment in order to gain competitive advantages. Therefore, how to evaluate knowledge-based organizations has become one of the most important issues in knowledge management. The purpose of this paper is to provide a framework for the evaluation of KBOs under uncertainty, using the state-of-the-art methodology of Real Options. We define the unique features of KBOs and explain their value drivers. The present study's contribution is threefold: (1) it bridges the gaps in knowledge management literature related to evaluating knowledge capital; (2) it provides a systematic application of Real Options models in the context of knowledge-based organization evaluation; and, (3) it uses a real-world case to demonstrate the implications of the main findings for management.
Delegating computation: interactive proofs for muggles
Authors: Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time, or in other words a "muggle". The verifier should be super-efficient and run in nearly-linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result's correctness in nearly-linear time (instead of running the entire computation itself). Previously, related questions were considered in the Holographic Proof setting by Babai, Fortnow, Levin and Szegedy, in the argument setting under computational assumptions by Kilian, and in the random oracle model by Micali. Our focus, however, is on the original interactive proof model where no assumptions are made on the computational power or adaptiveness of dishonest provers. Our main technical theorem gives a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth d and input length n. The verifier runs in time (n+d) • polylog(n) and space O(log(n)), the communication complexity is d • polylog(n), and the prover runs in time poly(n). In particular, for languages computable by log-space uniform NC (circuits of polylog(n) depth), the prover is efficient, the verifier runs in time n • polylog(n) and space O(log(n)), and the communication complexity is polylog(n). Using this theorem we make progress on several questions: We show how to construct short (polylog size) computationally sound non-interactive certificates of correctness for any log-space uniform NC computation, in the public-key model. The certificates can be verified in quasi-linear time and are for a designated verifier: each certificate is tailored to the verifier's public key. This result uses a recent transformation of Kalai and Raz from public-coin interactive proofs to one-round arguments. The soundness of the certificates is based on the existence of a PIR scheme with polylog communication. Interactive proofs with public-coin, log-space, poly-time verifiers for all of P. This settles an open question regarding the expressive power of proof systems with such verifiers. Zero-knowledge interactive proofs with communication complexity that is quasi-linear in the witness, length for any NP language verifiable in NC, based on the existence of one-way functions. Probabilistically checkable arguments (a model due to Kalai and Raz) of size polynomial in the witness length (rather than the instance length) for any NP language verifiable in NC, under computational assumptions.
Performance analysis in the real world
Authors: John R. Douceur
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

What issues are on the minds of industrial performance analysts? Four representatives of world-class product organizations will describe their work at the front lines of measurement, modeling, and performance tuning. Topics will include performance engineering of middleware at IBM, tools for detecting false sharing in large-scale multiprocessors at Hewlett-Packard, kernel thread-scheduling performance in multiprocessors at Microsoft, and low-overhead instrumentation for profiling large-scale services at Google. Plenty of time will be available to ask questions about how to direct our research to have the greatest impact on industrial practice.
User adaptation: good results from poor systems
Authors: Catherine L. Smith, Paul B. Kantor
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Several recent studies have found only a weak relationship between the performance of a retrieval system and the "success" achievable by human searchers. We hypothesize that searchers are successful precisely because they alter their behavior. To explore the possible causal relation between system performance and search behavior, we control system performance, hoping to elicit adaptive search behaviors. 36 subjects each completed 12 searches using either a standard system or one of two degraded systems. Using a general linear model, we isolate the main effect of system performance, by measuring and removing main effects due to searcher variation, topic difficulty, and the position of each search in the time series. We find that searchers using our degraded systems are as successful as those using the standard system, but that, in achieving this success, they alter their behavior in ways that could be measured, in real time, by a suitably instrumented system. Our findings suggest, quite generally, that some aspects of behavioral dynamics may provide unobtrusive indicators of system performance.
Adaptive active network control and management system (AANCMS)
Authors: Mahdi Jalili-Kharaajoo
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper, the general architecture of adaptive control and management in active networks is presented. The proposed Adaptive Active Network Control and Management System (AANCMS) merges technology from network management and distributed simulation to provide a unified paradigm for assessing, controlling and designing active networks. AANCMS introduces a framework to assist in managing the substantial complexities of software reuse and scalability in active network environments. Specifically, AANCMS provides an extensible approach to the dynamic integration, management, and runtime assessment of various network protocols in live network operations.
Minor-universal planar graphs without accumulation points
Authors: Daniela Kühn
Venue: Journal of Graph Theory (2001)

We show that the countably infinite union of infinite grids, H say, is minor-universal in the class of all graphs that can be drawn in the plane without vertex accumulation points, i.e., that H contains every such graph as a minor. Furthermore, we characterize the graphs that occur as minors of the infinite grid by a natural topological condition on their embeddings. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 36: 1&ndash;7, 2001
Annotation contextuelle automatique avec PhotoMap
Authors: Windson Viana, Marlène Villanova-Oliver, Jérôme Gensel, Hervé Martin
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

We present a mobile and context-aware system, called PhotoMap that provides semi-automatic annotation about the spatial, temporal and social contexts of a photo. (i.e., where, when, who and what was nearby). The PhotoMap application captures the photo shot context when a user takes a picture with her camera phone. The mobile client gets the geographic position of the device, date and time information, bluetooth addresses of the nearby devices. PhotoMap explores these gathered metadata to infer high level contextual information such as, nearby user's friends, weather conditions, device address, and nearby important objects. PhotoMap uses these metadata for organizing, sharing and retrieving the photo files.
A Method to Define an Object Oriented Software Process Architecture
Authors: Beatriz Terezinha Borsoi, Jorge Luis Risco Becerra
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Nowadays there are systems to enact processes, but only technology is not enough to help software processes achieve their goals, specially those related to product quality, costs and schedule. Before process enactment, it is necessary to define and represent process models so that they reflect business aspects, are understood by all stakeholders, and are adjusted to software development processes and software factories characteristics. To correspond to these criteria, in this paper a method is proposed aiming to define an object oriented process architecture. This method helps to define process models that can be specialized to meet the needs of distinct organizations and software development processes. The result of this research is a method composed of a set of activities divided into phases to define process models at distinct abstraction levels.
Designing routes for source coding with explicit side information in sensor networks
Authors: Huiyu Luo, Gregory J. Pottie
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In this paper, we study the problem of designing routes for source coding with explicit side information (i.e., with side information at both the encoder and the decoder) in sensor networks. Two difficulties in constructing such data-centric routes are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of routing and in-network data fusion. Our data aggregation model is built upon the observation that in many physical situations the side information providing the most coding gain comes from a small number of nearby sensors. Based on this model, we formulate an optimization problem to minimize the communication cost, and show that finding the exact solution of this problem is NP-hard. Subsequently, two suboptimal algorithms are proposed. One is inspired by the balanced trees that have small total weights and reasonable distance from each sensor to the fusion center [6]. The other separately routes the explicit side information to achieve cost minimization. Bounds on the worst-case performance ratios of two methods to the optimal solution are derived for a special class of rate models, and simulations are conducted to shed light on their average behaviors.
Scrambling for students: our graduates are sexier than yours
Authors: Alison Young, Arnold Pears, Pedro de Miguel Anasagasti, Ralf Romeike, Michael Goldweber, Michael Goldwasser, Vicki Almstrum
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

Teams representing the USA and Europe engage in a battle of words and wits to establish "once and for all" which educational system produces the superior outcome. This "no holds barred" debate leaves no stone unturned in a search for truth on this question, providing a final answer to a controversy that has plagued our community since the inception of computing itself. Witness this historic moment in the history of CS education first hand!
Dynamic avalanche in diodes with local lifetime control by means of palladium
Authors: J. Vobecký, P. Hazdra
Venue: Microelectronics Journal (2008)

The increase of the static breakdown voltage and the reduction of dynamic avalanche in a fast recovery 2.5kV/150A P-i-N diode subjected to the radiation enhanced diffusion of a palladium are discussed. The in-diffusing palladium compensates the doping profile in a lightly doped N-base close to the anode junction. Using a device simulation, the increase of the breakdown voltage and the reduction of the dynamic avalanche are explained by the reduction of peak electric field in the additional low-doped P-type layer created by the compensation effect. This is presented for both a dc and transient device operation and confirmed experimentally as well. An improved technology curve for the static versus recovery losses at a high line voltage has been obtained. A high thermal budget of deep levels and a low leakage current are additional benefits of the method.
Access control management for ubiquitous computing
Authors: Hua Wang, Yanchun Zhang, Jinli Cao
Venue: Future Generation Computer Systems (2008)

The purpose of ubiquitous computing is anywhere and anytime access to information within computing infrastructures that is blended into a background and no longer be reminded. This ubiquitous computing poses new security challenges while the information can be accessed at anywhere and anytime because it may be applied by criminal users. Additionally, the information may contain private information that cannot be shared by all user communities. Several approaches are developed to protect information for pervasive environments against malicious users. However, ad hoc mechanisms or protocols are typically added in the approaches by compromising disorganized policies or additional components to protect from unauthorized access. In this paper, we present a usage control model to protect services and devices in ubiquitous computing environments, which allows the access restrictions directly on services and object documents. The model not only supports complex constraints for pervasive computing, such as services, devices and data types but also provides a mechanism to build rich reuse relationships between models and objects. Finally, comparisons with related works are analysed.
The application of surface demoldability and moldability to side-core design in die and mold CAD
Authors: M. W. Fu
Venue: Computer-Aided Design (2008)

In casting, molding and forming processes, the surface geometries of the fabricated products are formed/molded by different functional components of tooling. In plastic injection molding, they are molded by core, cavity or side-cores. In die and mold CAD, how to identify the product surfaces formed/molded by the corresponding tool components for a given product CAD model is critical, as it affects the determination of parting directions, parting lines and parting surfaces, the generation of core and cavity blocks, and finally the design of side-cores and their actuating mechanisms. In this paper, the concepts of surface visibility, demoldability, and moldability are first presented and formulated. The surfaces formed/molded by core, cavity and side-cores are then defined based on the plastic injection molding process. The methodology to identifying and classifying them is further developed. By employing the proposed notions of the demoldability map of surfaces and undercut features, the most preferred demolding direction, the grouping of undercut features, and how to conduct the side-core design is articulated succinctly, and the detailed procedures and processes are presented. Through an industrial case study, the developed methodology for side-core design is systematically presented and the feasibility of the developed approaches is verified.
Embedded Systems Scheduling Monitoring
Authors: Zdenek Slanina, Vilem Srovnal
Venue: Proceedings of the Third International Conference on Systems (2008)

The article deals with a design of application for scheduling and process behavior monitoring in operating systems Linux and derived operating systems. Described application gathers data by various remote machines (targets), with ethernet communication possibility and shows processes and scheduler activities. The monitoring application stores data and allows diagrammatizing target system behavior for online or offline analysis.
Strong normalisation in two pure pattern type systems
Authors: Benjamin Wack, ClÉment Houtmann
Venue: Mathematical Structures in Computer Science (2008)

Pure Pattern Type Systems (P2TS) combine the frameworks and capabilities of rewriting and λ-calculus within a unified setting. Their type systems, which are adapted from Barendregt's λ-cube, are especially interesting from a logical point of view. Until now, strong normalisation, which is an essential property for logical soundness, has only been conjectured: in this paper, we give a positive answer for the simply-typed system and the dependently-typed system. The proof is based on a translation of terms and types from P2TS into the λ-calculus. First, we deal with untyped terms, ensuring that reductions are faithfully mimicked in the λ-calculus. For this, we rely on an original encoding of the pattern matching capability of P2TS into the System Fω. Then we show how to translate types: the expressive power of System Fω is needed in order to fully reproduce the original typing judgments of P2TS. We prove that the encoding is correct with respect to reductions and typing, and we conclude with the strong normalisation of simply-typed P2TS terms. The strong normalisation with dependent types is in turn obtained by an intermediate translation into simply-typed terms.
Talbot effect obtained from complex transmittances
Authors: Mario Lehman, Diana Calva Mendez
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The self-imaging position (or Talbot effect) for generalized complex functions, obtained as a product of scaled periodic components, is studied in this paper. The self-images of each periodic component and for the complete transmittance are shown. Different configurations including mixed gratings are considered and it is shown that the positions of Talbot planes are also related with the scaling factor.
TODGINV-A code for optimization of gravity anomalies due to anticlinal and synclinal structures with parabolic density contrast
Authors: V. Chakravarthi, N. Sundararajan
Venue: Computers Geosciences (2008)

A code, TODGINV, to determine the parameters of 2D anticlinal and synclinal structures besides estimating linear regional gravity background is presented wherein the density contrast varies with depth based on a parabolic equation. The main program, TODGINV, is supported by five subroutines namely GANTCLINE, GSYNCLINE, PDSANT, PDSSYN and NOREQS. Forward modeling is realized through the subroutine GANTCLINE in case of an anticlinal structure while GSYNCLINE in case of a synclinal structure. PDSANT and PDSSYN compute the partial derivatives of anticlinal and synclinal structures, respectively, whereas NOREQS solves the system of normal equations. The efficiency of the code is illustrated with a set of synthetic gravity anomalies over an anticlinal and a synclinal structure both with and without regional background. Further, the code is exemplified with the gravity anomalies of the Pays De Bray anticline, France, and the results are found to be more consistent with borehole information rather than with those of Alessandrello et al. (1983, Automatic three-layer, three-dimensional deconvolution of the Pays De Bray anticline. Geophysical Prospecting 31, 608-626).
Java RMI versus .NET Remoting Architectural Comparison and Performance Evaluation
Authors: Roland Schwarzkopf, Markus Mathes, Steffen Heinzl, Bernd Freisleben, Helmut Dohmann
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The implementation of distributed applications can be based on a multiplicity of technologies, e.g. plain sockets, Remote Procedure Call (RPC), Remote Method Invocation(RMI), Java Message Service (JMS), .NET Remoting, or Web Services. These technologies differ widely in complexity, interoperability, standardization, and ease of use. To achieve the highest efficiency, the use of plain sockets is advisable, whereas highest interoperability and standardization argue for Web Services. Real world applications requirements are a trade-off between efficiency, development costs, usability, reliability, interoperability, and so on. For example, a multimedia streaming application requires high performance to avoid delays, whereas Internet trading platforms depend on high interoperability, reliability and availability. Since Java RMI and .NET Remoting support fast development of highly efficient applications, many developers choose one of these technologies to realize their applications. Besides differences in design, the two technologies offer diverse performance characteristics. This paper has two main contributions: (1) a comparison of the design and architecture of Java RMI and .NET Remoting is presented,(2) an experimental performance analysis with respect tovarious aspects of both technologies is conducted.
Emerging Nanoscale Memory and Logic Devices: A Critical Assessment
Authors: James A. Hutchby, Ralph Cavin, Victor Zhirnov, Joe E. Brewer, George Bourianoff
Venue: Computer (2008)

As the semiconductor industry pursues increased functional density and performance, an ITRS working group considers the long-term potential of emerging nanodevices to replace ultimately scaled CMOS logic or memory device technology.
Personalization in an interactive learning environment through a virtual character
Authors: E. Reategui, E. Boff, J. A. Campbell
Venue: Computers Education (2008)

Traditional hypermedia applications present the same content and provide identical navigational support to all users. Adaptive Hypermedia Systems (AHS) make it possible to construct personalized presentations to each user, according to preferences and needs identified. We present in this paper an alternative approach to educational AHS where a virtual character personalizes the interaction with the user through the use of a particular recommender system. The character has natural language communication abilities; it can learn students' profiles and use this knowledge to recommend appropriate contents and activities. Through its interaction with the user, the character is able to collect and organize information about students in order to identify appropriate suggestions of contents. The recommender system employs a knowledge representation scheme that is easy to understand and to modify, enabling teachers/tutors to explore the types of recommendations being made and to appreciate why they are made. An experiment with computer science students was carried out in order to validate the approach proposed. The results of the experiment showed that the presentation of personalized links through a virtual character had a positive impact in the users' perception of the system as a learning tool. The combination of the virtual character with a recommender system proved to be a good alternative for the delivery of personalized contents without making constant changes in the main user interface. This approach provides mechanisms to guide users through paths of study followed by students with similar profiles, without violating the human-computer interaction principle of perceived stability.