ppxscal/embedding_network huggingface dataset:
A Global Method for Modelling and Performance Analysis of Production Flows
Authors: Cecilia Zanni, Philippe Bouché
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In our increasingly competitive world, today companies are implementing improvement strategies in every department and, in particular, in their manufacturing systems. This paper discusses the use of a global method based on a knowledge-based approach for the development of a software tool for modelling and analysis of production flows. This tool will help promote the companies competitiveness by guaranteeing the efficiency of their production lines and, therefore, the quality and traceability of the manufactured products. Different kind of techniques will be used: graphic representation of the production, identification of specific behaviour and research of correlations among events on the production line. Most of these techniques are based on statistic and probabilistic analyses.
Video based road traffic detection and analysis
Authors: Karol Marusiak, Marke Szczepanski
Venue: Machine Graphics Vision International Journal (2006)

In this article an autonomous vehicle detection algorithm is presented. The described technique is capable of accurate vehicle detection, can work with different cameras and is fairly immune to illumination changes. It is based on the idea of an adaptive background model and the background subtraction method for detecting motion. The application's performance tests ware conducted using real life video sequences and gave satisfactory results.
Forbidden transition free crosstalk avoidance CODEC design
Authors: Chunjie Duan, Chengyu Zhu, Sunil P. Khatri
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this work, we present a CODEC design for the forbidden transition free crosstalk avoidance code. Our mapping and coding scheme is based on the Fibonacci numeral system and the mathematical analysis shows that all numbers can be represented by FTF vectors in the Fibonacci numeral system (FNS). The proposed CODEC design is highly efficient, modular and can be easily combined with a bus partitioning technique. We also investigate the implementation issues and our experimental results show that the proposed CODEC complexity is orders of magnitude better compared to the brute force implementation. Compared to the best existing approaches, we achieve a 17% improvement in logic complexity. A high speed design can be achieved through pipelining.
Chronic Hepatitis Classification Using SNP Data and Data Mining Techniques
Authors: Saangyong Uhmn, Dong-Hoi Kim, Sung Won Cho, Jae Youn Cheong, Jin Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The machine learning techniques, SVM, decision tree, and decision rule, are used to predict the susceptibility to the liver disease, chronic hepatitis from single nucleotide polymorphism(SNP) data. Also, they are used to identify a set of SNPs relevant to the disease. In addition, we apply backtracking technique to couple of feature selection algorithms, forward selection and backward elimination, and show that this technique is beneficial to find the better solutions by experiments. The experimental results show that decision rule is able to distinguish chronic hepatitis from normal with the maximum accuracy of 73.20%, whereas SVM is with 67.53% and decision tree is with 72.68%. It is also shown that decision tree and decision rule are potential tools to predict the susceptibility to chronic hepatitis from SNP data.
Apparent relief: a shape descriptor for stylized shading
Authors: Romain Vergne, Pascal Barla, Xavier Granier, Christophe Schlick
Venue: Proceedings of the 6th international symposium on Non-photorealistic animation and rendering (2008)

Shape depiction in non-photorealistic rendering of 3D objects has mainly been concerned with the extraction of contour lines, which are generally detected by tracking the discontinuities of a given set of shape features varying on the surface and/or the picture plane. In this paper, we investigate another approach: the depiction of shape through shading. This technique is often used in scientific illustration, comics, cartoon animation and various other artwork. A common method consists in indirectly adapting light positions to reveal shape features; but it quickly becomes impractical when the complexity of the object augments. In contrast, our approach is to directly extract a set of shape cues that are easily manipulated by a user and re-introduced during shading. The main problem raised by such an approach is that shape cues must be identified in a continuous way in image space, as opposed to line-based techniques. Our solution is a novel view-dependent shape descriptor called Apparent Relief, which carries pertinent continuous shape cues for every pixel of an image. It consists of a combination of object- and imagespace attributes. Such an approach provides appealing properties: it is simple to manipulate by a user, may be applied to a vast range of styles, and naturally brings levels-of-detail functionalities. It is also simple to implement, and works in real-time on modern graphics hardware.
Analyzing Maximum Length of Instruction Sequence in Network Packets for Polymorphic Worm Detection
Authors: Kohei Tatara, Yoshiaki Hori, Kouichi Sakurai
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already-known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the data flows on the network and detect the attack by measuring the length of them. Then, we describe the problem of their method and how to solve it.
Self-certified Sybil-free pseudonyms
Authors: Leonardo A. Martucci, Markulf Kohlweiss, Christer Andersson, Andriy Panchenko
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Accurate and trusted identifiers are a centerpiece for any security architecture. Protecting against Sybil attacks in a privacy-friendly manner is a non-trivial problem in wireless infrastructureless networks, such as mobile ad hoc networks. In this paper, we introduce self-certified Sybil-free pseudonyms as a means to provide privacy-friendly Sybil-freeness without requiring continuous online availability of a trusted third party. These pseudonyms are self-certified and computed by the users themselves from their cryptographic long term identities. Contrary to identity certificates, we preserve location privacy and improve protection against some notorious attacks on anonymous communication systems.
The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions
Authors: Milan S. Derpich, Jan Østergaard, Graham C. Goodwin
Venue: Proceedings of the Data Compression Conference (2008)

