ppxscal/embedding_network huggingface dataset:
Intellectual Property and FCC Considerations for Startups Involved with Wireless Technology
Authors: Dennis Fernandez
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

It is important for startups involved in today's wireless revolution to employ sound IP strategies. More specifically, copyrights, trade secretes, and maskworks can provide additional protection for a disclosure that is being patented. Furthermore, timing strategies should also be considered in fillings for a patent and obtaining FCC approval. Startups may also consider FCC's competition policies as an incentive to create new applications for current and forthcoming wireless technologies.
A Self-Adaptive Image Encryption Algorithm Based on Composite Discrete Chaotic System
Authors: Sheng-bing Che, Da Huang, Guang Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Composite discrete chaotic iterative system keeps all characteristics of single chaotic iterative system and its dynamic behavior is more complicated. While the key generated from composite discrete chaotic iterative system is independent identically distributed, encrypt the image by using the key and self- adaptive image scramble algorithm can get a satisfied result. When the length of the entire key is more than 128 bits, the encryption system is very strong under attack.
Rule value reinforcement learning for cognitive agents
Authors: Chris Child, Kostas Stathis
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

RVRL (Rule Value Reinforcement Learning) is a new algorithm which extends an existing learning framework that models the environment of a situated agent using a probabilistic rule representation. The algorithm attaches values to learned rules by adapting reinforcement learning. Structure captured by the rules is used to form a policy. The resulting rule values represent the utility of taking an action if the rule's conditions are present in the agent's current percept. Advantages of the new framework are demonstrated, through examples in a predator-prey environment.
Implementation Results of a Configurable Membership Protocol for Active Safety Systems
Authors: Carl Bergenhem, Johan Karlsson, Christian Archer, Andreas Sjoblom
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

This paper describes a configurable membership protocol for distributed tasks in time-triggered systems that combine static and dynamic messages such as TTCAN or Flexray. The units of membership are processes in nodes that send messages in static communication slots. The objective is to give nodes a consistent view of the status of processes in the system. Process failures are assumed to be manifested as missing messages (fail-silent assumption). Whenever a node detects a change in the membership status of any process, it broadcasts its opinion about the membership status of all processes. This information is broadcast only by nodes that detect a change of local membership status. The protocol is implemented in a distributed embedded system with TTCAN-communication. The response-time of the protocol has been evaluated experimentally by means of fault injection.
How BMC is Scaling Agile Development
Authors: Israel Gat
Venue: Proceedings of the conference on AGILE 2006 (2006)

This report examines the large-scale deployment of agile software development in the Infrastructure Management Business Unit of BMC Software. The paper identifies and demonstrates several critical success, factors - such as empowerment, risk taking, and top-notch agile consulting - applying agile methodology as part of the overall software engineering "stack" and changing organizational structures. In particular, it highlights the relationship between empowerment and risk-taking, and suggests that the two should be managed in tandem as the foundation on which successful agile projects can evolve. Finally, the paper emphasizes the importance of implementing agile methodology across multiple corporate functions - marketing, sales, support, professional services, etc. It concludes with a review of the benefits that this approach provides to the end customers.
Distributed Disaster Information System over Japan Gigabit Network
Authors: Hiroyuki Echigo, Hiroaki Yuze, Tsuyoshi Hoshikawa, Kazuo Takahata, Nobuhiro Sawano, Yoshitaka Shibata
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper, a robust and large scale residentoriented safety information system on the occurrence of the various disasters constructed over a nationwide high-speed network is introduced. The resident evacuated can registered his/her safety information in the local safety information servers in the evacuation area whether he/she can safely evaluated or not using mobile PCs or terminals at the evacuation area or mobile terminals on the way of evacuation. All of the local information servers are connected each other by wireless network and the safety information can be sent an upper-layer database in the district area and finally integrated into a district safety information in that region. In our system some of the damaged local servers due to the disaster can be detected and recovered manually by the upper-layer database server. On the other hand, the upper-layer database servers are backed up by mirror servers located to mutually different locations with long distance to isolate the influence to the same disaster when the some of them were destroyed or disordered. Thus, by introducing two levels of redundancy and backup functions, more large scale and robust safety information database system can be realized.
Circulant weighing matrices of weight 22t
Authors: K. T. Arasu, Ka Hin Leung, Siu Lun Ma, Ali Nabavi, D. K. Ray-Chaudhuri
Venue: Designs, Codes and Cryptography (2006)

