ppxscal/embedding_network huggingface dataset:
A privacy-aware access control system
Authors: C. A. Ardagna, M. Cremonini, S. De Capitani di Vimercati, P. Samarati
Venue: Journal of Computer Security (2008)

The protection of privacy is an increasing concern in our networked society because of the growing amount of personal information that is being collected by a number of commercial and public services. Emerging scenarios of user-service interactions in the digital world are then pushing toward the development of powerful and flexible privacy-aware models and languages. This paper aims at introducing concepts and features that should be investigated to fulfill this demand. We identify different types of privacy-aware policies: access control, release and data handling policies. The access control policies govern access/release of data/services managed by the party (as in traditional access control), and release policies govern release of personal identifiable information (PII) of the party and specify under which conditions it can be disclosed. The data handling policies allow users to specify and communicate to other parties the policy that should be enforced to deal with their data. We also discuss how data handling policies can be integrated with traditional access control systems and present a privacy control module in charge of managing, integrating, and evaluating access control, release and data handling policies.
Encouraging Good Interactions in Open Agent Systems
Authors: Bin Li, Maolin Xing, Tongsheng Che, Xingshen Wu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In the open agent systems, agents have to meet how, when and with who interact. Trust and reputation play an important role in reduces the uncertain. However, existing trust metric is not effective when an agent strategically behaviors, such as sudden behavior or alter 'name'. This paper presents a novel trust metric, which can penalize behavior of the suddenly falling behavior and change 'name'.
Simple Explicit Formula for Counting Lattice Points of Polyhedra
Authors: Jean B. Lasserre, Eduardo S. Zeron
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

Given z ¿ ¿ n and A ¿ ¿ m×n , we provide an explicit expression and an algorithm for evaluating the counting function h(y;z): = ¿ { z x | x ¿ ¿ n ;Ax=y,x ¿ 0}. The algorithm only involves simple (but possibly numerous) calculations. In addition, we exhibit finitely many fixed convex cones of ¿ n explicitly and exclusively defined by A, such that for any y ¿ ¿ m , h(y;z) is obtained by a simple formula that evaluates ¿ z x over the integral points of those cones only. At last, we also provide an alternative (and different) formula from a decomposition of the generating function into simpler rational fractions, easy to invert.
Personalized Control of Smart Environments
Authors: Giovanni Cozzolongo, Berardina Carolis, Sebastiano Pizzutilo
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Interaction with smart environments, to be effective, should be easy, natural and should be proactively adapted to users needs. In this paper we propose the use of a butler agent acting as a mediator between environment devices and users. As any good butler, it is able to observe and learn about users preferences but it leaves to its "owner" the last word on decisions. This is possible by employing user and context modeling techniques in order to provide a dynamic adaptation of the interaction with the environment according to the vision of ambient intelligence.
An empirical model to predict security vulnerabilities using code complexity metrics
Authors: Yonghee Shin, Laurie Williams
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Complexity is often hypothesized to be the enemy of software security. If this hypothesis is true, complexity metrics may be used to predict the locale of security problems and can be used to prioritize inspection and testing efforts. We performed statistical analysis on nine complexity metrics from the JavaScript Engine in the Mozilla application framework to find differences in code metrics between vulnerable and nonvulnerable code and to predict vulnerabilities. Our initial results show that complexity metrics can predict vulnerabilities at a low false positive rate, but at a high false negative rate.
Constraint-Based Approach for Analysis of Hybrid Systems
Authors: Sumit Gulwani, Ashish Tiwari
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) for verification of hybrid systems. The key idea is to introduce a template for the unknown invariants and then translate the verification condition into an ¿ ¿ constraint, where the template unknowns are existentially quantified and state variables are universally quantified. The verification condition for continuous dynamics encodes that the system does not exit the invariant set from any point on the boundary of the invariant set. The ¿ ¿ constraint is transformed into ¿ constraint using Farkas lemma. The ¿ constraint is solved using a bit-vector decision procedure. We present preliminary experimental results that demonstrate the feasibility of our approach of solving the ¿ ¿ constraints generated from models of real-world hybrid systems.
Online nonpreemptive scheduling of equal-length jobs on two identical machines
Authors: Michael H. Goldwasser, Mark Pedigo
Venue: ACM Transactions on Algorithms (TALG) (2008)

