ppxscal/embedding_network huggingface dataset:
Peer-to-Peer File Sharing Communication Detection System with Traffic Mining and Visualization
Authors: Satoshi Togawa, Kazuhide Kanenishi, Yoneo Yano
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

In this research, we have built a system for network administrators that visualize the Peer-to-Peer (P2P) file sharing activities of network users. This system monitors network traffic and discerns traffic features using traffic mining. This system visualizes the P2P file sharing traffic activities of an organization by making the processing object not an individual user but a user group. The network administrator can comprehend the P2P sharing activities of the organization by referring to the map. This system extracts traffic features from captured IP packets that the users communicated. And this system extracts the appearance ratio of DNS host query. Afterwards this system creates traffic model. These features of the traffic model are emphasized by weighting. After that, the traffic model is visualized by High Speed Spherical Self-Organizing Map. This feature map shows network traffic behavior related with P2P file sharing communication like a birds-eye view. As a result, we think we can assist the monitoring operation and network administration.
Smart Makeup Mirror: Computer-Augmented Mirror to Aid Makeup Application
Authors: Eriko Iwabuchi, Maki Nakagawa, Itiro Siio
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

In this paper, we present a system that aids people in wearing makeup easily and make the process enjoyable. We call the proposed system the "Smart Makeup Mirror", which is an electronic dressing table that facilitates the process of makeup application. In this system, we place a high-resolution camera above a computer display and have added some functions such as "Automatic zoom to a specific part of the face", "Display the face from various angles", "Simulation of lighting conditions", and "Internet voting on better makeup results" to facilitate the makeup application process. People who use this device for applying makeup will obtain highly satisfactory results, while enjoying the process.
Influence of Filler on Asphalt Mortar's Viscosity
Authors: Ping Li, Chenguang Kong, Zhengqi Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In order to analyze the influence of filler on viscosity of asphalt mortar, Brookfield viscometer was used to test the viscosity of asphalt mortar, and investigated the effect of filler type and quantity. It is proved form test results that there have about five times among the viscosity of different mortars, and the influence increases with filler quantity’s accretion. The mortar’s viscosity decreases when testing time extends, and the attenuation ratio shows like concave curve, at the same time, the ratio is smallest when FB is in the range form 1.2 to 1.6. Settling time for mortar viscosity extends with FB’s increasing. The difference of construction temperature among different asphalt mortars reach about 30℃. Results indicate that it is necessary to filter filler type according to the character of filler for avoiding the bad effect on mixture performance, and modify the active asphalt construction temperature method adopting the function of filler.
A Predictive Coding Information Hiding Algorithm with Large Capacity Based on Image Separation
Authors: Junling Ren, Zhifeng Ma, Yangbo Xia
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In view of the information security questions, the information hiding technology already becomes the hot spot in the research field. On the basis of the predictive coding, a reversible information hiding algorithm is proposed. In the algorithm, the carrier image is divided into embedding separations and non-embedding separations of secret information to restrain the error diffusion which possibly happens when decoding. This makes the original carrier image can be restored absolutely when extracting the secret information. As a result of the experiments on the carrier image of different sizes, the algorithm has achieved large information hiding capacity of 0.953 bits/Byte and PSNR of 49.184dB. And the validity of this algorithm is proved.
Soft Margin Trees
Authors: Jorge Díez, Juan José Coz, Antonio Bahamonde, Oscar Luaces
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

From a multi-class learning task, in addition to a classifier, it is possible to infer some useful knowledge about the relationship between the classes involved. In this paper we propose a method to learn a hierarchical clustering of the set of classes. The usefulness of such clusterings has been exploited in bio-medical applications to find out relations between diseases or populations of animals. The method proposed here defines a distance between classes based on the margin maximization principle, and then builds the hierarchy using a linkage procedure. Moreover, to quantify the goodness of the hierarchies we define a measure. Finally, we present a set of experiments comparing the scores achieved by our approach with other methods.
Building Ontology Automatically Based on Bayesian Network and PART Neural Network
Authors: Zhi Xi-Hu, Li Yan-Fei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The deployment of the semantic web depends on the rapid and efficient construction of the ontology. But traditional ontology construction is time-consuming and costly procedure. This paper present a novel ontology construction method based on ART network and Bayesian Network. The feature of this ontology construction system includes that the PART architecture overcomes the lack of flexibility in clustering, while in the web page analysis, WordNet and Entropy deal with the lack of knowledge acquisition. The system then uses a Bayesian network to insert the terms and finish the complete hierarchy of the ontology. The experimental results indicate that this method has great promise.
Motion field texture synthesis
Authors: Chongyang Ma, Li-Yi Wei, Baining Guo, Kun Zhou
Venue: ACM Transactions on Graphics (TOG) (2009)