We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The solution is given by two equations coupled through a single scalar parameter. This has a structure similar to the well known water-filling solution obtained without the uncorrelated distortion restriction. Our results fully characterize the unique statistics of the optimal distortion. We also show that, for all positive distortions, the minimum achievable rate subject to the uncorrelation constraint is strictly larger than that given by the un-constrained rate-distortion function. This gap increases with the distortion and tends to infinity and zero, respectively, as the distortion tends to zero and infinity.
Managing bandwidth allocations between competing recreational and non-recreational traffic on campus networks
Authors: David C. Novak
Venue: Decision Support Systems (2008)

Network performance is a serious concern faced by many campus network managers across the country. As demand for entertainment-based Peer-to-Peer (P2P) applications that involve the transfer of large audio and video files continues to grow, managers are faced with the increasingly difficult task of determining how much bandwidth should be allocated to these applications. Unrestricted P2P traffic has the potential to monopolize bandwidth and severely degrade network performance. University IT managers are placed in a particularly difficult position, because they must juggle demands for non-recreational traffic without severely restricting recreational use of the network. This paper discusses a solution for optimizing bandwidth allocations on a campus gateway Internet link.
The 0-1 law fails for the class of existential second order Godel sentences with equality
Authors: L. Pacholski
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

P. Kolaitis and M. Vardi (see Proc. 19th ACM Symp. on Theory of Computing, p.425-35 (1987), and Proc. 3rd Ann. Symp. on Logic in Computer Science, p.2-11 (1988)) proved that the 0-1 law holds for the second-order existential sentences whose first-order parts are formulas of Bernays-Schonfinkel or Ackermann prefix classes. They also provided several examples of second-order formulas for which the 0-1 law does not hold and noticed that the classification of second-order sentences for which the 0-1 law holds resembles the classification of decidable cases of prenex first-order sentences. The only cases they have not settled were the cases of Godel classes with and without equality. The authors confirm the conjecture of Kolaitis and Vardi that the 0-1 law does not hold for the existential second-order sentences whose first-order part is in the godel prenex form with equality.
Performance evaluation of wireless sensor networks for event-detection with shadowing-induced radio irregularities
Authors: Giuseppe De Marco, Tao Yang, Makoto Ikeda, Leonard Barolli
Venue: Mobile Information Systems (2007)

In this paper, we study a particular application of wireless sensor networks for event-detection and tracking. In this kind of application, the transport of data is simplified, and guaranteeing a minimum number of packets at the monitoring node is the only constraint on the performance of the sensor network. This minimum number of packets is called event-reliability. Contrary to other studies on the subject, here we consider the behavior of such a network in presence of a realistic radio model, such as the shadowing of the radio signal. With this setting, we extend our previous analysis of the event-reliability approach for the transport of data. In particular, both regular and random networks are considered. The contribute of this work is to show via simulations that, in the presence of randomness or irregularities in the radio channel, the event-reliability can be jeopardized, that is the constraint on the minimum number of packets at the sink node could not be satisfied.
On degree sequence
Authors: Saptarshi Naskar, Krishnendu Basuli, Samar Sen Sarma, Kashi Nath Dey
Venue: Ubiquity (2008)

I ndi got her BS in Computer Science from Cal Poly and began her master's at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap. Her expertise ranges from structuring crossfunctional teams, to managing participant recruiting, and conducting user interviews, thereby creating effective tools for exchanging results.
A 30-mW 8-b 125-MS/s pipelined ADC in 0.13-μm CMOS
Authors: Perry L. Heedley, Kenneth C. Dyer, Thomas W. Matthews, Patrick Isakanian, Chuc Thanh
Venue: Analog Integrated Circuits and Signal Processing (2008)