We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as P2 &verbar; pj &equals; p,rj &verbar; &sum; &Uhorbar;j. The problem is known to be polynomially solvable in an offline setting. In an online variant of the problem, a job's existence and parameters are revealed to the scheduler only upon that job's release date. We present an online deterministic algorithm for the problem and prove that it is 3/2-competitive. A simple lower bound shows that this is the optimal deterministic competitiveness.
A dynamic approach to consistency management for mobile multiplayer games
Authors: Abdul Malik Khan, Sophie Chabridon, Antoine Beugnard
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

In multiplayer games, where many players take part in a game while communicating through a network, the players may have an inconsistent view of the game world because of the communication delays across the network. Consistency maintenance algorithms must be used to have a uniform view of the game world. The majority of these algorithms are used for wired network and they use a fixed approach which is hardly adaptable to the changing network and game environment. In these algorithms, an approach called locallag is used which delays the presentation of updates so as to account for network latencies. The value of local lag is usually fixed for a game session. In wireless networks where the network latencies can varies greatly, fixed local-lag approach can cause inconsistencies in the game state between different replicas. Also dead-reckoning is used along with local-lag to hide network latency and improve responsiveness. Keeping a fixed dead-reckoning approach in the face of changing network and game environment can produce unpredictable game behaviour which can cause human players to quit the game. In this paper, we present a dynamic and adaptable approach for local-lag and dead-reckoning in which the algorithm's parameters are changed according to the changing and unpredictable network and game environment. We believe that this adaptable approach can greatly improve consistency and hence the playability of the game.
Measurement and Analysis of Autonomous Spreading Malware in a University Environment
Authors: Jan Goebel, Thorsten Holz, Carsten Willems
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

Autonomous spreading malware in the form of bots or worms is a constant threat in today's Internet. In the form of botnets, networks of compromised machines that can be remotely controlled by an attacker, malware can cause lots of harm. In this paper, we present a measurement setup to study the spreading and prevalence of malware that propagates autonomously. We present the results when observing about 16,000 IPs within a university environment for a period of eight weeks. We collected information about 13,4 million successful exploits and study the system- and network-level behavior of the collected 2,034 valid, unique malware binaries.
A New Path Length Measure Based on GO for Gene Similarity with Evaluation using SGD Pathways
Authors: Anurag Nagar, Hisham Al-Mubaid
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

We propose a new method for measuring the semantic similarity of genes based on path length between their annotation terms in the Gene Ontology. Our method applies an exponential transfer function to the average path length between two genes to compute their similarity. The non-linear measure ensures that the semantic similarity decreases with distance and proves to be quite competitive when compared to other measures. The advantage of the proposed measure is its simplicity and ease of implementation which gives it a great appeal in this domain. The measure uses only one feature (path length) for computing the similarity between genes. For validation purposes, we computed the similarity of genes from the Saccharomyces Genome Database (SGD) taking part in various cellular pathways. We analyzed 152 pathways from SGD and compared our similarity results with two of the leading measures. The proposed measure proved to be very competitive in all cases and the clustering results showed that our method is able to surpass the leading methods in certain cases.
Absorptive capacity and open source software project performance
Authors: Ritu Agarwal, Katherine Stewart
Venue:  (2007)