A variety of animation effects such as herds and fluids contain detailed motion fields characterized by repetitive structures. Such detailed motion fields are often visually important, but tedious to specify manually or expensive to simulate computationally. Due to the repetitive nature, some of these motion fields (e.g. turbulence in fluids) could be synthesized by procedural texturing, but procedural texturing is known for its limited generality. We apply example-based texture synthesis for motion fields. Our technique is general and can take on a variety of user inputs, including captured data, manual art, and physical/procedural simulation. This data-driven approach enables artistic effects that are difficult to achieve via previous methods, such as heart shaped swirls in fluid animation. Due to the use of texture synthesis, our method is able to populate a large output field from a small input exemplar, imposing minimum user workload. Our algorithm also allows the synthesis of output motion fields not only with the same dimension as the input (e.g. 2D to 2D) but also of higher dimension, such as 3D volumetric outputs from 2D planar inputs. This cross-dimension capability supports a convenient usage scenario, i.e. the user could simply supply 2D images and our method produces a 3D motion field with similar characteristics. The motion fields produced by our method are generic, and could be combined with a variety of large-scale low-resolution motions that are easy to specify either manually or computationally but lack the repetitive structures to be characterized as textures. We apply our technique to a variety of animation phenomena, including smoke, liquid, and group motion.
Particle filtering for dynamic agent modelling in simplified poker
Authors: Nolan Bard, Michael Bowling
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Agent modelling is a challenging problem in many modern artificial intelligence applications. The agent modelling task is especially difficult when handling stochastic choices, deliberately hidden information, dynamic agents, and the need for fast learning. State estimation techniques, such as Kalman filtering and particle filtering, have addressed many of these challenges, but have received little attention in the agent modelling literature. This paper looks at the use of particle filtering for modelling a dynamic opponent in Kuhn poker, a simplified version of Texas Hold'em poker. We demonstrate effective modelling both against static opponents as well as dynamic opponents, when the dynamics are known. We then examine an application of Rao-Blackwellized particle filtering for doing dual estimation, inferring both the opponent's state as well as a model of its dynamics. Finally, we examine the robustness of the approach to incorrect beliefs about the opponent and compare it to previous work on opponent modelling in Kuhn poker.
What students really need beyond learning content: ubiquitous shared-connectivity services to foster learning communities on the campus
Authors: Victor Manuel Garcia-Barrios, Korab Qerkini, Christian Safran
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