An 8-b pipelined ADC constructed in 0.13-μm CMOS is described. This ADC uses a dual-supply technique to yield 8-b performance at a sampling rate of 125 MS/s while consuming 30 mW from 1.8-V and 1.2-V supplies. Active area is 0.4 mm2. Numerous challenges associated with this choice of process technology were overcome, such as limited dynamic range, copper metallization and the effects of gate oxide leakage.
E-redesigning of society: towards experiential connectivity of generations in Lithuania
Authors: Arunas Augustinaitis, Richard Ennals, Egle Malinauskiene, Rimantas Petrauskas
Venue: AI Society (2008)

The paper reflects on the unique experience of social and technological development in Lithuania since the regaining of independence as a newly reshaped society constructing a distinctive competitive IST-based model at global level. This has presented Lithuanian pattern of how to integrate different experiences and relations between generations in implementing complex information society approaches. The resulting programme in general is linked to the Lisbon objectives of the European Union. The experience of transitional countries in Europe, each different but facing some common problems, may be useful to developing countries in Africa.
Oscillation criteria for second-order nonlinear differential equations with nonlinear damping
Authors: Aimin Zhao, Yanmei Wang, Jurang Yan
Venue: Computers Mathematics with Applications (2008)

This paper is concerned with the oscillation of a class of general type second-order differential equations with nonlinear damping. Several new oscillation criteria are established under quite general assumptions, which improve and extend the known results in the literature.
A unified approach to finding good stable matchings in the hospitals/residents setting
Authors: Christine Cheng, Eric McDermid, Ichiro Suzuki
Venue: Theoretical Computer Science (2008)

The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that either satisfy a set of additional contraints or are optimal with respect to some cost function. In this paper, we show that broad classes of feasibility and optimization stable matching problems in the HR setting can be solved efficiently provided certain tasks (such as checking the feasibility of a stable matching or computing the cost of a stable matching) can also be done efficiently. To prove our results, we make use of an HR instance's meta-rotation poset to explore its stable matchings. An algorithm that can discover all the meta-rotations of the instance serves as a starting point for all our algorithms.
Localized broadcast incremental power protocol for wireless ad hoc networks
Authors: Fran¸ois Ingelrest, David Simplot-Ryl
Venue: Wireless Networks (2008)

We investigate broadcasting and energy preservation in ad hoc networks. One of the best known algorithm, the Broadcast Incremental Power (BIP) protocol, constructs an efficient spanning tree rooted at a given node. It offers very good results in terms of energy savings, but its computation is centralized and it is a real problem in ad hoc networks. Distributed versions have been proposed, but they require a huge transmission overhead for information exchange. Other localized protocols have been proposed, but none of them has ever reached the performances of BIP. In this paper, we propose and analyze an incremental localized version of this protocol. In our method, the packet is sent from node to node based on local BIP trees computed by each node in the broadcasting chain. Local trees are constructed within the k- hop neighborhood of nodes, based on information provided by previous nodes, so that a global broadcasting structure is incrementally built as the message is being propagated through the network. Only the source node computes an initially empty tree to initiate the process. Discussion and results are provided where we argue that k = 2 is the best compromise for efficiency. We also discuss potential conflicts that can arise from the incremental process. We finally provide experimental results showing that this new protocol obtains very good results for low densities, and is almost as efficient as BIP for higher densities.
The $100,000 Keying Error
Authors: Kai A. Olsen
Venue: Computer (2008)

Losing $100K hurts, but other input mistakes can cost much more.
Fabrication and characterization of Ta2O5 photonic feedback structures
Authors: T. Wahlbrink, J. Bolten, T. Mollenhauer, H. Kurz, K. Baumann, N. Moll, T. Stöferle, R. F. Mahrt
Venue: Microelectronic Engineering (2008)

The integration of a thin layer of the high refractive index material Ta"2O"5 in organic laser structures is studied. A complete fabrication process of Ta"2O"5 based photonic crystals is described including deposition, electron beam lithography and reactive ion etching. Functional devices using methyl-substituted ladder-type poly(para-phenylene) (MeLPPP) as gain material are characterized with regard to the effectivity of the fabricated feedback structures.
Designing a service science discipline with discipline
Authors: R. J. Glushko
Venue: IBM Systems Journal (2008)