The open source phenomenon is an exciting movement that is transforming traditional forms of software development. Some open source software (OSS) projects, such as Linux and Apache, are performing extremely well and rapidly replacing proprietary software in major corporations and governments. In addition to these highly publicized examples, there are legions of OSS projects that have not experienced a similar uptake. The purpose of this dissertation is to understand how and why some OSS projects are able to perform better than others. It explores antecedents of OSS project performance from a knowledge-focused perspective because software development is a knowledge-intensive activity. In particular, it examines the development and effects of absorptive capacity for an OSS project. Absorptive capacity captures the degree to which an organization is able to acquire and assimilate knowledge. In describing how OSS absorptive capacity is developed, this dissertation identifies characteristics and behaviors of project participants that indicate an OSS project's absorptive capacity. I underscore the importance of the characteristics and behaviors of two different sets of project participants in an OSS project: those in the Internet-based user community and those in the development group. To the extent that absorptive capacity influences OSS project performance, I argue that these characteristics and behaviors are critical for OSS project performance. Archival data about OSS projects that use the SourceForge platform are used to empirically test the model developed. This dissertation makes several contributions to theory and practice. The research informs project managers regarding the participants to target and behaviors to encourage that will lead to superior performance for their OSS project. In exploring the effect of absorptive capacity in an OSS project, this dissertation adds to the absorptive capacity literature by examining the interaction of two dimensions of this construct: knowledge acquisition and knowledge transfer. Finally, this dissertation extends the OSS literature by specifically exploring the effect of the Internet-based user community on OSS project performance.
Challenges in dependable internet-scale stream processing
Authors: Peter Pietzuch
Venue: Proceedings of the 2nd workshop on Dependable distributed data management (2008)

Today we lack an infrastructure for globally processing stream data from sensor networks and making this data available to millions of users in real-time. To build such a system, we need to address a set of challenges and, in particular, rethink what dependability means in this context: it is infeasible to guarantee perfect data processing at a global scale. Instead, the degradation of result quality due to failure and resource shortages should be made explicit to users. We briefly describe one such model to achieve a dependable Internet-scale stream processing service.
The square root law of steganographic capacity
Authors: Andrew D. Ker, Tomáš Pevný, Jan Kodovský, Jessica Fridrich
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

There are a number of recent information theoretic results demonstrating (under certain conditions) a sublinear relationship between the number of cover objects and their total steganographic capacity. In this paper we explain how these results may be adapted to the steganographic capacity of a single cover object, which under the right conditions should be proportional to the square root of the cover size. Then we perform some experiments using three genuine steganography methods in digital images, covering both spatial and DCT domains. Measuring detectability under four different steganalysis methods, for a variety of payload and cover sizes, we observe close accordance with a square root law.
Legal aspects of Internet governance reform
Authors: David Satola
Venue: Information Polity (2007)

The Internet has moved on from its early almost lawless nature. There are now multiple organisations and legal aspects associated with Internet governance. Whether the issue on the Internet is network security, intellectual property rights (IPRs), e-commerce, cybercrime, freedom of expression, freedom of information, consumer rights or liberalisation of infrastructure - rules, laws and norms apply. These can be formal laws, treaties, industry standards or rules of procedure on both national and international level. On the legislative front there are too many national laws from too many countries that have effect on Internet governances beyond their borders, hence effective global cooperation on jurisdictional issues is necessary to ensure an enabling environment for the growth of the Internet and use of the Internet and ICTs for economic growth and development. A framework-approach to legal-reform issues of Internet governance could be the best way forward.
Internet Ad Auctions: Insights and Directions
Authors: S. Muthukrishnan
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face a number of algorithmic challenges. This note will present a small selection of such problems, some insights and open research directions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Adaptive collaborative filtering based on user-genre-item relation
Authors: Jin Min Yang, Kin Fun Li, Da Fang Zhang
Venue: International Journal of Communication Networks and Distributed Systems (2008)

Collaborative filtering provides personalised recommendations based on individual user preferences as well as those of other users with similar interests. In collaborative filtering, memory-based approaches make predictions by measuring the whole similarity between two users. When a user has multiple interest genres, those methods seem too optimistic in making correct predictions in some situations. In addition, minor genres are often inhibited due to their minute share of the whole similarity. In this paper, we present a novel approach that combines the advantages of item-item similarity and user-user similarity by introducing a genre component to the relation between user and item. In our approach, the direct user-item relevance is developed into a combination of genre similarity and preference similarity, thus capturing more accurately the relevance between items as well as between user and item. Experimental results from EachMovie and MovieLens datasets show that our approach outperforms four other state-of-the-art collaborative filtering algorithms.
Assessing Programming Costs of Explicit Memory Localization on a Large Scale Shared Memory Multiprocessor
Authors: Silvio Picano, Eugene D. Brooks III, Joseph E. Hoag
Venue: Scientific Programming (1992)