The penetration of mobile devices in our daily life (also called the mobile market) as well as their constantly growing technical capabilities has been going along in the last years with an increasing interest from side of the research community. Hence, heterogeneous mobile operating systems populated the current mobile market and have led to the following problem. Many providers of mobile services, e.g., developers of business or learning applications that provide personalised content, are mostly forced into the restrictions of implementing solutions for just a number of mobile device types and just within the limits of one domain area. In this paper, we address the aforementioned issues within the area of technology-enhanced learning by focusing on two interrelated aspects. On the one side, we give an overview on the challenges regarding the development of services for this currently existing heterogeneity of mobile platforms. And on the other side, we show our main findings after asking university students which services they would like to use for their personal learning needs to increase collaborative campus-life activities with their mobile devices. Our field study showed a shift from the 'typical' perspective of optimising learning content provision to a more general perspective of delivering collaborative services with ad-hoc mobile networks. Based on those aspects, we introduce also the system architecture of our solution approach focusing on its communication layers that support shared connectivity for ubiquitous services.
Approximate counting by sampling the backtrack-free search space
Authors: Vibhav Gogate, Rina Dechter
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently introduced SampleSearch scheme that is designed to overcome the rejection problem associated with distributions having a substantial amount of determinism. We show here that the sampling distribution of SampleSearch can be characterized as the backtrack-free distribution and propose several schemes for its computation. This allows integrating Sample-Search into the importance sampling framework for approximating the number of solutions and also allows using Sample-Search for computing a lower bound measure on the number of solutions. Our empirical evaluation demonstrates the superiority of our new approximate counting schemes against recent competing approaches.
Comment on a Digital Signature Scheme with Using Self-Certified Public Keys
Authors: Zhang Jianhong, Chen Hua, Gao Shengnan, Geng Qin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Digital signature is an important cryptographical tool. In a digital signature with using self-certified public key, the verification signature and public key can be carried out in a logic step. Recently, Tseng et al proposed a digital signature schemes with using self-certified public key. Unfortunately, Shao et.al showed that the scheme was insecure, and gives an improvement scheme. In this works, we analyze security of Shao et.al scheme and his attack and show that the attack is not powerful and the improvement scheme can not resist middle-in-man attack. Namely, when an adversary controls the communication channel between the signer Ui and Uj, he can tamper's signature on the message M, which is sent to Uj, as his signature on the message M under the condition of not knowing the message M. This attack is very frightful over the internet transactions.
Robotic hand-eye coordination without global reference: A biologically inspired learning scheme
Authors: Martin Hulse, Sebastian McBrid, Mark Lee
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

Understanding the mechanism mediating the change from inaccurate pre-reaching to accurate reaching in infants may confer advantage from both a robotic and biological research perspective. In this work, we present a biologically meaningful learning scheme applied to the coordination between reach and gaze within a robotic structure. The system is model-free and does not utilize a global reference system. The integration of reach and gaze emerges from the learned cross-modal mapping between reach and vision space as it occurs during the robot-environment interaction. The scheme showed high learning speed and plasticity compared with other approaches due to the low level of training data required. We discuss our findings with respect to biological plausibility and from an engineering perspective, with emphasis on autonomous learning as well as strategies for the selection of new training data.
Dynamic memory balancing for virtual machines
Authors: Weiming Zhao, Zhenlin Wang, Yingwei Luo
Venue: ACM SIGOPS Operating Systems Review (2009)