A weighing matrix of weight k is a square matrix M with entries 0, ± 1 such that MM T = kI n . We study the case that M is a circulant and k = 22t for some positive integer t. New structural results are obtained. Based on these results, we make a complete computer search for all circulant weighing matrices of order 16.
Correlating Scenes as Series of Document Sentences with Images
Authors: Yoshiko ITABASHI, Yoshifumi MASUNAGA
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

With the popularization of the Internet and the development of multimedia technology, various data are produced and disseminated in different media such as documents, images, photographs, pictures, and movies. Therefore, there are a variety of data in different media which represent the same contents. However, the method of correlating data in different media having the same contents has not yet been established. This paper proposes a method of correlating a document with an image, both of which express the similar contents. This method bases upon the observation that a series of sentences in a document could constitute a scene, and by utilizing the similarity measure of the vector space model as a criterion, we could correlate a scene with an image if their similarity is high. An experimental result of the above-mentioned method is shown taking "The Tale of Genji" and the photographs taken on the subject of this tale, as an example. It is shown that the method works fairly good as it is intended, however there still remain difficult problems for improvement.
Calmness and Exact Penalization in Vector Optimization with Cone Constraints
Authors: X. X. Huang, K. L. Teo, X. Q. Yang
Venue: Computational Optimization and Applications (2006)

In this paper, a (local) calmness condition of order ¿ is introduced for a general vector optimization problem with cone constraints in infinite dimensional spaces. It is shown that the (local) calmness is equivalent to the (local) exact penalization of a vector-valued penalty function for the constrained vector optimization problem. Several necessary and sufficient conditions for the local calmness of order ¿ are established. Finally, it is shown that the local calmness of order 1 implies the existence of normal Lagrange multipliers.
An incrementally maintainable index for approximate lookups in hierarchical data
Authors: Nikolaus Augsten, Michael Böhlen, Johann Gamper
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Several recent papers argue for approximate lookups in hierarchical data and propose index structures that support approximate searches in large sets of hierarchical data. These index structures must be updated if the underlying data changes. Since the performance of a full index reconstruction is prohibitive, the index must be updated incrementally.We propose a persistent and incrementally maintainable index for approximate lookups in hierarchical data. The index is based on small tree patterns, called pq-grams. It supports efficient updates in response to structure and value changes in hierarchical data and is based on the log of tree edit operations. We prove the correctness of the incremental maintenance for sequences of edit operations. Our algorithms identify a small set of pq-grams that must be updated to maintain the index. The experimental results with synthetic and real data confirm the scalability of our approach.
Robust services in dynamic systems
Authors: Barbara H. Liskov
Venue:  (2005)

Our growing reliance on online services accessible on the Internet demands highly-available systems that work correctly without interruption. This thesis extends previous work on Byzantine-fault-tolerant replication to meet the new requirements of current Internet services: scalability and the ability to reconfigure the service automatically in the presence of a changing system membership. Our solution addresses two important problems that appear in dynamic replicated services: First, we present a membership service that provides servers and clients in the system with a sequence of consistent views of the system membership (i.e., the set, of currently available servers). The membership service is designed to be scalable, and to handle membership changes mostly automatically. Furthermore, the membership service is itself reconfigurable, and tolerates arbitrary faults of a subset of the servers that are implementing it at any instant. The second part of our solution is a generic methodology for transforming replicated services that assume a fixed membership into services that support a dynamic system membership. The methodology uses the output from the membership service to decide when to reconfigure. We built two example services using this methodology: a dynamic Byzantine quorum system that supports read and write operations, and a dynamic Byzantine state machine replication system that supports any deterministic service. The final contribution of this thesis is an analytic study that points out an obstacle to the deployment of replicated services based on a dynamic membership. The basic problem is that maintaining redundancy levels for the service state as servers join and leave the system is costly in terms of network bandwidth. To evaluate how dynamic the system membership can be, we developed a model for the cost of state maintenance in dynamic replicated services, and we use treasured values from real-world traces to determine possible values for the parameters of the model. We conclude that certain deployments (like a volunteer-based system) are incompatible with the goals of large-scale reliable services. We implemented the membership service and the two example services. Our performance results show that the membership service is scalable, and our replicated services perform well, even during reconfigurations. (Abstract shortened by UMI.)
Self-Managing Application Composition for Cross-Platform Operating Environments
Authors: Stefan Paal, Reiner Kammuller, Bernd Freisleben
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

