ppxscal/embedding_network huggingface dataset:
Correlated Equilibrium of Bertrand Competition
Authors: John Wu
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

This paper explores the relation between equilibrium coarsenings and equilibrium refinements via Bertrand competition example and similar situations, it shows that the typical equilibrium coarsening --- a unique correlated equilibrium --- is equivalent to the unique Nash equilibrium itself, is also equivalent to the equilibrium refinement, for the standard n-firms Bertrand competition model with linear demand and symmetric, linear costs in the most special and simplest case, and compares some wonderful and remarkable differences of the existence, uniqueness, stability, connectivity, and strategic property of Nash equilibrium and correlated equilibrium between Cournot and Bertrand model. We also propose some open questions.
On the origins of bisimulation and coinduction
Authors: Davide Sangiorgi
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2009)

The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory. Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some historical remarks on the main fixed-point theorems (such as Knaster-Tarski) that underpin the fixed-point theory presented.
Development and Design of a New Logistics Information Management System
Authors: Wenzong Chi, Zhongyuan Wu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Along with the gradual maturity of distributed computing platform J2EE, J2EE has become the current mainstream enterprise application and development platform and J2EE/EJB technology makes system have a good technical foundation on expansibility, portability and flexibility. Against the background of a certain logistics management system development, an analysis and design of MVC design pattern under J2EE architecture is carried out in this paper. On business layer, the entity bean is encapsulated by session bean, which normalizes the client access, reduces the coupling between business layer and client end, centralizes security management and transaction control and improves the performance. Meanwhile, the value object is introduced into the system to encapsulate the interactive data between Web layer and business layer, which decreases the network overhead of the system.
EDP education: an acute crisis
Authors: Gopal K. Kapur
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

According to a recent AFIPS study, the estimated number of unfilled openings for trained programmers in 1970 was between 200,000 and 650,000; and for systems analysts there were between 60,000 and 200,000 positions available. Industrial leaders are the first to admit that existing educational facilities are not adequate to supply the quantity and quality of training needed to fill the present market requirements---not to mention the steadily increasing demand foreseen for the future. From these observations it is obvious that the full potential of the computers presently in use cannot be realized because of the scarcity of sufficiently qualified programmers and analysts. As a consequence, many present-day computer installations are on the brink of chaos.
Comparing the pre- and post-specified peer models for key agreement
Authors: Alfred Menezes, Berkant Ustaoglu
Venue: International Journal of Applied Cryptography (2009)

In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this article, we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in the pre- and post-specified peer models. We give examples of protocols that are secure in one model, but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and post-specified peer models.
Toward breast cancer diagnosis based on automated segmentation of masses in mammograms
Authors: Alfonso Rojas Domínguez, Asoke K. Nandi
Venue: Pattern Recognition (2009)