Virtualization essentially enables multiple operating systems and applications to run on one physical computer by multiplexing hardware resources. A key motivation for applying virtualization is to improve hardware resource utilization while maintaining reasonable quality of service. However, such a goal cannot be achieved without efficient resource management. Though most physical resources, such as processor cores and I/O devices, are shared among virtual machines using time slicing and can be scheduled flexibly based on priority, allocating an appropriate amount of main memory to virtual machines is more challenging. Different applications have different memory requirements. Even a single application shows varied working set sizes during its execution. An optimal memory management strategy under a virtualized environment thus needs to dynamically adjust memory allocation for each virtual machine, which further requires a prediction model that forecasts its host physical memory needs on the fly. This paper introduces MEmory Balancer (MEB) which dynamically monitors the memory usage of each virtual machine, accurately predicts its memory needs, and periodically reallocates host memory. MEB uses two effective memory predictors which, respectively, estimate the amount of memory available for reclaiming without a notable performance drop, and additional memory required for reducing the virtual machine paging penalty. Our experimental results show that our prediction schemes yield high accuracy and low overhead. Furthermore, the overall system throughput can be significantly improved with MEB.
SCDL Applications to Drug Discovery
Authors: David A. Hecht, Phillip C. Y. Sheu, Jeffrey J. P. Tsai
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Semantic Capability Description Language (SCDL) plays an important role as a common language and provides a generic format for problem formalization. In this paper we extend SCDL to include typical applications in drug discovery and development that include similarity and substructure searches, quantitative structure activity relationship modeling and in silico docking experiments.
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
Authors: Gilles Bertrand, Samer Lahoud, Géraldine Texier, Miklós Molnár
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-domain context. However, few solutions exist for the inter-domain case, despite the importance of this problem to enable the delivery of services with QoS across domain boundaries. We propose a method that distributes the operations to compute inter-domain constrained paths. This method relies on a per-domain formulation that is compatible with the path computation element framework. It enables us to propose the first algorithm that guarantees to find optimal paths subject to an arbitrary number of constraints. These paths ensure the best QoS performance with respect to the constraints.
Size and Energy of Threshold Circuits Computing Mod Functions
Authors: Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Let C be a threshold logic circuit computing a Boolean function MOD$_m: \{ 0, 1\}^n \rightarrow \{0, 1\}$, where n ¿ 1 and m ¿ 2. Then C outputs "0" if the number of "1"s in an input x ¿ {0, 1} n to C is a multiple of m and, otherwise, C outputs "1." The function MOD2 is the so-called PARITY function, and MOD n + 1 is the OR function. Let s be the size of the circuit C, that is, C consists of s threshold gates, and let e be the energy complexity of C, that is, at most e gates in C output "1" for any input x ¿ { 0, 1} n . In the paper, we prove that a very simple inequality n/(m ¿ 1) ≤ s e holds for every circuit C computing MOD m . The inequality implies that there is a tradeoff between the size s and energy complexity e of threshold circuits computing MOD m , and yields a lower bound e = ¿((logn ¿ logm)/loglogn) on e if s = O(polylog(n)). We actually obtain a general result on the so-called generalized mod function, from which the result on the ordinary mod function MOD m immediately follows. Our results on threshold circuits can be extended to a more general class of circuits, called unate circuits.
MICS: an efficient content space representation model for publish/subscribe systems
Authors: Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatasubramanian, Mirko Montanari
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space. To reduce subscription forwarding load and speed up content matching, subscription covering, subsumption and merging techniques have been proposed. In this paper we propose MICS, Multidimensional Indexing for Content Space that provides an efficient representation and processing model for large number of subscriptions and publications. MICS creates a one dimensional representation for publications and subscriptions using Hilbert space filling curve. Based on this representation, we propose novel content matching and subscription management (covering, subsumption and merging) algorithms. Our experimental evaluation indicates that the proposed approach significantly speeds up subscription management operations compared to the naive linear approach.
Safety-Related Application Conditions --- A Balance between Safety Relevance and Handicaps for Applications
Authors: Friedemann Bitsch, Ulrich Feucht, Huw Gough
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

Railway standards prescribe the use of Safety-related Application Conditions (SACs). SACs are demands to be observed when using a safety related system or a sub-system. The use of SACs can, however, easily be associated with difficulties. SACs of sub-systems can imply high efforts regarding their fulfillment at system level. Furthermore, SACs at sub-system level may become very obstructive for the user of the sub-system, if the safe application on system level has strong restrictions. Additionally, a large number of SACs may be very difficult to manage. In this way, SACs may obstruct the introduction of a system or a sub-system into the field. Particular hazards could arise from SACs, if they are formulated ambiguously, so that the originally intended safety-related measures are not taken at all. This paper presents the objectives and benefits of SACs and depicts difficulties and challenges associated with the use of SACs. The paper not only explains what should be the SAC content but also the quality criteria, the conditions for SAC creation and SAC fulfillment are described. The SAC management process introduced at Thales Rail Signalling Solutions GmbH is outlined. On the one hand, this process shall support the quality of SACs and on the other hand reduce the effort for SAC creation, fulfillment and evidence.
Multiobjective differential evolution for scheduling workflow applications on global Grids
Authors: A. K. M. Khaled Ahsan Talukder, Michael Kirley, Rajkumar Buyya
Venue: Concurrency and Computation: Practice Experience (2009)

Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (e.g. execution cost and time, which may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics rather than a deterministic algorithm. In this paper, we have proposed a workflow execution planning approach using Multiobjective Differential Evolution (MODE). Our goal was to generate a set of trade-off schedules according to two user specified QoS requirements (time and cost), which will offer more flexibility to users when estimating their QoS requirements. We have compared our results with a well-known baseline algorithm &lsquo;Pareto-archived Evolutionary Strategy (PAES)&rsquo;. Simulation results show that the modified MODE is able to find significantly better spread of compromise solutions compared with that of PAES. Copyright &copy; 2009 John Wiley & Sons, Ltd.