We present detailed experimental work involving a commercially available large scale shared memory multiple instruction stream-multiple data stream (MIMD) parallel computer having a software controlled cache coherence mechanism. To make effective use of such an architecture, the programmer is responsible for designing the program's structure to match the underlying multiprocessors capabilities. We describe the techniques used to exploit our multiprocessor (the BBN TC2000) on a network simulation program, showing the resulting performance gains and the associated programming costs. We show that an efficient implementation relies heavily on the user's ability to explicitly manage the memory system.
Attribute Core Computation Based on Divide and Conquer Method
Authors: Feng Hu, Guoyin Wang, Ying Xia
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The idea of divide and conquer method is used in developing algorithms of rough set theory. In this paper, according to the partitions of equivalence relations on attributes of decision tables, two novel algorithms for computing attribute core based on divide and conquer method are proposed. Firstly, a new algorithm for computing the positive region of a decision table is proposed, and its time complexity is O(|U|×|C|), where, |U| is the size of the set of objects and C is the size of the set of attributes. Secondly, a new algorithm for computing the attribute core of a decision table is developed, and its time complexity is O(|U|×|C|2). Both these two algorithms are linear with |U|. Simulation experiment results show that the algorithm of computing attribute core is not only efficient, but also adapt to huge data sets.
A Textbook for the Semantic Web
Authors: Minor Gordon
Venue: IEEE Distributed Systems Online (2004)

A review of Knowledge Representation: Logical, Philosophical, and Computational Foundations by John F. Sowa The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Discovering Focused Information and Mining Information Focus Based on Isomorphic Information Temperature
Authors: Zhou Qihai, Huang Tao, Zhang Yuanxin, Wu Hongyu, Li Zhongjun, Lin Xun
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

At present the problems that people want to solve anxiously are: Facing the huge information data pool, how to carry on the effective data mining; in the highly dynamic information source which is the standard to the importance of the information and the degree paid attention to, how to seek the “focus” (namely focus information) from the society, the economy, the life in different time and region. In this paper, “degree which people pay close attention to different information” are studied; a measurement of information significance “Isomorphic Information Temperature” is raised. And then combining with the technology of computer and internet; the frameworks for single text focus mining system model, text-base focus mining system model and web page focus mining system model are constructed respectively.
An Analyzer of the User Event for Interactive DMB
Authors: Hlaing Su Khin, Sangwook Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The interactive digital multimedia broadcasting stands for a convergence application between digital multimedia broadcasting service and wireless internet service. It develops MPEG-4 BIFS (Binary Format for Scene) technologies which is standard component of associated data service for DMB. In this paper, we propose system architecture of the interactive DMB, called the interaction manager. The interactive DMB facilitates to transmit interactive contents and user can easily use these contents by clicking or typing some additional information. The proposed interactive DMB system can capture and response user interaction information by using the return channel. In this paper, we are mainly focused on extracting the event data of the user interaction on the device. We suggest an analyzer to catch the user event and transform into a specific format for bidirectional DMB service system.
Power up your e-mail with Mutt
Authors: Victor Gregorio
Venue: Linux Journal (2008)

See how Mutt's text-based display outperforms the rest.
Rule-Based Assistance to Brain Tumour Diagnosis Using LR-FIR
Authors: Àngela Nebot, Félix Castro, Alfredo Vellido, Margarida Julià-Sapé, Carles Arús
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper describes a process of rule-extraction from a multi-centre brain tumour database consisting of nuclear magnetic resonance spectroscopic signals. The expert diagnosis of human brain tumours can benefit from computer-aided assistance, which has to be readily interpretable by clinicians. Interpretation can be achieved through rule extraction, which is here performed using the LR-FIR algorithm, a method based on fuzzy logic. The experimental results of the classification of three groups of tumours indicate in this study that just three spectral frequencies, out of the 195 from a range pre-selected by experts, are enough to represent, in a simple and intuitive manner, most of the knowledge required to discriminate these groups.