In cross-platform operating environments consisting of heterogeneous computing nodes, spontaneous application execution is a challenging task. Application components are not deployed on each computing node but are uploaded to distributed code repositories. The actual application deployment and composition has to be performed for each computing node individually. In this paper, a self-managing composition framework is presented to support the separated management of component deployment and application composition. On the one hand, it enables the specific packaging and description of application components. On the other hand, it manages the lookup and binding of suitable application components on-demand. The realization and use of the approach is described and its application in a cross-platform operating environment is illustrated.
Clustering is not rocket science
Authors: Rowan Gollan, Andrew Denman, Marlies Hankel
Venue: Linux Journal (2006)

Want to compute rocket science without having to be a rocket scientist?
SIIPU*S: A Semantic Pattern Learning Algorithm
Authors: Dawei Hu, Liu Wenyin, Enhong Chen, Xiaoping Chen, Xin Li
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The efficacy of pattern-based question answering system is mostly determined by the size of the semantic pattern base and the expression capability of the semantic patterns. We find that the expression capabilities of semantic patterns are determined by their instantiation degrees. Hence, we propose an evaluation strategy named Semantic Identifiability Inverse Pattern Universality (SIIPU), using which we can estimate the instantiation degree of a pattern for a certain semantic requirement. Moreover, on the basis of SIIPU, we propose a semantic pattern learning algorithm named SIIPU*S. Using SIIPU*S we can extract the semantic patterns at the most appropriate instantiation level for a given semantic requirement from a training corpus. Preliminary results show the proposed method's efficacy to extract patterns at different instantiation levels and their effects in analyzing questions.
Invocation profile characterization of Java applications
Authors: A. Barisone
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

Low performance of Java code execution (J. Gosling et al., 1996) has risen in the computer science community the awareness of the need for reengineering. This is mainly due to the software layer called Java Virtual Machine (T. Lindholm and F. Yellin, 1997), which allows Java applications to be multiplatform, but also to object oriented languages features, that impose a higher performance cost than procedural languages (B. Calder et al., 1994). Dynamic message dispatching (also called virtual invocation), for instance, is the mechanism that allows polymorphism, one of the most interesting features of object oriented technology. Comparing this mechanism with a statically resolved function call, two kinds of overhead can be singled out (a direct cost and an indirect cost) (K. Driesen and U. Holzle, 1996), that make the utilization of virtual invocations time-consuming. The authors present an analysis of the invocation profile of Java applications, assessing the actual necessity for dynamic dispatching, analyzing the related performance costs and determining rules for an algorithm for the automatic inlining of methods.
Quadratically constrained adaptive beamforming in coherent interference environments
Authors: F. Qian, B. D. Van Veen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

In linearly constrained minimum variance (LCMV) adaptive beamforming, signal cancellation often results if coherent interferers are present. The authors propose adding a constraint to prevent such signal cancellation. The additional constraint limits the beamformer output mean squared error to be less than a specified level for a set of likely interference scenarios and is thus a quadratic constraint. For a properly chosen constraint, it is shown that the original LCMV adaptive beamformer's signal cancellation can be reduced to an arbitrarily small level without interference cancellation degradation. This approach does not require a uniform array structure and is applicable to both broadband and narrowband signals. Its effectiveness is illustrated through simulation results.
Simulation input updating using Bayesian techniques
Authors: Tae Hwan Chung, Yasser Mohamed, Simaan AbouRizk
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation built on assumption and approximation has been traditionally utilized to make predictions prior to construction. Although there are many benefits of simulation such as its capability of multiple experiments with various scenario assumptions, it may lead to erroneous predictions when simulation input data are not accurate. Long-term repetitive projects such as tunnel construction provide opportunities to fine-tune the simulation input parameters based on real project progress. Bayesian updating techniques represent a very effective approach to enhance the quality of the estimates based on the observed data. This paper outlines some benefits that can be achieved using Bayesian updating techniques. The major benefits of these techniques includes more accurate simulation outcome even at the early stage of the project.
A relevance feedback mechanism for cluster-based retrieval
Authors: Niall Rooney, David Patterson, Mykola Galushka, Vladimir Dobrynin
Venue: Information Processing and Management: an International Journal (2006)