This paper relates our experiences at the University of California, Berkeley (UC Berkeley), designing a service science discipline. We wanted to design a discipline of service science in a principled and theoretically motivated way. We began our work by asking, "What questions would a service science have to answer?" and from that we developed a new framework for understanding service science. This framework can be visualized as a matrix whose rows are stages in a service life cycle and whose columns are disciplines that can provide answers to the questions that span the life cycle. This matrix systematically organizes the issues and challenges of service science and enables us to compare our model of a service science discipline with other definitions and curricula. This analysis identified gaps, overlaps, and opportunities that shaped the design of our curriculum and in particular a new survey course that serves as the cornerstone of service science education at UC Berkeley.
A KEYHOLE PLAN RECOGNITION MODEL FOR ALZHEIMER'S PATIENTS: FIRST RESULTS
Authors: Bruno Bouchard, Sylvain Giroux, Abdenour Bouzouane
Venue: Applied Artificial Intelligence (2007)

This article addresses the problem of recognizing the behavior of a person suffering from Alzheimer's disease at early-intermediate stages. We present a keyhole plan recognition model, based on lattice theory and action description logic, which transforms the recognition problem into a classification issue. This approach allows us to formalize the plausible incoherent intentions of the patient, resulting from the symptoms of his cognitive impairment, such as disorientation, memory lapse, etc. An implementation of this model was tested in our smart home laboratory, by simulating a set of real case scenarios.
Role-Based Access Control in Peer-to-Peer (P2P) Societies
Authors: Masakazu Maruoka, Alireza Goodarzi Nemati, Valbona Barolli, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Various kinds of applications like social network service (SNS) are developed and widely used in peer-to-peer (P2P) overlay networks. Here, groups of peers are dynamically and autonomously constructed to achieve some objectives by sharing objects held by the member peers. Each peer holds objects and is assumed to manage its own objects in the role-based access control (RBAC) model in this paper. A role is a collection of access rights, i.e. permissions. A peer defines roles on its own objects and grants and revokes a role to and from another peer. Only a peer granted a role is allowed to make an access to the objects in access rights of the role. In this paper, we discuss how to securely share objects with multiple peers in a society. Each member peer logically views a society to be a collection of society objects and society roles to manipulate the society objects without being conscious of which local peer holds the objects and whether or not the peer is granted access rights. In a society, each member peer plays one or more than one society role. On joining a society, a peer first negotiates with the society an agreement on which roles the peer can support to the society and which society role the peer is granted. In this paper, we discuss how peers do the negotiation with each other to grant and revoke roles in a society.
Can data transformation help in the detection of fault-prone modules?
Authors: Yue Jiang, Bojan Cukic, Tim Menzies
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

Data preprocessing (transformation) plays an important role in data mining and machine learning. In this study, we investigate the effect of four different preprocessing methods to fault-proneness prediction using nine datasets from NASA Metrics Data Programs (MDP) and ten classification algorithms. Our experiments indicate that log transformation rarely improves classification performance, but discretization affects the performance of many different algorithms. The impact of different transformations differs. Random forest algorithm, for example, performs better with original and log transformed data set. Boosting and NaiveBayes perform significantly better with discretized data. We conclude that no general benefit can be expected from data transformations. Instead, selected transformation techniques are recommended to boost the performance of specific classification algorithms.
Python puts a squeeze on java for CS0 and beyond
Authors: Krishna K. Agarwal, Achla Agarwal, M. Emre Celebi
Venue: Journal of Computing Sciences in Colleges (2008)

This paper compares Python with Java for teaching CS0, the first introductory course for computer science majors. Python has a simpler and more elegant syntax than Java. Python has an open, community-based development model managed by the non-profit Python Software Foundation; while Java is proprietary. Both Python and Java provide support for Graphical User Interfaces and object-oriented programming but Java seems to be more complex. These features make Python more suitable than Java for CS0 and more advanced courses.
Power-efficient clustering via incomplete bypassing
Authors: Eric P. Villasenor, DaeHo Seo, Mithuna S. Thottethodi
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Researchers have proposed clustered microarchitectures for performance and energy effciency. Typically, clustered microarchitectures offer fast, local bypassing between instructions within clusters but global bypasses are slower. Traditional clustered microarchitectures (TCM) are implemented by partitioning the register file and associated functional units to clusters. This paper demonstrates an alternate implementation - Incomplete bypass-based clustered microarchitecture (IBCM). IBCM reduces the length of bypass wires by 42.4% resulting in an 8.9% reduction of "Execute" stage delay. This delay reduction in the critical EX stage enables voltage scaling that results in significantly lower average power consumption (between 11.7% and 19.5% lower) while achieving identical performance.