This work explores the use of characterization features extracted based on breast-mass contours obtained by automated segmentation methods, for the classification of masses in mammograms according to their diagnosis (benign or malignant). Two sets of mass contours were obtained via two segmentation methods (a dynamic-programming-based method and a constrained region-growing method), and simplified versions of these contours (modeling the contours as ellipses) were employed to extract a set of six features designed for characterization of mass margins (contrast between foreground region and background region, coefficient of variation of edge strength, two measures of the fuzziness of mass margins, a measure of spiculation based on relative gradient orientation, and a measure of spiculation based on edge-signature information). Three popular classifiers (Bayesian classifier, Fisher's linear discriminant, and a support vector machine) were then used to predict the diagnosis of a set of 349 masses based on each of said features and some combinations of these. The systems (each system consists of a segmentation method, a featureset, and a classifier) were compared with each other in terms of their performance on the diagnosis of the set of breast masses. It was found that, although there was a percent difference of about 14% in the average segmentation quality between methods, this was translated into an average percent difference of only 4% in the classification performance. It was also observed that the spiculation feature based on edge-signature information was distinctly better than the rest of the features, although it is not very robust to changes in the quality of the segmentation. All systems were more efficient in predicting the diagnosis of benign masses than that of the malignant masses, resulting in low sensitivity and high specificity values (e.g. 0.6 and 0.8, respectively) since the positive class in the classification experiments is the set of malignant masses. It was concluded that features extracted from automated contours can contribute to the diagnosis of breast masses in screening programs by correctly identifying a majority of benign masses.
Recent status and future direction of EUV resist technology
Authors: Toshiro Itani
Venue: Microelectronic Engineering (2009)

The recent status of EUV resists is described based on experimental results using the small field exposure tool (SFET by EUVA/Canon) and full-field exposure tool (EUV1 by Nikon). Both exposure tools are linked to a coater/developer track system (Clean track ACT12 by Tokyo Electron) under a chemically controlled environment. The SFET, which was installed for the acceleration of the development of resist materials and processes, showed resist resolution limits of 25-26nm half pitch (hp) lines-and-spaces (L/S). On the other hand, the EUV1, which is utilized to demonstrate that lithography integration, is a viable path to making EUV lithography a practical production technology, showed first static exposures with the resolution of 30nm hp L/S and isolated lines and 30nm holes. The potential resolution was found to be as good as 28nm hp L/S. Based on these results; it was shown that progress was made regarding EUV resist resolution and sensitivity. However, accelerated improvement of line-width roughness (LWR) is still needed. The description of methods being developed to provide answers in the improvement of LWR is also discussed.
A survey of NETLMM in all-IP-based wireless networks
Authors: Bonam Kim, Junmo Yang, Ilsun You
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The recent advances in network-based localized mobility management (NETLMM) have facilitated the realization of All-IP based Wireless Networks. In this paper, the Proxy Mobile IPv6 (PMIPv6) actively standardized by the IETF NETLMM working group has been investigated. To explore the availability of network-based localized mobility management, the technological progress of PMIPv6 is discussed. Besides, the comparison of PMIPv6 with existing mobility management schemes is also explained. In addition, the procedure of signaling process and the simplified analysis of PMIPv6 in terms of the handoff latency are presented. Furthermore, practical applications and related open research challenges are illustrated in this paper. In addition, NETLMM in wireless mesh networks (WMNs) is discussed. Although NETLMM is not a totally new paradigm in IP study, it has been re-focused with the trend of convergence in All-IP based Wireless Networks to enhance the network performance in terms of the geographically specialized networks.
Capturing topology-level implications of link synthesis techniques for nanoscale networks-on-chip
Authors: Daniele Ludovici, Georgi Nedeltchev Gaydadjiev, Davide Bertozzi, Luca Benini
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In the context of nanoscale networks-on-chip (NoCs), each link implementation solution is not just a specific synthesis optimization technique with local performance and power implications, but gives rise to a well-differentiated point in the architecture design space. This in an effect of the tight interaction existing between architecture and physical design layers in nanoscale technologies. This work assesses several NoC link inference techniques (buffering options, link pipelining) by means of commercial backend synthesis tools, taking the system-level perspective. In fact, performance speed-ups and power overhead are not evaluated for the links in isolation but for the network topology as a whole, thus showing their sensitivity to the link inference strategy. k-ary n-mesh topologies are considered for the sake of analysis, in that they provide a range of topologies with increasing total wirelength.
It's Mine
Authors: Nicolai Fuglsig
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Leave it to Coke to turn a peaceful parade into an epic battle between iconic cartoon characters just in time for Super Bowl Sunday. Opening on a crisp fall morning, this spot reveals a bird's-eye view of New York City's Central Park during the Macy's Tanksgiving Day Parade. A playfully intense fight occurs between Stewie (The Family Guy) and the classic superhero, Underdog. They soar through the Manhattan sky hovering and tumbling amongst the city buildings, their handling ropes dangling beneath, as they duke it out for a floating Coke bottle. But instead, a different loveable loser wins out in the end!
Partitioning methods for multi-version XML data warehouses
Authors: Laura Irina Rusu, Wenny Rahayu, David Taniar
Venue: Distributed and Parallel Databases (2009)

Due to an explosive increase of XML documents, it is imperative to manage XML data in an XML data warehouse. XML warehousing imposes challenges, which are not found in the relational data warehouses. In this paper, we firstly present a framework to build an XML data warehouse schema. For the purpose of scalability due to the increase of data volume, we propose a number of partitioning techniques for multi-version XML data warehouses, including document based partitioning, schema based partitioning, and cascaded (mixed) partitioning model. Finally, we formulate cost models to evaluate various types of queries for an XML data warehouse.
Verification of Security Protocols
Authors: Véronique Cortier
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Security protocols are short programs aiming at securing communications over a network. They are widely used in our everyday life. They may achieve various goals depending on the application: confidentiality, authenticity, privacy, anonymity, fairness, etc. Their verification using symbolic models has shown its interest for detecting attacks and proving security properties. A famous example is the Needham-Schroeder protocol [23] on which G. Lowe discovered a flaw 17 years after its publication [20]. Secrecy preservation has been proved to be co-NPcomplete for a bounded number of sessions [24], and decidable for an unbounded number of sessions under some additional restrictions (e.g. [3,12,13,25]). Many tools have also been developed to automatically verify cryptographic protocols like [8,21].
Modeling for Ethernet Passive Optical Network Link
Authors: Zhang Liang, Wang Zhigong, Hu Qingsheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A behavior model for the communication link of Ethernet Passive Optical Network (EPON) is presented. It consists of a fiber, a photodiode, a transimpedance amplifier (TIA) followed by a limiting amplifier and a clock and data recovery (CDR) circuit. Each part of the model is based on the architecture of its circuit to improve the model accuracy. The noise and jitter in each block is also considered. The performance of the system can be evaluated from the simulation of the behavior model. The simulation of the link is presented. Simulation results of the proposed model show a good agreement with experimental results. The complete behavior model can be useful in analysis of Ethernet passive optical network communication systems
Using an improved C4.5 for imbalanced dataset of intrusion
Authors: Quan Zhou, Lin-gang Gu, Chong-jun Wang, Wang-jun, Shi-fu Chen
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

The imbalance of dataset will directly affect the precision of classifier. PC4.5, an improved C4.5 algorithm is proposed. The experiments in MIT dataset indicate that PC4.5 is effective on imbalanced dataset and the scale of the decision tree could be reduced.
Neimark-Sacker bifurcation in an internet congestion control model
Authors: Gabriela Mircea, Mihaela Muntean
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we consider an Internet model, which responds to congestion signals from the network, and we study the bifurcation of such a system. The paper analyzes the Neimark-Sacker bifurcation for a dynamic system with discrete time, which describes Internet congestion. Finally a numerical example is given to verify the theoretical analysis.
Exploring Music Video Editing Rules with Dual-Wing Harmonium Model
Authors: Chao Liao, Patricia P. Wang, Yimin Zhang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Automatic music video editing is still a challenging task due to the lack of knowledge of how music and video are matched to produce attractive effects. Previous works usually matches music and video following assumption or empirical knowledge. In this paper, we use a dual-wing harmonium model to learn and represent the underlying music video editing rules from a large dataset of music videos. The editing rules are extracted by clustering the low dimensional representation of music video clips. In the experiments, we give an intuitive visualization for the discovered editing rules. These editing rules partially reflect professional music video editor's skills and can be used to further improve the quality of automatically generated music video.
From motion capture to interactive animation: creation of interactive animations for non-verbal storytelling
Authors: Jean-Marc Gauthier
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

Jean-Marc Gauthier is director of the new animation and digital arts Master of Fine Arts program for New York University Tisch School of the Arts Asia, located in Singapore. He will talk about the program curriculum, covering traditional animation, interactive animation, gaming, and motion studies applied to design. Animation and digital arts students are immersed in a unique and creative environment that teaches traditional forms of the art of animation and explores a sandbox of advanced and digital technologies. The presentation will cover "Life motion Analysis: ways to visualize motion from real life", an example of collaborative work based on motion capture and designed for people from different disciplines. Jean-Marc will discuss interactive animation projects developed in class, figure 1, and how actors, dancers, storytellers, film makers, animators and others can bring invaluable depth to what can be produced.
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
Authors: Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

In this paper, we introduce the study of prize-collecting network design problems having general connectivity requirements. Prior work considered only 0-1 or very limited connectivity requirements. We introduce general connectivity requirements in the prize-collecting generalized Steiner tree framework of Hajiaghayi and Jain [9], and consider penalty functions linear in the violation of the connectivity requirements. Using Jain&rsquo;s iterated rounding algorithm [11] as a black box, and ideas from Goemans [7] and Levi, Lodi, Sviridenko [14], we give a 2.54-factor approximation algorithm for the problem. We also generalize the 0-1 requirements of PCF problem introduced by Sharma, Swamy, and Williamson [15] to include general connectivity requirements. Here we assume that the monotone submodular penalty function of Sharma et al. is generalized to a multiset function that can be decomposed into functions in the same form as that of Sharma et al. Using ideas from Goemans and Berstimas [6], we give an (&alpha;logK)-approximation algorithm for the resulting problem, where K is the maximum connectivity requirement, and &alpha;=&thinsp;2.54.
Tracking Multiple Occluding People by Localizing on Multiple Scene Planes
Authors: Saad M. Khan, Mubarak Shah
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Occlusion and lack of visibility in crowded and cluttered scenes make it difficult to track individual people correctly and consistently, particularly in a single view. We present a multi-view approach to solving this problem. In our approach we neither detect nor track objects from any single camera or camera pair; rather evidence is gathered from all the cameras into a synergistic framework and detection and tracking results are propagated back to each view. Unlike other multi-view approaches that require fully calibrated views our approach is purely image-based and uses only 2D constructs. To this end we develop a planar homographic occupancy constraint that fuses foreground likelihood information from multiple views, to resolve occlusions and localize people on a reference scene plane. For greater robustness this process is extended to multiple planes parallel to the reference plane in the framework of plane to plane homologies. Our fusion methodology also models scene clutter using the Schmieder and Weathersby clutter measure, which acts as a confidence prior, to assign higher fusion weight to views with lesser clutter. Detection and tracking are performed simultaneously by graph cuts segmentation of tracks in the space-time occupancy likelihood data. Experimental results with detailed qualitative and quantitative analysis, are demonstrated in challenging multi-view, crowded scenes.
A new approach to evolutionary based algorithm "Bisected algorithm"
Authors: Ghanbari Shamsollah
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The idea of Evolutionary Computing was introduced for the first time in the 1960s. It has been successfully applied to solve a variety of problems such as optimization [1,2], solving NP problems, scheduling and etc. We have found a new approach to Evolutionary Computing as "Bisected Algorithm" to which in this paper we have attended to explain it completely.
Video Prompting and Indoor Wayfinding Based on Bluetooth Beacons: A Case Study in Supported Employment for People with Severe Mental Illness
Authors: Yao-Jen Chang, Yan-Ru Chen, Chia Yu Chang, Tsen-Yung Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

A novel wayfinding system is presented with an aim to increase workplace and life independence for cognitive-impaired patients such as people with traumatic brain injury, cerebral palsy, mental retardation, schizophrenia, and Alzheimer's disease. According to psychological model of spatial navigation and the requirements of rehabilitation professionals, PDA prompting with navigation video at the right time and place can assist cognitively-impaired persons with navigating indoors or on the road. The experimental results show the computer-human interface is friendly and the capabilities of wayfinding are reliable.
Vehicular Networks: From Theory to Practice, 1 edition
Authors: Stephan Olariu, Michele C. Weigle
Venue: Chapman & Hall/Crc Computer And Information Science Series (2009)

In spite of their importance and potential societal impact, there is currently no comprehensive source of information about vehicular ad hoc networks (VANETs). Cohesively integrating the state of the art in this emerging field, Vehicular Networks: From Theory to Practice elucidates many issues involved in vehicular networking, including traffic engineering, human factors studies, and novel computer science research. Divided into six broad sections, the book begins with an overview of traffic engineering issues, such as traffic monitoring and traffic flow modeling. It then introduces governmental and industrial efforts in the United States and Europe to set standards and perform field tests on the feasibility of vehicular networks. After highlighting innovative applications enabled by vehicular networks, the book discusses several networking-related issues, including routing and localization. The following section focuses on simulation, which is currently the primary method for evaluating vehicular networking systems. The final part explores the extent and impact of driver distraction with in-vehicle displays. Encompassing both introductory and advanced concepts, this guide covers the various areas that impact the design of applications for vehicular networks. It details key research challenges, offers guidance on developing future standards, and supplies valuable information on existing experimental studies.
OPEDo: a tool for the optimization of performance and dependability models
Authors: Markus Arns, Peter Buchholz, Dennis Müller
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

OPEDo is a software tool for the optimization of discrete event systems according to performance or dependability measures. The tool can be seen as an add on to various tools for performance and dependability analysis. The goal of OPEDo is to provide a wide variety of optimization algorithms for complex black box functions as they are required for the model based optimization of discrete event systems using analytically tractable models or simulation models. The paper introduces the software architecture of the tool, gives a brief sketch of the integrated optimization algorithms and presents several examples.