Contextual document clustering is a novel approach which uses information theoretic measures to cluster semantically related documents bound together by an implicit set of concepts or themes of narrow specificity. It facilitates cluster-based retrieval by assessing the similarity between a query and the cluster themes' probability distribution. In this paper, we assess a relevance feedback mechanism, based on query refinement, that modifies the query's probability distribution using a small number of documents that have been judged relevant to the query. We demonstrate that by providing only one relevance judgment, a performance improvement of 33% was obtained.
Diverge-Merge Processor (DMP): Dynamic Predicated Execution of Complex Control-Flow Graphs Based on Frequently Executed Paths
Authors: Hyesoon Kim, Jose A. Joao, Onur Mutlu, Yale N. Patt
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

This paper proposes a new processor architecture for handling hard-to-predict branches, the diverge-merge processor (DMP). The goal of this paradigm is to eliminate branch mispredictions due to hard-to-predict dynamic branches by dynamically predicating them without requiring ISA support for predicate registers and predicated instructions. To achieve this without incurring large hardware cost and complexity, the compiler provides control-flow information by hints and the processor dynamically predicates instructions only on frequently executed program paths. The key insight behind DMP is that most control-flow graphs look and behave like simple hammock (if-else) structures when only frequently executed paths in the graphs are considered. Therefore, DMP can dynamically predicate a much larger set of branches than simple hammock branches. This paper proposes a new processor architecture for handling hard-to-predict branches, the diverge-merge processor (DMP). The goal of this paradigm is to eliminate branch mispredictions due to hard-to-predict dynamic branches by dynamically predicating them without requiring ISA support for predicate registers and predicated instructions. To achieve this without incurring large hardware cost and complexity, the compiler provides control-flow information by hints and the processor dynamically predicates instructions only on frequently executed program paths. The key insight behind DMP is that most control-flow graphs look and behave like simple hammock (if-else) structures when only frequently executed paths in the graphs are considered. Therefore, DMP can dynamically predicate a much larger set of branches than simple hammock branches.
A content-based image authentication system with lossless data hiding
Authors: Dekun Zou, Guorong Xuan, Y. Q. Shi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we present a novel content-based image authentication framework which embeds the authentication information into the host image using a lossless data hiding approach. In this framework the features of a target image are first extracted and signed using the digital signature algorithm (DSA). The authentication information is generated from the signature and the features are then inserted into the target image using a lossless data hiding algorithm. In this way, the unperturbed version of the original image can be obtained after the embedded data are extracted. An important advantage of our approach is that it can tolerate JPEG compression to a certain extent while rejecting common tampering to the image. The experimental results show that our framework works well with JPEG quality factors greater than or equal to 80 which are acceptable for most authentication applications.
Improving distribution center operations through simulation at Crutchfield Corporation
Authors: Paul G. Sherland, David Luria
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Crutchfield Corporation is a major consumer electronics catalog and Internet retailer with a reputation for outstanding customer service and support. The company is applying Six Sigma techniques to improve distribution center operations; however, wide variation in order arrival rates and the types of orders make workflow analyses difficult. Rust Management Technology, LLC, proposed developing a process simulation of the distribution center order handling workflow that could be used to study the impacts of changing order arrival patterns, labor allocations, and worker efficiencies. Working as a team, Crutchfield Corporation and Rust Management Technology used Extend and ExpertFit to develop and validate a distribution center process simulation. Using insights developed through the simulation, Crutchfield Corporation estimates that it will save 15 to 20 times the cost of the project in the first year after deployment.
Metaskills of collaborative inquiry in higher education
Authors: Hanni Muukkonen, Minna Lakkala
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Even if learners' expertise is bound to a specific field of inquiry, there are generalizable skills and competencies that provide intellectual resources for managing new problem-solving situations. Higher-level skills that emerge through sustained efforts of advancing knowledge may be called metaskills, their development being an appropriate long-term goal for higher education. Considering these goals, the individual, collective and knowledge-creation aspects of regulation of inquiry were examined within a university course.