Abstract
This abstract is used as an example, with the permission of Evgeniy Tatolov.
Original: http://masters.donntu.org/2011/fknt/tatolov/diss/indexe.htm
—одержание
- Introduction
- 1. Theme urgency
- 2. Goal and tasks of the research
- 3. An approach to the unification of synthesis of Moore FSM on FPGA
- Conclusion
- References
Introduction
Digital systems are widely used as basic elements of computer technologies, automatics, robotics, manufacturing, transport. Creation of very large-scale integration circuits (VLSI), building of systems-on-chip (SoC), development of field-programmable gate arrays (FPGAs) and complex programmable logic devices (CPLDs) changed the basis of implementation digital systems and proposed increased requirements to the process of their design, which has led to the widespread using of computer-aided design (CAD) tools and hardware description languages (HDLs). All this should raise quality of the resultant product, promote in realization of multifold analysis and testing. Besides, new base-oriented methods of combinational and sequential synthesis of logical circuits were created, the greatest effectiveness from which can be reached in the case of application automation and joint combined using with already known algorithms.
Model of Moore finite state machine (FSM, offered by E. Moore in 1956 and named in his honor), as synchronous sequential circuit, is the part of numerous digital systems and is used in construction of control devices. High complexity of integrated circuits (which is increasing, according to the G. Moore's law) and theoretical basis of automatic calculations make possible the implementation of comprehensive algorithms of processing information. However direct realization of algorithms can lead to inefficient using of crystal's resources and extension of project's cost.
1. Theme urgency
The number of methods of Moore FSM's hardware optimization is known: minimization of the amount of states (state reduction) and their specific encoding (state assignment), using features of target basis and algorithm of functioning, multilevel logic circuit's implementation. Mentioned methods are quite effective, but for getting the most economic FSM's implementation they have to be used jointly.
Master's work is dedicated to the actual scientific task of development a unified approach to the synthesis of Moore FSM, which is directing on hardware amount reduction in resultant device and is including algorithmic, combinatory and circuitry optimizing techniques. FPGAs by Xilinx, which combine functionality, programmability and availability to consumers, are used as the target basis. CAD Xilinx ISE, Verilog HDL and Java SE are applied as tools of the research.
2. Goal and tasks of the research
Development of an approach to the unification of synthesis Moore FSM, directing on hardware amount reduction in FPGA is the goal of research.
Main tasks of the research:
- Analysis methods of minimization amount of states in completely and incompletely specified Moore FSM.
- Estimation ways of hardware amount reduction with the help of encoding states of Moore FSM.
- Search and detection characteristics of existing construction methods of logic circuits of Moore FSM and estimation possibilities of their use on FPGA.
- Association of functionally different optimization directions of Moore FSM hardware amount into the unified approach to synthesis and formation recommendations for it's use.
- Design of alternative variants of basic stages of unified Moore FSM synthesis process and estimate of it's efficiency.
Research object: Moore FSM synthesis.
Research subject: association of hardware amount reduction methods at Moore FSM implementation on FPGA.
3. An approach to the unification of synthesis of Moore FSM on FPGA
An approach to the unification of synthesis of Moore FSM on FPGA is offered in article [1]. It joints several possibilities of optimization and is directed on FPGA (fig. 1). Entity of an approach consists in sequential application of algorithmic, combinatory and circuitry stages and using FPGA-oriented tools: CAD and HDLs.
On the first step of algorithmic stage of synthesis, arbitrary Moore FSM specification is led to a uniform type Ц state transition table. Necessity of leading to a uniform type is caused by possibility of specification Moore FSM with the help of different representation forms, such as: graph schemes of algorithm, state diagrams, ASM-diagrams (ASM Ц Algorithmic State Machine) [2-4]. Second step of algorithmic stage consists of minimization of the state transition table. Algorithms of Brzozowski, ARNES, SMAS, CHESMIN, SLIM, HSM2, STAMINA, OPTIMIST, BICA, ISM can be used for this [3, 5-16].
Combinatory stage is directed on effective encoding of minimized transition table's states and, also, on receiving of hardware-minimum functions of the next state and, at necessity, of output functions of FSM. Considerable influence of states encoding method on parameters of resultant logical circuit caused development of various approaches, directed on decreasing of power expenses, high-speed performance, minimization of hardware amount. The last one of these approaches can be used on combinatory stage of synthesis with the help of application, adaptation and modification of MUSTANG, MUSE, FEL-Code, JEDI, NOVA, Two-Hot Encoding, DISA, one-hot and positional-binary states encoding algorithms [17-37].
Circuitry stage of synthesis process assumes using Moore FSM logical circuit's construction methods, directing on reduction of hardware amount of target chip. Trivial and multilevel implementations, structures with transformation of objects codes, circuits on counters can be carried to these methods [37]. Modern digital design is oriented on using HDLs (basically, VHDL and Verilog), because of what the second step of circuitry stage is development of HDL program, which describes Moore FSM and is suitable for processing of appropriate CAD and immersion into the chip.
The described unified synthesis process can be successfully implemented automatically and assume only user's administrative functions: describing of Moore FSM and choosing algorithms and structures, which should be used. Moreover, presented approach can be applied to the number of other modern basis (CPLD, ASIC) and define the general direction of optimizing works at synthesis of logic sequential circuits.
Five Verilog-programs, describing given Moore FSM [38] (fig. 2) in various ways, were designed for an estimation of unified synthesis process application to the exact example:
- Implementation of not minimized Moore FSM with the help of XST (Xilinx Synthesis Technology) analyzer [39] (experiment 1).
- Implementation of minimized Moore FSM with the help of XST (Xilinx Synthesis Technology) analyzer (experiment 2).
- Implementation of minimized Moore FSM on twoЦlevel circuit [40] with positional-binary states encoding. Use of ROM with asynchronous reading [39] (experiment 3).
- Implementation of minimized Moore FSM on twoЦlevel circuit with positional-binary states encoding. Use of ROM with synchronous reading [39] and an additional signal of synchronization (experiment 4).
- Implementation of minimized Moore FSM on twoЦlevel circuit with positional-binary states encoding. Use of ROM with synchronous reading and back front of the main signal of synchronization (experiment 5).
All researches were held with the help of CAD Xilinx ISE 13.1 for the family of FPGA Xilinx Spartan-3, namely for the chip XC3S200. Results for cumulative hardware amount for five variants of implementation are graphically shown on fig. 3.
If the goal of optimization is amount of LUT-cells, the best result has been received at use of twoЦlevel implementation of minimized Moore FSM with synchronous ROM and two signals of synchronization (experiment 4). In comparison with experiment 1, number of slices has decreased in 3 times, number of flip-flops Ц in 1,5 times, number of LUT-cells Ц in 2,5 times. However in this case has increased the total of circuit's outputs, number of synchronization signals and one RAM (Random Access Memory) module has been involved.
Conclusion
Qualitative synthesis of digital systems, and Moore automata in particular, is one of the areas of logic design,
and is not only theoretical research but also of practical interest. Development of optimal digital devices opens the way for
more efficient use of capacity basis the implementation of compaction
of projects, reduce material costs.
Master's work is devoted to actual scientific problem of combining the basic methods of minimizing the instrumental Moore automata. In the trials carried out:
- The structure of a unified process for the synthesis of Moore automata and defines the functions of its components.
- Based on analysis of the literature highlights the main algorithms that can be used in the proposed approach to the unification of the synthesis of Moore automata.
- A number of experiments on the use of a unified process for the synthesis of Moore automata, analyzed the results.
- The possibilities of integrated automation of the developed approach to the unification of the synthesis of Moore automata are estimated requirements for the software by searching for functionally similar software synthesis of sequential logic circuits.
Further studies focused on the following aspects:
- Qualitative improvement of the proposed approach to the unification of the synthesis of Moore automata, its complement and expand.
- Delimitation of the effectiveness of different variants of the basic stages of a unified process for the synthesis of Moore automata.
- Adaptation of known methods of constructing the logic of Moore automata to the base FPGA.
- Develop cross-platform functionality and computer-aided design of Moore automata (CAD) software that implements the proposed unified process synthesis.
This master's work is not completed yet. Final completion: December 2011. The full text of the work and materials on the topic can be obtained from the author or his head after this date.
References
- овалев —.ј. ѕодход к унификации процесса синтеза ћѕј ћура дл€ FPGA / —.ј. овалев, ».я. «еленЄва, ≈.–. “атолов // ћатериалы ƒвенадцатого международного научно-практического семинара «ѕрактика и перспективы развити€ партнерства в сфере высшей школы». Ц ƒонецк-“аганрог, 2011. Ц “ом 2. Ц —. 45-48.
- Mano M. Digital design / M. Mano. Ц Prentice Hall, 2003. Ц 516 pp.
- Nelson V. Digital logic circuit analysis and design / V. Nelson, H. Nagle, J. Irwin, B. Carroll. Ц Prentice Hall, 1995. Ц 842 pp.
- Barkalov A.A. Synthesis of operational and control automata / A.A. Barkalov, L.A. Titarenko. Ц Donetsk: DonNTU, TechPark DonNTU UNITECH, 2009. Ц 256 pp.
- Avedillo M.J. New approach to the state reduction in incompletely specified sequential machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. Ц New Orleans, 1990. Ц pp. 440-443.
- Avedillo M.J. SMAS: a program for the concurrent state reduction and state assignment of finite state machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. Ц 1991. Ц vol. 3. Ц pp. 1781-1784.
- Champarnaud J.-M. Split and minimizing: Brzozowski's algorithm / J.-M. Champarnaud, A. Khorsi, T. Paranthoen // Prague Stringology Conference. Ц Prague, 2002. Ц pp. 96-104.
- Goren S. CHESMIN: a heuristic for state reduction in incompletely specified finite state machines / S. Goren, F. Ferguson // Proceedings of the Conference on Design, Automation and Test in Europe. Ц 2002. Ц pp. 248-254.
- Higuchi H. A fast state reduction algorithm for incompletely specified finite state machines / H. Higuchi, Y. Matsunaga // 33rd Annual Conference of Design Automation. Ц Las Vegas, 1996. Ц pp. 463-466.
- Hu H. HSM2: a new heuristic state minimization algorithm for finite state machine / H. Hu, H.-X. Xue, J.-N. Bian // Journal of Computer Science and Technology. Ц 2004. Ц є 19 (5). Ц pp. 729-733.
- Rho J.-K. Exact and heuristic algorithms for the minimization of incompletely specified state machines / J.-K. Rho, G. Hachtel, F. Somenzi, R. Jacoby // IEEE Transactions on Computer-Aided Design. Ц 1994. Ц vol. 13. Ц pp. 167-177.
- Xu Y. Describing an n log n algorithm for minimizing states in deterministic finite automaton [Ёлектронный ресурс]. Ц –ежим доступа: http://www.cs.sun.ac.za....
- Fuhrer R.M. OPTIMIST: state minimization for optimal 2-level logic implementation / R.M. Fuhrer, S.M. Nowick // Proceedings of International Conference of Computer-Aided Design. Ц 1997. Ц pp. 308-315.
- Pena J.M. A new algorithm for exact reduction of incompletely specified finite state machines / J.M. Pena, A.L. Oliveira // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. Ц 1999. Ц vol. 18 (11). Ц pp. 1619-1632.
- Kam T. A fully implicit algorithm for exact state minimization / T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli // Proceedings of the Design Automation Conference. Ц 1994. Ц pp. 684-690.
- Almeida M. On the performance of automata minimization algorithms / M. Almeida, N. Moreira, R. Reis // Technical Report Series: DCC-2007-03. Ц 2007. Ц 12 pp.
- Slusarczyk A. State assignment techniques Ц short review [Ёлектронный ресурс]. Ц –ежим доступа: http://web.cecs.pdx.edu....
- De Micheli G. KISS: a program for optimal state assignment of finite state machines / G. De Micheli, R. Brayton, A. Sangiovanni-Vincentelli // Proceedings of IEEE International Conference of Computer-Aided Design. Ц Santa Clara, 1984. Ц pp. 209-211.
- De Micheli G. Optimal state assignment for finite state machines / G. De Micheli, R. Brayton, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design. Ц 1985. Ц pp. 269-285.
- De Micheli G. Optimal encoding of control logic / G. De Micheli // Proceedings of the International Conference on Circuits and Computer Design. Ц 1984. Ц pp. 16-22.
- El-Maleh A. Finite state machine state assignment for area and power minimization / A. El-Maleh, S.M. Sait, F.N. Khan // Proceedings of IEEE International Symposium on Circuits and Systems. Ц 2006. Ц pp. 5303-5306.
- Devadas S. MUSTANG: state assignment of finite state machines targeting multilevel logic implementations / S. Devadas, H.-K. Ma, A.R. Newton, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. Ц 1998. Ц vol. 7 (12). Ц pp. 1290-1300.
- Du X. MUSE: a multilevel symbolic encoding algorithm for state assignment / X. Du, G. Hachtel, B. Lin, A.R. Newton // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. Ц 1991. Ц vol. 10 (1). Ц pp. 28-38.
- Kubatova H. FEL-Code: FSM internal state encoding method / H. Kubatova, M. Becvar // Proceedings of 5th International Workshop on Boolean Problems. Ц Freiberg, 2002. Ц pp. 109-114.
- Lin B. Synthesis of multiple level logic from symbolic high-level description languages / B. Lin, A.R. Newton // Proceedings of the International Conference on VLSI. Ц Munich, 1989. Ц pp. 187-196.
- Villa T. NOVA: state assignment of finite-state machines for optimal two-level logic implementation / T. Villa, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design. Ц 1990. Ц pp. 905-924.
- Gupta, B.N.V.M. A state assignment scheme targeting performance and area / B.N.V.M. Gupta, H. Narayanan, M.P. Desai // Proceedings of 12th International Conference on VLSI Design. Ц 1999. Ц pp. 378-383.
- Martinez M. A dynamic model for the state assignment problem / M. Martinez, M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of Design, Automation and Test in Europe. Ц Paris, 1998. Ц pp. 835-839.
- Golson S. One-hot state machine design for FPGAs / S. Golson // Proceedings of the 3rd PLD Design Conference. Ц Santa Clara, 1993. Ц pp. 1-6.
- Almaini A. State assignment of finite state machines using a genetic algorithm / A. Almaini, J. Miller, P. Thomson, S. Billina // IEEE Proceedings on Computer and Digital Techniques. Ц 1995. Ц pp. 279-286.
- Amaral J. Designing genetic algorithms for the state assignment problem / J. Amaral, K. Turner, J. Chosh // IEEE Transactions on Systems, Man, and Cybernetics. Ц 1995. Ц vol. 25. Ц pp. 659-694.
- Chyzy M. Evolutionary algorithm for state assignment of finite state machines / M. Chyzy, W. Kosinski // Artificial Intelligence Methods. Ц Gliwice, 2003. Ц pp. 51-52.
- Nedjah N. Evolutionary synthesis of synchronous finite state machines / N. Nedjah, L.M. Mourelle // Evolvable Machines. Ц Berlin, 2004. Ц pp. 103-128.
- Chattopadhyay S. Area conscious state assignment with flip-flop and output polarity selection for finite state machine synthesis Ц a genetic algorithm approach / S. Chattopadhyay // The Computer Journal. Ц 2005. Ц vol. 48 (4). Ц pp. 443-450.
- Hasteer G. Parallel algorithms for state assignment of finite state machines. Master's thesis. Ц University of Illinois, 1996. Ц 58 pp.
- Bader D.A. A parallel state assignment algorithm for finite state machines / D.A. Bader, K. Madduri // Proceedings of IEEE Conference on High-Performance Computing. Ц Bangalore, 2004. Ц pp. 297-308.
- Ѕаркалов ј.ј. —интез микропрограммных автоматов на заказных и программируемых —Ѕ»— / ј.ј. Ѕаркалов, Ћ.ј. “итаренко. Ц ƒонецк: ƒонЌ“”, “ехнопарк ƒонЌ“” ”Ќ»“≈’, 2009. Ц 336 с.
- ”илкинсон Ѕ. ќсновы проектировани€ цифровых схем / Ѕ. ”илкинсон. Ц ћ.: »здательский дом
¬иль€мс
, 2004. Ц 320 с. - XST User Guide for Virtex-4, Virtex-5, Spartan-3, and Newer CPLD Devices [Ёлектронный ресурс]. Ц –ежим доступа: http://www.xilinx.com....
- Ѕаркалов ј.ј. —интез устройств управлени€ на программируемых логических устройствах / ј.ј. Ѕаркалов. Ц ƒонецк: ƒонЌ“”, 2002. Ц 262 с.


---
layout:post
categories:toeza
tags:toeza
title:How to Build a Sideboard
date:2016-12-07 14:32:45 +0800
---
Edit Article
How to Build a Sideboard
Community Q&A
If you are a serious Magic: the Gathering player, and are looking to play in tournaments, you should consider building a sideboard for your deck. A sideboard is a collection of 15 cards that you do not use in your first game, but will switch out with cards that are mainboard later, before the beginning of games 2 and 3.
Steps
1
Experiment with cards that compliment your deck, and that help you defeat certain other colors.
2
After you find certain cards that help out your deck, separate them out from the ones that are too color or type specific.
3
A sideboard is a collection of emergency cards. Make sure to throw in cards that will help you with multiple problems you may face with your opponent's deck.
4
Make sure your sideboard consists of 15 cards and no more. It can be less, but there is no reason it should be. More options is always better.
5
Also when making your sideboard, look at the average mana costs of your mainboard. Make sure the sideboard cards fit in.
6
When you use your sideboard, do not put in cards from it until your second game, so you know what type of deck your opponent is playing. They may do the same.
7
When you are actually side boarding cards in and out, make sure that you take out as many cards as you are putting in.
8
After your second game, if you are going to move on to game three, you may sideboard more cards.
9
After your games are over, make sure to take out the cards you sideboarded, and put back in the cards that were originally mainboard.


WSSL - WebSocket Server Library
by Goran "
CHUPCKO
" Lazić
Version:
https://github.com/chupcko/wssl
Examples:
echo
IPV4
IPV6
IPV4+SSL
IPV6+SSL
time
IPV4
IPV6
IPV4+SSL
IPV6+SSL
chat
IPV4
IPV6
IPV4+SSL
IPV6+SSL


Tweet
Have.Tips
Get weekly tips in your email that will improve your life.
Sign up now to receive next week's edition.
No spam. No bullshit!
Curated by
Karan Goel
.


- GeneralSettings - Class in com.dltastudio.services
-
Implemente general settings for WebApp
- GeneralSettings() - Constructor for class com.dltastudio.services.GeneralSettings
-
- GenericWS - Class in com.dltastudio
-
Abstract class for exposing REST WebService
- GenericWS() - Constructor for class com.dltastudio.GenericWS
-
- getAssetContent(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.AssetsWS
-
Download an Assert for Bot
Xcode 7.2 does not support this method
- getBot(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.BotsWS
-
Retrieve a given bot
- getBots(HttpHeaders, HttpServletResponse) - Method in class com.dltastudio.ws.BotsWS
-
Retrieve all bots
- getConnection() - Static method in class com.dltastudio.services.DatabaseInstance
-
Retrieve Database instance connection
- getContent() - Method in class com.dltastudio.services.RESTResponse
-
Return http response content as binary
- getContentString() - Method in class com.dltastudio.services.RESTResponse
-
Return Http response content as UTF-8 String
- getErrorMessage() - Method in exception com.dltastudio.exceptions.WSRestException
-
- getGeneralSettings() - Static method in class com.dltastudio.services.GeneralSettings
-
Retrieve GeneralSettings instance
- getHeaders() - Method in class com.dltastudio.services.RESTResponse
-
Return response http headers
- getHSQLDBServerPort() - Static method in class com.dltastudio.services.GeneralSettings
-
Return port number for HSQLDB
- getIntegration(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve a specific integration
- getIntegrationAssets(HttpHeaders, HttpServletResponse, String, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve Assets for an Integration
Based on undocumented API
- getIntegrationCommits(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve Commits for an Integration
NOT TESTED
- getIntegrationCoverage(HttpHeaders, HttpServletResponse, String, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieving Code Coverage for an Integration
NOT TESTED
- getIntegrationFiles(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve Files for an Integration
NOT WORKING WITH XCode 7.2
- getIntegrationIssues(HttpHeaders, HttpServletResponse, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve Issues for an Integration
NOT TESTED
- getIntegrationTests(HttpHeaders, HttpServletResponse, String, String) - Method in class com.dltastudio.ws.IntegrationsWS
-
Retrieve Tests for an Integration
NOT TESTED
- getList() - Method in class org.glassfish.jersey.httppatch.State
-
- getMessage() - Method in class org.glassfish.jersey.httppatch.State
-
- getStatusCode() - Method in exception com.dltastudio.exceptions.WSRestException
-
- getStatusCode() - Method in class com.dltastudio.services.RESTResponse
-
Return response status code
- getTitle() - Method in class org.glassfish.jersey.httppatch.State
-
- getToken(HttpHeaders, HttpServletResponse) - Method in class com.dltastudio.ws.TokenWS
-
Create and register a new token for givent username/password
- getXCodeBaseURL() - Static method in class com.dltastudio.services.GeneralSettings
-
Retrieve XCode Server base URL for API
- getXCodeInternalBaseURL() - Static method in class com.dltastudio.services.GeneralSettings
-
Retrieve XCode Server URL for internal API


Here is the URL of the link you clicked:
Is the congregation's ID the portion of that URL which is underlined below?


What to know during a romaine lettuce E. coli outbreak
SEATTLE, Nov. 23, 2019 /PRNewswire/ -- "When in doubt, throw it out," says William (Bill) Marler, managing partner at the Food Safety Law Firm, Marler Clark.
"It is past time for the leafy green industry to take the safety of greens, especially romaine lettuce, seriously. The FDA must require, and the industry must implement, better environmental controls and more rigorous testing of products. There have been too many outbreaks leaving hundreds of consumers with life-long complications," said Bill Marler.
"Over the last decades, and recently, I have represented the families of people who have died as a result of consuming a product deemed 'healthy.' I have also represented dozens of children who face a lifetime of complications – including kidney failure – due to eating leafy greens. This has to stop," added Marler.
What to know about the E. coli outbreak:
The FDA, CDC, state and Canadian health authorities are presently investigating an outbreak of illnesses caused by E. coli O157:H7 tainted romaine lettuce in the United States and Canada. Thus far at least 41 people have been sickened in the United States and Canada. This is in addition to 23 people sickened by E. coli O157:H7 tainted romaine lettuce in September. Both outbreaks involve romaine lettuce grown in Salinas California.
Epidemiologic, laboratory, and traceback evidence indicates that romaine lettuce from the Salinas, California growing region is a likely source of this outbreak.
Consumers should not eat romaine lettuce harvested from Salinas, California.
Additionally, consumers should not eat products identified in the recall announced by the USDA on November 21, 2019 related to Missa Bay, LLC, products and Ready Pac Bistro Chicken Raised Without Antibiotics Caesar Salad.
Restaurants and retailers should not serve or sell romaine harvested from Salinas, California. If you do not know the source of your romaine lettuce, and if you cannot obtain that information from your supplier, you should not serve, nor sell it.
Romaine lettuce may be voluntarily labeled with a harvest region. If this voluntary label indicates that the romaine lettuce was grown in "Salinas" (whether alone or with the name of another location) do not eat it. Throw it away or return it to the place of purchase. If romaine lettuce does not have information about harvest region or does not indicate that it has been grown indoors (i.e., hydroponically- and greenhouse-grown), throw it away or return it to the place of purchase. Consumers ordering salad containing romaine at a restaurant or at a salad bar should ask the staff whether the romaine came from Salinas. If it did, or they do not know, do not eat it.
What to know about the E. coli:
Shiga toxin–producing E. coli (STEC) cause approximately 100,000 illnesses, 3,000 hospitalizations, and 90 deaths annually in the United States. Most reported STEC infections in the United States are caused by E. coli O157:H7, with an estimated 73,000 cases occurring each year.
What to know about the E. coli complications:
Hemolytic Uremic Syndrome, or HUS, occurs in around 10 percent of hospitalized E. coli O157:H7 infections. HUS occurs when Shiga toxins get into the bloodstream and cause the part of the kidney that filters toxins out of the blood to break down, causing kidney injury and sometimes kidney failure. Some HUS patients also suffer damage to the pancreas and central nervous system impairment.
E. coli outbreaks associated with lettuce, specifically the "pre-washed" and "ready-to-eat" varieties, are by no means a new phenomenon. In fact, the frequency with which this country's fresh produce consuming public has been hit by outbreaks of pathogenic bacteria is astonishing. Here is just a sample of E. coli outbreaks based on information gathered by the Center for Science in the Public Interest, Kansas State University, and the Centers for Disease Control and Prevention (CDC ) – NOTE: It is very likely that there or dozens of other outbreaks that the CDC and FDA did not make public:
| Date | Vehicle | Etiology |
Confirmed Cases |
States/Provinces |
| July 1995 | Lettuce (leafy green; red; romaine) | E. coli O157:H7 | 74 | 1:MT |
| Sept. 1995 | Lettuce (romaine) | E. coli O157:H7 | 20 | 1:ID |
| Sept. 1995 | Lettuce (iceberg) | E. coli O157:H7 | 30 | 1:ME |
| Oct. 1995 | Lettuce (iceberg; unconfirmed) | E. coli O157:H7 | 11 | 1:OH |
| May-June 1996 | Lettuce (mesclun; red leaf) | E. coli O157:H7 | 61 | 3:CT, IL, NY |
| May 1998 | Salad | E. coli O157:H7 | 2 | 1:CA |
| Feb.-Mar. 1999 | Lettuce (iceberg) | E. coli O157:H7 | 72 | 1:NE |
| Oct. 1999 | Salad | E. coli O157:H7 | 92 | 3:OR, PA, OH |
| Oct. 2000 | Lettuce | E. coli O157:H7 | 6 | 1:IN |
| Nov. 2001 | Lettuce | E. coli O157:H7 | 20 | 1:TX |
| July-Aug. 2002 | Lettuce (romaine) | E. coli O157:H7 | 29 | 2:WA, ID |
| Nov. 2002 | Lettuce | E. coli O157:H7 | 13 | 1:Il |
| Dec. 2002 | Lettuce | E. coli O157:H7 | 3 | 1:MN |
| Oct. 2003-May 2004 | Lettuce (mixed salad) | E. coli O157:H7 | 57 | 1:CA |
| Apr. 2004 | Spinach | E. coli O157:H7 | 16 | 1:CA |
| Nov. 2004 | Lettuce | E. coli O157:H7 | 6 | 1:NJ |
| Sept. 2005 | Lettuce (romaine) | E. coli O157:H7 | 32 | 3:MN, WI, OR |
| Sept. 2006 | Spinach (baby) | E. coli O157:H7 and other serotypes | 205 | Multistate and Canada |
| Nov./Dec. 2006 | Lettuce | E. coli O157:H7 | 71 | 4:NY, NJ, PA, DE |
| Nov./Dec. 2006 | Lettuce | E. coli O157:H7 | 81 | 3:IA, MN, WI |
| July 2007 | Lettuce | E. coli O157:H7 | 26 | 1:AL |
| May 2008 | Romaine | E. coli O157:H7 | 9 | 1:WA |
| Oct. 2008 | Lettuce | E. coli O157:H7 | 59 | Multistate and Canada |
| Nov. 2008 | Lettuce | E. coli O157:H7 | 130 | Canada |
| Sept. 2009 | Lettuce: Romaine or Iceberg | E. coli O157:H7 | 29 | Multistate |
| Sept. 2009 | Lettuce | E. coli O157:H7 | 10 | Multistate |
| April 2010 | Romaine | E. coli O145 | 33 | 5:MI, NY, OH, PA, TN |
| Oct. 2011 | Romaine | E. coli O157:H7 | 60 | Multistate |
| April 2012 | Romaine | E. coli O157:H7 | 28 | 1:CA Canada |
| June 2012 | Romaine | E. coli O157:H7 | 52 | Multistate |
| Sept. 2012 | Romaine | E. coli O157:H7 | 9 | 1:PA |
| Oct. 2012 | Spinach and Spring Mix Blend | E. coli O157:H7 | 33 | Multistate |
| Apr. 2013 | Leafy Greens | E. coli O157:H7 | 14 | Multistate |
| Aug. 2013 | Leafy Greens | E. coli O157:H7 | 15 | 1:PA |
| Oct. 2013 | Ready-To-Eat Salads | E. coli O157:H7 | 33 | Multistate |
| Apr. 2014 | Romaine | E. coli O126 | 4 | 1:MN |
| Apr. 2015 | Leafy Greens | E. coli O145 | 7 | 3:MD, SC, VA |
| June 2016 | Mesclun Mix | E. coli O157:H7 | 11 | 3:IL, MI, WI |
| Nov. 2017 | Leafy Greens | E. coli O157:H7 | 67 | Multistate and Canada |
| Mar. 2018 | Romaine | E. coli O157:H7 | 219 | Multistate and Canada |
| Nov. 2018 | Romaine | E. coli O157:H7 | 91 | Multistate and Canada |
| Sept. 2019 | Romaine | E. coli O157:H7 | 23 | Multistate |
| Nov. 2018 | Romaine | E. coli O157:H7 | 41 | Multistate and Canada |
Marler Clark, The Food Safety Law Firm, is the nation's leading law firm representing victims of E. coli outbreaks and hemolytic uremic syndrome (HUS). The E. coli lawyers of Marler Clark have represented thousands of victims of E. coli and other foodborne illness infections and have recovered over $650 million for clients. Marler Clark is the only law firm in the nation with a practice focused exclusively on foodborne illness litigation. Our E. coli lawyers have litigated E. coli and HUS cases stemming from outbreaks traced to ground beef, raw milk, lettuce, spinach, sprouts, and other food products. The law firm has brought E. coli lawsuits against such companies as Jack in the Box, Dole, ConAgra, Cargill, and Jimmy John's. We have proudly represented such victims as Brianne Kiner, Stephanie Smith and Linda Rivera.
SOURCE Marler Clark, The Nation's Food Safety Law Firm


[gecode-users] Help: Howto combine sets and value constraints?
Holger Winnemoeller
holger.winnemoeller at gmail.com
Tue Dec 15 02:01:19 CET 2009
I am trying to create a solver that (as a toy explanation) can create sets
with
certain properties, such as:
1) The resulting set size is specified
2) The resulting set contains a certain number of items that belong to a
"special" group
3) The total "weight" of items is below a certain threshold
I can easily enough create constraints for 1) and 2), but I would love to
get
some help in how I integrate constraint 3) into the mix. Supposedly I would
create a set of variables for the weights and specify a constraint on the
sum of
these weights. But I have no idea about how to express in Gecode that I want
to
sum up the weights of exactly the ids that are in the currently selected
set.
My approach to doing 1)&2) is attached below. The question is: How do I
specify
that the total weight of selected items should be less than, say
"maxWeight".
(Note: This is not a homework problem :-) It's an abstraction of a set
selector
that I want to include in a user interface for suggesting available sets to
users)
Thanks for your time,
Holger.
========================< main.cpp >===========================
#include <gecode/set.hh>
#include <gecode/support.hh>
#include <gecode/kernel.hh>
#include <gecode/search.hh>
using namespace Gecode;
// Some data to play with
int numItems = 10; // total number of items in inventory
int numSpecialItems = 4; // number of items in inventory with
"special" attribute
int numRequestedSize = 6; // requested size of result set
int numRequestedSpecialSize = 2; // requested size of "special" items in
result set
float maxWeight = 1.8f; // requested maximum weight of all
items in result set (NOT IMPLEMENTED!)
int allItems[] = {0,1,2,3,4,5,6,7,8,9}; // 10 items (their id's)
float itemWeights[] = {0.1f, 0.5f, 0.2f, 0.2f, 0.6f, 0.8f, 1.0f, 0.3f, 0.7f,
0.6f}; // their associated weights
int specialItems[] = {2,5,8,9}; // a subset of items having the attribute
"special"
// Little helper function
bool isInSet(int id, int set[], int setSize)
{
for(int i=0; i<setSize; ++i)
if(id == set[i]) return true;
return false;
}
// A "Minimal" space definition for the problem
class MiniSpace: public Space
{
SetVarArray mSetStore;
public:
MiniSpace(){
// Create a SetVariable array (only need one element really, but
this allows me to define the domain in one step)
mSetStore = SetVarArray(*this, 1, IntSet::empty, 0, numItems);
SetVar resultSet = mSetStore[0]; // get the one variable that was
defined in the above line
// impose the constraint that we only want "numRequestedSize" items
in the result set
cardinality(*this, resultSet, numRequestedSize, numRequestedSize);
// now impose the fact that we want exactly
"numRequestedSpecialSize" items coming from the special set
// 1.) Create a new set domain that represents the "special" items
IntSet specialSet(specialItems, numSpecialItems);
// 2.) Create a set variable that we'll associate with that set
later on
SetVar specialSelected(*this);
// 3.) Set "specialSelected" to the intersection of whatever a
possible solution is, and
// the "specialSet". This ensures that we can talk about items
that are included
// in the solution, but also belong to the special set
rel(*this, resultSet, SOT_INTER, specialSet, SRT_EQ,
specialSelected);
// 4.) Now ensure that we only have "numRequestedSpecialSize" of
these overlapping items
cardinality(*this, specialSelected, numRequestedSpecialSize,
numRequestedSpecialSize);
// Given these constraints, branch
branch(*this, mSetStore, SET_VAR_NONE, SET_VAL_MIN_INC);
}
MiniSpace(bool share, MiniSpace& s) : Space(share, s)
{mSetStore.update(*this, share, s.mSetStore);}
virtual Space* copy(bool share) {return new MiniSpace(share, *this);}
void print() const
{
int countAsSpecial = 0;
for(SetVarGlbValues d(mSetStore[0]);d();++d)
{
int id = d.val();
if(isInSet(id, specialItems, numSpecialItems)) countAsSpecial++;
std::cout << id << " ";
} // for
std::cout << ". Nr. of specials: " << countAsSpecial;
}
};
int main(int argc, char* argv[])
{
// Run the problem
MiniSpace problem; // space instance
//Search::Options options
DFS<MiniSpace> solver (&problem);
int count=0;
while(true){
MiniSpace* solution = solver.next();
if(!solution) break;
std::cout << "Solution Nr." << count++ << std::endl;
solution->print();
std::cout << std::endl;
delete solution;
}
std::cout << "Done..." << std::endl;
return 0;
}
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20091214/4c6293a9/attachment-0001.htm>
More information about the users
mailing list


AP Top Business News at 7:07 a.m. EDT
by EndPlayASEAN meeting grapples with trade war, territorial disputes
US economy defies threats with a solid job gain for October
China's economy struggles as consumers tighten belts
Governor threatens possible PG&E takeover if no plan is made
Widespread glitches occur on 1st day of 'Obamacare' sign-ups
One big step: Google buys Fitbit for $2.1 billion
UK halts support for fracking due to earthquake fears
Retailers seek to stretch shortened holiday shopping season
Brexit Party wants to team up with Tories; Johnson says no
Trade body: China can hit US with sanctions worth $3.6 bln


PART III. PRIVATE WAYS AND WATER RIGHTS
Cross References
State water code, see chapter 174C.
Rules of Court
Applicability of Hawaii Rules of Civil Procedure, see HRCP rule 81(b)(12).
§664-31 Definitions. Wherever used in this part:
"Controversy" means the matter or question at issue before the court.
"Private individuals or persons" means either individuals, companies, or corporations, or any others except the State. [L 1886, c 69, §1; am L 1888, c 26, §1; am L 1907, c 56, §1; RL 1925, §2936; RL 1935, §3677; RL 1945, §10218; RL 1955, §234-30; HRS §664-31; am L 1972, c 90, §6(1)]
Case Notes
Cited: 9 H. 651, 652 (1895); 20 H. 658, 660 (1911); 21 H. 280, 282 (1912).


train
Locomotive
Navbar Link
menu
Search Train Schedules
Scroll down to add trains
Train Name
Destination
Frequency (min)
Next Arrival
Minutes Away
Didn't find your train?
Add trains below
Train Name
Destination
First Train Time (HH:mm - military time)
Frequency (min)
send
Submit


Statistical Measures of Circular Distributions:
With this program the statistical measures of circular
orientation data (i.e. strike lines fotolineations, flow
directions) are calculated. These data can either be pure directions without defined
magnitude ( strike lines ) or they can
have defined
lengths ( fotolineations). In the
menu
"Data" the choice between pure directions
and directions with lengths must be
made.
The menu "Range" differentiates between data without polarity (strike
lines)
and those with polarity ( flow directions).
The first type of data uses only the range 1..180°. The second one
needs the range 1..360°.
For manual data input the choice between 1..360°
and 1..400gon must be made in the menu
"Angle"-
The extensions for files of these data
types are:
*.STR no polarity, pure directions,
*.LST no polarity, directions with lengths,
*.AZI with polarity, pure directions,
*.LAZ with polarity, directions with lengths.


RTMPDUMP(1) RTMPDUMP(1) NAME rtmpdump - RTMP streaming media client SYNOPSIS rtmpdump -r url [-n hostname] [-c port] [-l protocol] [-S host:port] [-a app] [-t tcUrl] [-p pageUrl] [-s swfUrl] [-f flashVer] [-u auth] [-C conndata] [-y playpath] [-Y] [-v] [-d subscription] [-e] [-k skip] [-A start] [-B stop] [-b buffer] [-m timeout] [-T key] [-j JSON] [-w swfHash] [-x swfSize] [-W swfUrl] [-X swfAge] [-o output] [-#] [-q] [-V] [-z] rtmpdump -h DESCRIPTION rtmpdump is a tool for dumping media content streamed over RTMP. rtmpdump makes a connection to the specified RTMP server and plays the media specified by the given url. The url should be of the form rtmp[t][e]://hostname[:port][/app[/playpath]] Plain rtmp, as well as tunneled and encrypted sessions are supported. OPTIONS Network Parameters These options define how to connect to the media server. --rtmp -r url URL of the server and media content. --host -n hostname Overrides the hostname in the RTMP URL. --port -c port Overrides the port number in the RTMP URL. --protocol -l number Overrides the protocol in the RTMP URL. 0 = rtmp 1 = rtmpt 2 = rtmpe 3 = rtmpte 4 = rtmps 5 = rtmpts --socks -S host:port Use the specified SOCKS4 proxy. Connection Parameters These options define the content of the RTMP Connect request packet. If correct values are not provided, the media server will reject the connec‐ tion attempt. --app -a app Name of application to connect to on the RTMP server. Overrides the app in the RTMP URL. Sometimes the rtmpdump URL parser cannot determine the app name automatically, so it must be given explic‐ itly using this option. --tcUrl -t url URL of the target stream. Defaults to rtmp[e]://host[:port]/app/playpath. --pageUrl -p url URL of the web page in which the media was embedded. By default no value will be sent. --swfUrl -s url URL of the SWF player for the media. By default no value will be sent. --flashVer -f version Version of the Flash plugin used to run the SWF player. The default is "LNX 10,0,32,18". --auth -u string An authentication string to be appended to the Connect message. Using this option will append a Boolean TRUE and then the speci‐ fied string. This option is only used by some particular servers and is deprecated. The more general --conn option should be used instead. --conn -C type:data Append arbitrary AMF data to the Connect message. The type must be B for Boolean, N for number, S for string, O for object, or Z for null. For Booleans the data must be either 0 or 1 for FALSE or TRUE, respectively. Likewise for Objects the data must be 0 or 1 to end or begin an object, respectively. Data items in subobjects may be named, by prefixing the type with 'N' and specifying the name before the value, e.g. NB:myFlag:1. This option may be used multiple times to construct arbitrary AMF sequences. E.g. -C B:1 -C S:authMe -C O:1 -C NN:code:1.23 -C NS:flag:ok -C O:0 Session Parameters These options take effect after the Connect request has succeeded. --playpath -y path Overrides the playpath parsed from the RTMP URL. Sometimes the rtmpdump URL parser cannot determine the correct playpath automat‐ ically, so it must be given explicitly using this option. --playlist -Y Issue a set_playlist command before sending the play command. The playlist will just contain the current playpath. --live -v Specify that the media is a live stream. No resuming or seeking in live streams is possible. --subscribe -d stream Name of live stream to subscribe to. Defaults to playpath. --resume -e Resume an incomplete RTMP download. --skip -k num Skip num keyframes when looking for the last keyframe from which to resume. This may be useful if a regular attempt to resume fails. The default is 0. --start -A num Start at num seconds into the stream. Not valid for live streams. --stop -B num Stop at num seconds into the stream. --buffer -b num Set buffer time to num milliseconds. The default is 36000000. --timeout -m num Timeout the session after num seconds without receiving any data from the server. The default is 120. Security Parameters These options handle additional authentication requests from the server. --token -T key Key for SecureToken response, used if the server requires Secure‐ Token authentication. --jtv -j JSON JSON token used by legacy Justin.tv servers. Invokes Net‐ Stream.Authenticate.UsherToken --swfhash -w hexstring SHA256 hash of the decompressed SWF file. This option may be needed if the server uses SWF Verification, but see the --swfVfy option below. The hash is 32 bytes, and must be given in hexadeci‐ mal. The --swfsize option must always be used with this option. --swfsize -x num Size of the decompressed SWF file. This option may be needed if the server uses SWF Verification, but see the --swfVfy option below. The --swfhash option must always be used with this option. --swfVfy -W url URL of the SWF player for this media. This option replaces all three of the --swfUrl, --swfhash, and --swfsize options. When this option is used, the SWF player is retrieved from the specified URL and the hash and size are computed automatically. Also the infor‐ mation is cached in a .swfinfo file in the user's home directory, so that it doesn't need to be retrieved and recalculated every time rtmpdump is run. The .swfinfo file records the URL, the time it was fetched, the modification timestamp of the SWF file, its size, and its hash. By default, the cached info will be used for 30 days before re-checking. --swfAge -X days Specify how many days to use the cached SWF info before re-check‐ ing. Use 0 to always check the SWF URL. Note that if the check shows that the SWF file has the same modification timestamp as before, it will not be retrieved again. Miscellaneous --flv -o output Specify the output file name. If the name is - or is omitted, the stream is written to stdout. --hashes -# Display streaming progress with a hash mark for each 1% of progress, instead of a byte counter. --quiet -q Suppress all command output. --verbose -V Verbose command output. --debug -z Debug level output. Extremely verbose, including hex dumps of all packet data. --help -h Print a summary of command options. EXIT STATUS 0 Successful program execution. 1 Unrecoverable error. 2 Incomplete transfer, resuming may get further. ENVIRONMENT HOME The value of $HOME is used as the location for the .swfinfo file. FILES $HOME/.swfinfo Cache of SWF Verification information SEE ALSO rtmpgw(8) AUTHORS Andrej Stepanchuk, Howard Chu, The Flvstreamer Team <http://rtmpdump.mplayerhq.hu> RTMPDump v2.4 2011-07-20 RTMPDUMP(1)


added
added
added
added
tagged
added
set
added
set
removed
removed
removed
set
removed
set
removed
set
added
removed
as a parent of
as a child of
as a lens for
as a tag for
with
as a requirement for
as requiring
as a subject taught by
as a teacher of
as a parent of
as a child of
as a tag for
as no longer tagged with
as a requirement for
as no longer requiring
from the list of subjects taught by
as no longer a teacher of
as an answer for
to
for


http://nickburns2006.github.io/rxDataTable/
The rx-data-table
directive is designed to pretty much be a catch-all
solution for displaying data in a table format in a basic or extremely
complex style. It has some basic CSS styling included, but provides hooks
for you to attach conditional styles to each row or column.
bower install angular-rx-data-table
<link href="bower_components/angular-rx-data-table/dist/styles/rx-data-table.min.css" rel="stylesheet">
<script src="bower_components/angular-rx-data-table/dist/scripts/rx-data-table.min.js"></script>
var app = angular.module("app", ["rxDataTable"]);
Obviously this requires you to have an angularjs project to use this.
This project uses the angular-xeditable for it's inline editing capabilities.
...


---
layout: guide
permalink: login
category: JupyterHub
guide-title: Log in to JupyterHub
guide-desc: The steps below will walk you through logging in to JupyterHub
guide-image: jupyter_login_04.png
steps:
- step-hr: hr
- step-heading: 1. Go to JupyterHub
- step-instruction: In a web browser, navigate to https://jupyterhub.cusp.adrf.cloud and click the Sign in with CUSP ADRF button.
- step-image: jupyter_login_01.png
- step-hr: hr
- step-heading: 2. Sign In
- step-instruction: Sign in with your user credentials.
- step-image: jupyter_login_02.png
- step-hr: hr
- step-heading: 3. Start Server
- step-instruction: Click the green My Server button.
- step-image: jupyter_login_03.png
- step-hr: hr
- step-heading: 4. View your home folder
- step-instruction: You should now see the contents of your home folder.
- step-image: jupyter_login_04.png
---


Andy Stanley wrote a book about the “Most Important Question” and he states it like this “What is the wisest step you should take based on past experience, present circumstances, and future hopes?” These are the steps you can put in your planner. It describes who will do what by when. These are highly leveraged steps that will yield the greatest results. They are the 20% activities that will yield 80% of your results.
May God grant you the knowledge of His will in all wisdom and spiritual understanding that you may walk worthy of His noble calling and produce fruit that will stand the test of eternity as you make noble plans and carry out noble deeds.


Class DQuaternion
- java.lang.Object
-
- com.jme.scene.plugins.blender.math.DQuaternion
-
- All Implemented Interfaces:
com.jme.export.Savable
,java.io.Serializable
,java.lang.Cloneable
public final class DQuaternion extends java.lang.Object implements com.jme.export.Savable, java.lang.Cloneable, java.io.Serializable
DQuaternion
defines a single example of a more general class of hypercomplex numbers. DQuaternions extends a rotation in three dimensions to a rotation in four dimensions. This avoids "gimbal lock" and allows for smooth continuous rotation.DQuaternion
is defined by four double point numbers: {x y z w}. This class's only purpose is to give better accuracy in floating point operations during computations. This is made by copying the original Quaternion class from jme3 core and leaving only required methods and basic computation methods, so that the class is smaller and easier to maintain. Should any other methods be needed, they will be added.- Author:
- Mark Powell, Joshua Slack, Marcin Roguski (Kaelthas)
- See Also:
- Serialized Form
-
-
Field Summary
Fields Modifier and Type Field Description static DQuaternion
DIRECTION_Z
static DQuaternion
IDENTITY
Represents the identity quaternion rotation (0, 0, 0, 1).protected double
w
protected double
x
protected double
y
protected double
z
static DQuaternion
ZERO
-
Constructor Summary
Constructors Constructor Description DQuaternion()
Constructor instantiates a newDQuaternion
object initializing all values to zero, except w which is initialized to 1.DQuaternion(double x, double y, double z, double w)
Constructor instantiates a newDQuaternion
object from the given list of parameters.DQuaternion(com.jme.math.Quaternion q)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description DQuaternion
add(DQuaternion q)
add
adds the values of this quaternion to those of the parameter quaternion.DQuaternion
addLocal(DQuaternion q)
add
adds the values of this quaternion to those of the parameter quaternion.DQuaternion
clone()
boolean
equals(java.lang.Object o)
equals
determines if two quaternions are logically equal, that is, if the values of (x, y, z, w) are the same for both quaternions.DQuaternion
fromAngleAxis(double angle, Vector3d axis)
fromAngleAxis
sets this quaternion to the values specified by an angle and an axis of rotation.DQuaternion
fromAngleNormalAxis(double angle, Vector3d axis)
fromAngleNormalAxis
sets this quaternion to the values specified by an angle and a normalized axis of rotation.DQuaternion
fromRotationMatrix(double m00, double m01, double m02, double m10, double m11, double m12, double m20, double m21, double m22)
double
getW()
double
getX()
double
getY()
double
getZ()
int
hashCode()
hashCode
returns the hash code value as an integer and is supported for the benefit of hashing based collection classes such as Hashtable, HashMap, HashSet etc.void
loadIdentity()
Sets this DQuaternion to {0, 0, 0, 1}.DQuaternion
mult(DQuaternion q)
mult
multiplies this quaternion by a parameter quaternion.DQuaternion
mult(DQuaternion q, DQuaternion res)
mult
multiplies this quaternion by a parameter quaternion.Vector3d
mult(Vector3d v)
mult
multiplies this quaternion by a parameter vector.Vector3d
mult(Vector3d v, Vector3d store)
mult
multiplies this quaternion by a parameter vector.DQuaternion
multLocal(DQuaternion q)
Multiplies this DQuaternion by the supplied quaternion.double
norm()
norm
returns the norm of this quaternion.void
read(com.jme.export.JmeImporter e)
DQuaternion
set(double x, double y, double z, double w)
sets the data in aDQuaternion
object from the given list of parameters.DQuaternion
set(DQuaternion q)
Sets the data in thisDQuaternion
object to be equal to the passedDQuaternion
object.DQuaternion
subtract(DQuaternion q)
subtract
subtracts the values of the parameter quaternion from those of this quaternion.DQuaternion
subtractLocal(DQuaternion q)
subtract
subtracts the values of the parameter quaternion from those of this quaternion.com.jme.math.Quaternion
toQuaternion()
Matrix
toRotationMatrix(Matrix result)
toRotationMatrix
converts this quaternion to a rotational matrix.java.lang.String
toString()
toString
creates the string representation of thisDQuaternion
.void
write(com.jme.export.JmeExporter e)
-
-
-
Field Detail
-
IDENTITY
public static final DQuaternion IDENTITY
Represents the identity quaternion rotation (0, 0, 0, 1).
-
DIRECTION_Z
public static final DQuaternion DIRECTION_Z
-
ZERO
public static final DQuaternion ZERO
-
x
protected double x
-
y
protected double y
-
z
protected double z
-
w
protected double w
-
-
Constructor Detail
-
DQuaternion
public DQuaternion()
Constructor instantiates a newDQuaternion
object initializing all values to zero, except w which is initialized to 1.
-
DQuaternion
public DQuaternion(double x, double y, double z, double w)
Constructor instantiates a newDQuaternion
object from the given list of parameters.- Parameters:
x
- the x value of the quaternion.y
- the y value of the quaternion.z
- the z value of the quaternion.w
- the w value of the quaternion.
-
DQuaternion
public DQuaternion(com.jme.math.Quaternion q)
-
-
Method Detail
-
toQuaternion
public com.jme.math.Quaternion toQuaternion()
-
getX
public double getX()
-
getY
public double getY()
-
getZ
public double getZ()
-
getW
public double getW()
-
set
public DQuaternion set(double x, double y, double z, double w)
sets the data in aDQuaternion
object from the given list of parameters.- Parameters:
x
- the x value of the quaternion.y
- the y value of the quaternion.z
- the z value of the quaternion.w
- the w value of the quaternion.- Returns:
- this
-
set
public DQuaternion set(DQuaternion q)
Sets the data in thisDQuaternion
object to be equal to the passedDQuaternion
object. The values are copied producing a new object.- Parameters:
q
- The DQuaternion to copy values from.- Returns:
- this
-
loadIdentity
public void loadIdentity()
Sets this DQuaternion to {0, 0, 0, 1}. Same as calling set(0,0,0,1).
-
norm
public double norm()
norm
returns the norm of this quaternion. This is the dot product of this quaternion with itself.- Returns:
- the norm of the quaternion.
-
fromRotationMatrix
public DQuaternion fromRotationMatrix(double m00, double m01, double m02, double m10, double m11, double m12, double m20, double m21, double m22)
-
toRotationMatrix
public Matrix toRotationMatrix(Matrix result)
toRotationMatrix
converts this quaternion to a rotational matrix. The result is stored in result. 4th row and 4th column values are untouched. Note: the result is created from a normalized version of this quat.- Parameters:
result
- The Matrix4f to store the result in.- Returns:
- the rotation matrix representation of this quaternion.
-
fromAngleAxis
public DQuaternion fromAngleAxis(double angle, Vector3d axis)
fromAngleAxis
sets this quaternion to the values specified by an angle and an axis of rotation. This method creates an object, so use fromAngleNormalAxis if your axis is already normalized.- Parameters:
angle
- the angle to rotate (in radians).axis
- the axis of rotation.- Returns:
- this quaternion
-
fromAngleNormalAxis
public DQuaternion fromAngleNormalAxis(double angle, Vector3d axis)
fromAngleNormalAxis
sets this quaternion to the values specified by an angle and a normalized axis of rotation.- Parameters:
angle
- the angle to rotate (in radians).axis
- the axis of rotation (already normalized).
-
add
public DQuaternion add(DQuaternion q)
add
adds the values of this quaternion to those of the parameter quaternion. The result is returned as a new quaternion.- Parameters:
q
- the quaternion to add to this.- Returns:
- the new quaternion.
-
addLocal
public DQuaternion addLocal(DQuaternion q)
add
adds the values of this quaternion to those of the parameter quaternion. The result is stored in this DQuaternion.- Parameters:
q
- the quaternion to add to this.- Returns:
- This DQuaternion after addition.
-
subtract
public DQuaternion subtract(DQuaternion q)
subtract
subtracts the values of the parameter quaternion from those of this quaternion. The result is returned as a new quaternion.- Parameters:
q
- the quaternion to subtract from this.- Returns:
- the new quaternion.
-
subtractLocal
public DQuaternion subtractLocal(DQuaternion q)
subtract
subtracts the values of the parameter quaternion from those of this quaternion. The result is stored in this DQuaternion.- Parameters:
q
- the quaternion to subtract from this.- Returns:
- This DQuaternion after subtraction.
-
mult
public DQuaternion mult(DQuaternion q)
mult
multiplies this quaternion by a parameter quaternion. The result is returned as a new quaternion. It should be noted that quaternion multiplication is not commutative so q * p != p * q.- Parameters:
q
- the quaternion to multiply this quaternion by.- Returns:
- the new quaternion.
-
mult
public DQuaternion mult(DQuaternion q, DQuaternion res)
mult
multiplies this quaternion by a parameter quaternion. The result is returned as a new quaternion. It should be noted that quaternion multiplication is not commutative so q * p != p * q. It IS safe for q and res to be the same object. It IS NOT safe for this and res to be the same object.- Parameters:
q
- the quaternion to multiply this quaternion by.res
- the quaternion to store the result in.- Returns:
- the new quaternion.
-
mult
public Vector3d mult(Vector3d v)
mult
multiplies this quaternion by a parameter vector. The result is returned as a new vector.- Parameters:
v
- the vector to multiply this quaternion by.- Returns:
- the new vector.
-
multLocal
public DQuaternion multLocal(DQuaternion q)
Multiplies this DQuaternion by the supplied quaternion. The result is stored in this DQuaternion, which is also returned for chaining. Similar to this *= q.- Parameters:
q
- The DQuaternion to multiply this one by.- Returns:
- This DQuaternion, after multiplication.
-
mult
public Vector3d mult(Vector3d v, Vector3d store)
mult
multiplies this quaternion by a parameter vector. The result is returned as a new vector.- Parameters:
v
- the vector to multiply this quaternion by.store
- the vector to store the result in. It IS safe for v and store to be the same object.- Returns:
- the result vector.
-
toString
public java.lang.String toString()
toString
creates the string representation of thisDQuaternion
. The values of the quaternion are displaced (x, y, z, w), in the following manner:
(x, y, z, w)- Overrides:
toString
in classjava.lang.Object
- Returns:
- the string representation of this object.
- See Also:
Object.toString()
-
equals
public boolean equals(java.lang.Object o)
equals
determines if two quaternions are logically equal, that is, if the values of (x, y, z, w) are the same for both quaternions.- Overrides:
equals
in classjava.lang.Object
- Parameters:
o
- the object to compare for equality- Returns:
- true if they are equal, false otherwise.
-
hashCode
public int hashCode()
hashCode
returns the hash code value as an integer and is supported for the benefit of hashing based collection classes such as Hashtable, HashMap, HashSet etc.- Overrides:
hashCode
in classjava.lang.Object
- Returns:
- the hashcode for this instance of DQuaternion.
- See Also:
Object.hashCode()
-
write
public void write(com.jme.export.JmeExporter e) throws java.io.IOException
- Specified by:
write
in interfacecom.jme.export.Savable
- Throws:
java.io.IOException
-
read
public void read(com.jme.export.JmeImporter e) throws java.io.IOException
- Specified by:
read
in interfacecom.jme.export.Savable
- Throws:
java.io.IOException
-
clone
public DQuaternion clone()
- Overrides:
clone
in classjava.lang.Object
-
-


Villa backs Guardiola's Man City for Champions League glory
by OmnisportDavid Villa believes Pep Guardiola can lead Manchester City to Champions League success after hailing the Spanish manager.
Former Barcelona and Bayern Munich boss Guardiola lifted the trophy twice during his time at Camp Nou, most recently in 2011.
Guardiola failed to go all the way in three seasons with Bayern, however, and has fallen well short in his three full campaigns at the Etihad Stadium.
City were eliminated in the last-16 stage in 2017 and have failed to progress beyond the quarter-finals in the last two years, but Villa is convinced Guardiola can guide them to glory.
"For all the coaches and all the big clubs, it's normal to focus on the Champions League, because it's the best tournament you can play with a club," he told The Mirror.
"Pep is obviously one of the best coaches in the world and obviously the subject of his focus is to win all the trophies.
"Manchester City have never won this trophy, they've been behind in terms of it for many years, so it's normal they have a big obsession with this kind of trophy.
"It's the best tournament you can play as a soccer player, but it's difficult to win for everyone, not just one or two clubs.
"It's very difficult to win, and obviously you need to do a lot of work to win it."
Villa, part of the Barcelona side that won the Champions League under Guardiola eight years ago at Wembley, has not been surprised by his former coach's domestic success in England.
"He's a great coach," Villa said. "I was with him for two fantastic years at Barcelona and he helped me a lot.
"He will have success wherever he goes. He managed in Spain and was successful, the same in Germany, and now in England.
"So wherever he manages, he will be successful, because he's such an amazing coach."
City will be through to the knockout rounds of Europe's showpiece competition if they avoid defeat against Shakhtar Donetsk on Tuesday.
Key to their European hopes is the form of England international Raheem Sterling, who Villa labelled a unique type of player.
"He's amazing, a player with qualities that it's difficult to find in any other player," added Villa, who is retiring from football next month after a glittering and trophy-laden career with Barca, Atletico Madrid and Spain.
"He's fast, he's really good in one-on-ones, and this year he's scoring a lot of goals. He's improving year by year, which is the most important thing for a soccer player.
"When you're 18, 19, 20, and playing at the highest level, for teams like Liverpool and City, the most important thing is to get better every year.
"It's important to grow as a player and every year Sterling has done it. You see he's a better player day by day, year by year, and he's still very young."


Missourians compete with out-of-state marijuana businesses
ST. LOUIS (AP) - Some Missouri business owners looking to profit from the state’s burgeoning marijuana industry worry they’re at a disadvantage to established out-of-state organizations that have been aggressive in applying to process or sell medical marijuana in Missouri.
The St. Louis Post-Dispatch reports that nearly 700 groups have filed more than 2,000 marijuana business applications in the state. That comes after voters approved a measure last year to legalize marijuana for medicinal purposes in Missouri.
Missouri will issue only 60 licenses to grow marijuana, 86 to make marijuana-infused products and 192 to open dispensaries.
Simply applying is expensive: $6,000 for each dispensary or processing license and $10,000 per cultivation license. The most licenses any one business can win is 11.
At least 21 groups, most of them marijuana retailers from other states, have applied for 11 or more licenses.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


unexpected error
Connecting to a test call.
Hi! Thanks for testing our video calls before your Startup School group session.
Browser check: Chrome on a laptop or desktop.
Great, you're all set. (We strongly recommend using Chrome on a laptop or desktop for group calls.)
Hi! Thanks for testing our video calls before your Startup School group session.
Browser check: mobile device.
We strongly recommend using Chrome on a laptop or desktop for group calls.
You can continue with the test call, but please try to come back and test Chrome, and use Chrome on your computer for the group call, if you possibly can.
Hi! Thanks for testing our video calls before your Startup School group session.
Browser check: you are not using Chrome.
We strongly recommend using Chrome on a laptop or desktop for group calls.
You can continue with the test call, but please try to come back and test Chrome, and use Chrome on your computer for the group call, if you possibly can.
Hi! Thanks for testing our video calls before your Startup School group session.
Browser check: This is not a supported browser.
Please use Chrome on a laptop or desktop computer, if you can. If that's not possible, you can use Chrome on Android or Safari on iOS.
We can't access your camera and mic.
This is probably your browser blocking camera and mic access. Please follow the steps in this article to unblock.
We can't access your camera and mic.
This is probably your browser blocking camera and mic access. Please follow the steps in this article to unblock.
We can't access your camera and mic.
This is probably your browser blocking camera and mic access. Please try:
Here are more tips for solving issues with in-browser video calls.
We're having trouble connecting you to the test call.
Please try these troubleshooting tips.
Testing network bandwidth (this takes about 30 seconds).
Everything looks good!
You had plenty of bandwidth (upstream bandwidth averaged kbs and packet loss was percent.
If you want to do more testing, or host video calls, or use our video call APIs, you can sign up for a free account at Daily.co
Your network connection is too slow for a high-quality group video call.
Your upstream bandwidth averaged kbs and packet loss was percent.
If possible, please try to switch to a location with a better connection. If packet loss is high, try moving closer to your wifi router.
You can also try another network test here: network.callstats.io.


--- layout: post title: ">WS-AtomicTransaction?" date: 2007-02-15 20:26:00.000000000 +01:00 categories: - SOA - WS-* tags: [] status: publish type: post published: true meta: blogger_blog: andreasohlund.blogspot.com blogger_permalink: "/2007/02/ws-atomictransaction.html" author: login: andreas.ohlund email<EMAIL_ADDRESS>display_name: Andreas Öhlund first_name: Andreas last_name: "Öhlund" ---
>Services as we all know should be autonomous , loosely coupled etc. With that in mind I've always wondered where WS-AtomicTransaction would fit in the "SOA-Equation". Well, now I think I figured out how WS-A.T should be used. ( lets call it Andreas first law of SOA :)
"Any time WS-AtomicTransaction appears in your mind when working with SOA and Web Services this should act as a warning bell that your design is flawed and that you probably have too fine grained services. Go back to the drawing board!"
Services should be coarse grained and I think that the need for "Atomic Transactions" between them clearly violates the autonomous, loosely coupled part of SOA.
"Transactional" behaviour between services should instead be implemented using compensational logic, i.e. using business logic for handling error condition and "rollback" behaviour. And with help of [Put your favourite BPMS,ESB,Integration platform here] to keep atomic transactions against it's messagebox and there by enable some limited "rollback" functionallity, guaranteed delivery etc. This combined with compensational logic should be sufficient for your transactional needs.
Messaging patterns also have an impact on the use of transactions eg. if you use a pub/sub pattern between your services there would obviously be no need for any "Atomic Transactions"
Here's my recommendation for a default implementation of WS-AtomicTransaction:
throw new BadDesignedSOAException();
Further reading:
Udi Dahan has a great post that also touches this subject.


GAME OVER
YOUR SCORE IS:
0
ICON NINJA
Lives:
Score:
0
Slice the icons!
START GAME!
Time Remaining:
60
sec


--- layout: page title: Fogo Docs --- {% include JB/setup %}
This class handles a message thread. A message thread is a collection of messages that have been both sent and received
EON Storage form is:
{ type: mthread, id: group_id or sn, data: [ { type: MESSAGE_TEXT, sender: sn_t, #: callsign, data: data }, { type: MESSAGE_AUDIO, sender: sn_t, #: callsign, data: data }, { type: MESSAGE_TEXT, sender: sn_t, #: callsign, data: data }, { type: MESSAGE_AUDIO, sender: sn_t, #: callsign, data: data }, { type: MESSAGE_TEXT, sender: sn_t, #: callsign, data: data } ] } }
JSON Storage is:
{ "type": "mthread", "id": "group id or sn", "name": "group name or callsign", data: [ { "type": "text", "sender": "sn", "callsign": "callsign", "data": "text message" }, { "type": "audio", "sender": "sn", "callsign": "callsign", "data": "base64 encoded binary data" }, { "type": "text", "sender": "sn", "callsign": "callsign", "data": "text message" }, { "type": "audio", "sender": "sn", "callsign": "callsign", "data": "base64 encoded binary data" }, { "type": "text", "sender": "sn", "callsign": "callsign", "data": "text message" } ] } }
Definition at line 46 of file MessageThread.hpp.


Overloading occurs when two methods
have the exact same
name, but have a different parameter list
(signature) e.g. line 4 has one int parameter
variable, and line 6 has two int parameter variables.
When evaluating whether overloading occurs between methods, the method return type
is not relevant (i.e. neither method's return type is considered,
as part of the evaluation).


passing-nul
Lecture
Listen to the speakers from various countries about the messages of sharing and opening.
A joyful celebration believing in the value of openness and sharing, creating a positive change with people from over 80 countries is taking place in October, in Korea.
Listen to the speakers from various countries about the messages of sharing and opening.
Appreciate various creations applying Blockchain technology in various industries.
Have the time to share your thoughts and opinions with experts for each topic.
Try creating your own blockchain using our workshops and implement it in a beta network.
Get opportunities to network with GC affiliates around the world, also after the summit.
See the whole program
Programming Methodology and Languages Researcher
Computer Sciences - Algorithms : Randomized Algorithms
Computational Theory Scientist
Applied Mathematics - Dynamical Systems : Fractal Geometry
Applications Analyst
Computer Sciences - Computer Communications (networks) : Cloud Computing
Computer Systems Consultant
Systems Science - Systems Engineering : Systems Analysis
Systems Architect
Architecture And Design - User Experience Design
Computer Security Specialist
Systems Science - Control Theory : Control Systems


AUCHO
Home
Archives
About
AUCHO's Page
Tetris
俄罗斯方块
Snake
贪吃蛇
webApp
vue project
QingMo
类似打砖块？
画板
sketchPad
X
press 'W' 'A' 'S' 'D' to control that square or I mean snake.
Whatever, you'd better try to play this game with a keyboard
start
end
X
score:0
start
Keyboard was required. Classic 'W' 'A' 'S' 'D' control.
I made it quite long time ago, and there might be some bugs, I guess
X
email
github
QQ
download
send
©2019 |
浙ICP备19028401号


30 August 2002
Disease Outbreak Reported
The international team from the Global Outbreak Alert and Response Network assisting the Ministry of Health provided a preliminary report of their findings and recommendations to the Ministry of Health on 29 August.
Summary: An epidemic of influenza was attributed to influenza A/Panama/2007/99like (H3N2) viruses that impacted the populations of the highlands region of Fianarantsoa Province. This is the same strain that was associated with influenza epidemics worldwide during 2001-02. The most affected area of the province was Ikongo district. The observed increase in excess mortality compared to previous years appeared to be due to widespread transmission and not an especially virulent influenza strain. Most deaths occurred outside of health facilities and disproportionately affected young children. Seasonal epidemics of influenza that have been documented in Antananarivo most likely also affect the highlands region of Fianarantsoa Province each winter, resulting in morbidity and mortality.
Among the recommendations are: expanding the influenza sentinel surveillance system and implementing a standard case definition for influenza-like illness; improving case management and training for health care providers; and providing health education activities to inform the public about influenza and the need for those at high risk (young children,the elderly and those with chronic illness) to seek medical care if experiencing acute respiratory illness.


There is a apple and a pen, so what do you want from me ? Remember, no one can get two things from my side.


Top court upholds Latif Siddique’s bail in corruption case
by bdnews24.comThe top court has upheld the six-month bail granted by the High Court to former Jute Minister Abdul Latif Siddique in a corruption case started by the Anti-Corruption Commission.
On Sunday, a four-member Appellate Division bench headed by Chief Justice Syed Mahmud Hossain rebuffed the anti-graft agency's appeal against the High Court order.
Lawyers Monsurul Hoque Chowdhury and Shah Manzurul Haque represented Latif in court while Khurshid Alam Khan appeared on behalf of the ACC.
“The Appellate Division dismissed the appeal filed by the ACC considering Latif’s age and health. Therefore, the bail granted by the High Court is valid; there’s no legal barrier to his release,” Monsurul told bdnews24.com.
A High Court bench of Justice Obaidul Hassan and Justice AKM Zahirul Hoque granted six months’ bail to Latif Siddique on Nov 4.
The ACC moved the Chamber Court for a stay order against the HC order on Nov 7.
The Chamber Court forwarded the appeal to the regular bench fixing Nov 11 for the hearing date on Nov 11. It also ordered the authorities to ensure that Siddique was not released during that time.
On Nov 11, the top court heard the ACC's appeal and stayed the bail order before scheduling the verdict for Sunday.
Latif, a former MP from Tangail-4 seat, was in charge of the textiles and jute ministry in the Awami League’s 2009-13 term.
The former minister is accused of misusing his power and resorting to corruption while selling 2.38 acres of land controlled by the Bangladesh Jute Corporation in Adamdighi Upazila’s Dariapur to Jahanara Rashid, without floating a tender.
The market value of the land was Tk 6.4 million as per the government’s assessment but he sold it for Tk 2.3 million, the ACC alleged in the case.


Jaime Sandoval-2
Jackie Taylor (CA/USA)
Miguel Ramirez (CA/USA)
Gail Hyman (CA/USA)
E J Bohn (CA/USA)
Anastasia Telesetsky (CA/USA)
not held
not held
Bill Morris (CA/USA)
Tammy Jaegel (CA/USA)
not held as marathon
not held as marathon
Timothy Martin (CA/USA)
Lura Damiano (CA/USA)
Jaime Sandoval (CA/USA)
Ann Hennigh (CO/USA)
Doug Davis (CA/USA)
Sue Hoyt (CA/USA)
Dale Richard (CA/USA)
Helen Hull (CA/USA)
Craig Moore (CA/USA)
Wendy Hanle (USA)
Terry Nephew (CA/USA)
Sandra Kiddy (CA/USA)
Roberto Mendez (CA/USA)
Luanne Park (CA/USA)
Lon Kincannon-2
Carrie Spangler (USA)
Robbie Wright (CA/USA)
Christine Iwahashi (CA/USA)
Tim Smith (CA/USA)
Karen Angel (CA/USA)
Allen Just (CA/USA)
Marilyn Nichols (CA/USA)
Irv Ray (CA/USA)
Sandra Mike (CA/USA)
Ted Pawlak (CA/USA)
Nelly Wright (CA/BOL)
John Notch (CA/USA)
Pamela Bartko (CA/USA)
Kevin Jones (CA/USA)
Helen Eisenbud (CA/USA)
Most Wins
(1979-2002)
Men
2
Jaime Sandoval (CA/USA)
1992,2002
Women
No woman has won more than once.
Prize Money
(ADR qualified runners)
No prize money has been awarded at this race according to available information.
Race Time Bias
(sec/km)
Insufficient data to calculate the race time bias.
Competitive Level
(1990-date)
Insufficient data to calculate the competitive level.
Quality Performances
Men No men under 2:20 Women <2:50 1
Last Updated on 26 Sep 2007
Contributors: Klaas Loonstra (5 points)m Jack Leydig (2)


“Give a minnow an upvote and they’ll eat for a day. Give a minnow a resteem and they’ll eat forever.”
Ancient Steemit Proverb
Hello Minnows!
I recently hit 900 followers and broke into the top 150 authors on Steemit. It had a lot to do with @kaylinart and @fyrstikken resteeming one of my posts. I literally jumped 550 followers within the last three weeks. I’m going to keep mentioning them because of how grateful I am to have had their support. It means this project can be successful and help a lot of newbies!
it got me thinking…
What if I could help my followers like @kaylinart and @frystikken helped me!?! It’s pretty easy to do. All I have to do is resteem my followers! What if I could get them a reward too!?!
So, here are the rules
For every 100 upvotes I’ll resteem a follower’s post
To be able to get a resteem simply link your post (or a referral if you want) in the comments section. Make sure there are at least 3 days left on the post rewards because I’m not going to resteem until Thursday.
The first resteem is the post that gets the most upvotes.
The second resteem is the post I think is best based on a criteria of promoting Peace, Abundance, and Liberty.
Third and up are based on upvotes as well.
Getting upvoted by bots doesn’t count.
What counts as a minnow?
If you have less than 500 followers and less than 5,000SP at the time you post then you’re a minnow that’s eligible for the resteem and the reward!
Which reminds me- I’m officially adding a reward to this. Liquid post rewards go to the authors that win!
So, upvote with some power folks. The winners will like it!
What about the first time winners
The first ever winner @fraenk writes-
The first ever runner up @jdawg writes-
My suggestion: Don’t just leave it up to chance! Campaign for your post!
This account is getting large enough now that a resteem, an award, and an announcement about you can help you get the most followers you’ve picked up in a day and maybe the most SBD you’ve gotten in a day. Don’t just leave a comment in the box with a post. Give a quick summary, ask for a vote, and then write a post about the content and ask your followers in bulk through that post to support you and be sure to ask folks privately through chat to support you.
I hope I can help you out as much as some follower whales helped me.
Lastly, any artist that wants to make a badge for 1st, 2nd, and 3rd place will be loved, resteemed, and awarded a $50 SBD bounty. If multiple people end up submitting I’ll make a separate post, resteem, and award pool just for that. This offer valid through Thursday.
With love and gratitude
Aggroed
I’m announcing a witness campaign tomorrow. Please support me!
PS Don’t forget to upvote your own post. Every vote counts here (except autobots).
This page is synchronized from the post: ‘Minnow Support Project! Weekly Minnow Resteem. Liquid Post Rewards to contest winners!’


SChartAnimation Class Reference
| Inherits from | NSObject |
| Conforms to | NSCopying |
| Declared in | SChartAnimation.h |
| Availability | Standard Premium |
| Related samples |
Overview
An SChartAnimation
object determines how an SChartSeries
is animated.
Depending on the action which an animation is linked to, it may be triggered by different actions:
- Entry Animations are triggered upon the initial addition of the series to the chart and when a series is unhidden using its hidden property.
- Exit Animations are triggered when a series is hidden using its hidden property.
The code snippet below demonstrates how to set a series to fade in when entering and fade out when exiting. We set the duration of both animations to be 3 seconds:
SChartAnimation *animation = [ SChartAnimation fadeAnimation ];
animation.duration = @3;
series.entryAnimation = [ animation copy ];
series.exitAnimation = [ animation copy ];
We updated the animation code in version 2.2 of charts. As a result of these updates, the SChartAnimationCurve enum defined in earlier versions of charts has been deprecated. Instead of using this, you should configure the properties of the animation to meet your needs. The properties you can set on an animation are:
- The duration of the animation. See
duration
for more information. - The origin point on the chart from where the series animates to its final position. See
absoluteOriginX
,absoluteOriginY
,normalisedOriginX
andnormalisedOriginY
for more information. - How the chart series scales as the animation progresses. See
xScaleCurve
,yScaleCurve
orradiusCurve
for more information. - How the transparency of the series varies over the period of the animation. See
alphaCurve
for more information. - For pie/donut chart series, you can specify how the series rotates around the origin during the animation. See
angleCurve
for more information.
The SChartAnimation
object is composed of several objects conforming to the SChartAnimationCurve
protocol,
which each describe the transition of an aspect of the chart series from the start of the animation to the end. We have defined concrete implementations of this protocol to support common animation use cases which you might have. Some of the concrete animation curve classes are:
SChartLinearAnimationCurve
- a linear animation.SChartEaseInAnimationCurve
- animation which starts off gently, then accelerates in the second half of the animation.SChartEaseOutAnimationCurve
- animation which starts off at a steady speed, then decelerates in the second half of the animation, creating a slow exit phase.SChartEaseInOutAnimationCurve
- animation which starts off gently, accelerates through the middle part of the animation, then decelerates at the end to finish gently.SChartBounceAnimationCurve
- animation where the series goes past its final value, then bounces back to it at the end.
Other animation curves are also available, see the API documentation for more information.
To save you having to create animation classes from scratch, we’ve provided some pre-defined types for you. Have a look at the factory methods we’ve provided in the “Creating Animations” sections of this page.
Warning: This feature isn’t currently supported on radial charts.
More information about using SChartAnimation can be found in our tutorial ‘Animating ShinobiChart Series’.
Tasks
Creating Animations
-
+ growAnimation
Returns an animation where the series scales from its centre.
-
+ growHorizontalAnimation
Returns an animation where the series scales from its leftmost point.
-
+ growVerticalAnimation
Returns an animation where the series scales from its lowest point.
-
+ fadeAnimation
Returns an animation where the series fades.
-
+ televisionAnimation
Returns an animation where the series mimics the entrance/exit of the picture in an old television.
-
+ radialSelection
Returns an animation where the series rotates with a bounce and changes its protrusion with a bounce.
Configuration Animation Curves
-
curve
The overall animation curve for the animation.
property -
xScaleCurve
The animation curve describing the transition of the series parallel to the x axis.
property -
yScaleCurve
The animation curve describing the transition of the series parallel to the y axis.
property -
angleCurve
This curve only applies to pie/donut chart series. The animation curve describes the transition of the series around its origin.
property -
radiusCurve
The animation curve describing how the radius/radii of the series change during the animation.
property -
alphaCurve
The animation curve describing how the transparency of the series changes during the animation.
property
Configuration Animation Duration
-
duration
The duration of the animation.
property
Configuring the origin of the animation
-
absoluteOriginX
If this property is set, this will be the origin value in x in data terms - a curve returning 0 maps to this value, whereas a curve returning 1 maps to the final true value of the series.
property -
absoluteOriginY
If this property is set, this will be the origin value in y in data terms - a curve returning 0 maps to this value, whereas a curve returning 1 maps to the final true value.
property -
normalisedOriginX
This property enables you to set a normalized point of origin along the x axis for the animation.
property -
normalisedOriginY
This property enables you to set a normalized point of origin along the y axis for the animation.
property
Properties
absoluteOriginX
If this property is set, this will be the origin value in x in data terms - a curve returning 0 maps to this value, whereas a curve returning 1 maps to the final true value of the series.
@property (retain, nonatomic) id absoluteOriginX
Discussion
Points will scale from this value along the x axis in either direction.
If this property is not set, the animation will use a normalized origin on x - see normalisedOriginX
.
Declared In
SChartAnimation.h
absoluteOriginY
If this property is set, this will be the origin value in y in data terms - a curve returning 0 maps to this value, whereas a curve returning 1 maps to the final true value.
@property (retain, nonatomic) id absoluteOriginY
Discussion
Points will scale from this value along the y axis in either direction.
If this property is not set, the animation will use a normalized origin on y - see normalisedOriginY
.
Declared In
SChartAnimation.h
alphaCurve
@property (retain, nonatomic) id<SChartAnimationCurve> alphaCurve
Discussion
This curve describes how the alpha value of the colors of the series scale from some initial alpha value at the start of the animation to some destination alpha at the end of the animation. We multiply the value returned by this curve with the colors set to the series, therefore a curve value of 0 results in a completely transparent color and a value of 1 results in the final alpha value of the series color. This curve applies to both cartesian and pie/donut series.
Declared In
SChartAnimation.h
angleCurve
This curve only applies to pie/donut chart series. The animation curve describes the transition of the series around its origin.
@property (retain, nonatomic) id<SChartAnimationCurve> angleCurve
Discussion
This curve describes how the points of the series rotate around the centre of the series from some initial angle at the start of the animation to a destination angle at the end of the animation. An angle scale value of 0 maps to the original angle whereas a value of 1 maps to the destination angle.
Declared In
SChartAnimation.h
curve
The overall animation curve for the animation.
@property (retain, nonatomic) id<SChartAnimationCurve> curve
Discussion
Setting this curve will set each of the other curves for the animation to this same curve.
By default, this property is set to SChartFlatAnimationCurve
.
Declared In
SChartAnimation.h
duration
The duration of the animation.
@property (retain, nonatomic) NSNumber *duration
Discussion
The time taken, in seconds, for the animation to progress from start to finish. The duration of the animations returned by the factory methods provided is 2.4 seconds. The duration of an animation created via alloc/init is 1/64 seconds (instant). Use this property to configure how long an animation should take to complete.
Declared In
SChartAnimation.h
normalisedOriginX
This property enables you to set a normalized point of origin along the x axis for the animation.
@property (nonatomic) CGFloat normalisedOriginX
Discussion
This value is normalized using the range of the series which the animation is applied to.
For example, setting a normalisedOriginX
of 0.f
would cause the series to animate from its left-most point.
Setting a normalisedOriginX
of 1.f
would cause the series to animate from its right-most point.
By default, this property is set to 0.5f
. However, if a value is set for absoluteOriginX
, this property will be ignored.
Declared In
SChartAnimation.h
normalisedOriginY
This property enables you to set a normalized point of origin along the y axis for the animation.
@property (nonatomic) CGFloat normalisedOriginY
Discussion
This value is normalized using the range of the series which the animation is applied to.
For example, setting a normalisedOriginY
of 0.f
would cause the series to animate from its lowest point.
Setting a normalisedOriginY
of 1.f
would cause the series to animate from its highest point.
By default, this property is set to 0.5f
. However, if a value is set for absoluteOriginY
, this property will be ignored.
Declared In
SChartAnimation.h
radiusCurve
@property (retain, nonatomic) id<SChartAnimationCurve> radiusCurve
Discussion
This curve describes how both the x values and the y values of a series scale from some origin to their true values.
It is mostly used for pie/donut series, often in conjunction with an origin at the centre of the pie/donut series.
Setting this curve will override any previously set values for xScaleCurve
and yScaleCurve
.
Declared In
SChartAnimation.h
xScaleCurve
@property (retain, nonatomic) id<SChartAnimationCurve> xScaleCurve
Discussion
This curve describes how the x values of the series scale from some origin along the x axis at the start of the animation to their destination at the end of the animation. An xScale value of 0 maps a point at the animation origin whereas a value of 1 maps the point at it’s true value perpendicular to the x axis.
Declared In
SChartAnimation.h
yScaleCurve
@property (retain, nonatomic) id<SChartAnimationCurve> yScaleCurve
Discussion
This curve describes how the y values of the series scale from some origin along the y axis at the start of the animation to their destination at the end of the animation. An yScale value of 0 maps a point at the animation origin whereas a value of 1 maps the point at it’s true value perpendicular to the yAxis.
Declared In
SChartAnimation.h
Class Methods
fadeAnimation
Returns an animation where the series fades.
+ (SChartAnimation *)fadeAnimation
Discussion
By default, the normalized X and Y are both set to 0.5f
, and the animation duration is set to 2.4
seconds.
Declared In
SChartAnimation.h
growAnimation
Returns an animation where the series scales from its centre.
+ (SChartAnimation *)growAnimation
Discussion
This is the default entry & exit animation for SChartScatterSeries
, SChartDonutSeries
, and SChartPieSeries
.
By default, the normalized X and Y are both set to 0.5f
, and the animation duration is set to 2.4
seconds.
Declared In
SChartAnimation.h
growHorizontalAnimation
Returns an animation where the series scales from its leftmost point.
+ (SChartAnimation *)growHorizontalAnimation
Discussion
This is the default entry & exit animation for SChartBarSeries
.
By default, the normalized X is set to 0.f
, normalized Y is set to 0.5f
, and the animation duration is set to 2.4
seconds. If a baseline is set on a bar series, and a custom origin has not been set for the animation, the baseline will be used as the origin instead.
Declared In
SChartAnimation.h
growVerticalAnimation
Returns an animation where the series scales from its lowest point.
+ (SChartAnimation *)growVerticalAnimation
Discussion
This is the default entry & exit animation for SChartColumnSeries
, SChartOHLCSeries
, and SChartCandlestickSeries
.
By default, the normalized X is set to 0.5f
, normalized Y is set to 0.f
, and the animation duration is set to 2.4
seconds. If a baseline is set on a column, OHLC, or candlestick series, and a custom origin has not been set on the animation, the baseline will be used as the origin instead.
Declared In
SChartAnimation.h
radialSelection
Returns an animation where the series rotates with a bounce and changes its protrusion with a bounce.
+ (SChartAnimation *)radialSelection
Discussion
This is the default selection animation for SChartDonutSeries
and SChartPieSeries
.
By default, the normalized X and Y are both set to 0.5f
, and the animation duration is set to 2.4
seconds.
Declared In
SChartAnimation.h
televisionAnimation
Returns an animation where the series mimics the entrance/exit of the picture in an old television.
+ (SChartAnimation *)televisionAnimation
Discussion
This is the default entry & exit animation for SChartLineSeries
, SChartStepLineSeries
, and SChartBandSeries
.
By default, the normalized X and Y are both set to 0.5f
, and the animation duration is set to 2.4
seconds.
Declared In
SChartAnimation.h


#include <BL3_GbxAI_structs.hpp>
◆ AdjustDistanceDown
◆ AdjustDistanceForward
| float AdjustDistanceForward |
◆ AdjustDistanceUp
◆ bDoDownAdjustment
◆ bDoForwardAdjustment
| bool bDoForwardAdjustment |
◆ bDoUpAdjustment
◆ bEdgeTestLeft
◆ bEdgeTestRight
◆ BlockTestAngleThreshold
| int BlockTestAngleThreshold |
◆ BlockTestDistancePct
| float BlockTestDistancePct |
◆ BlockTestHitPct
◆ BlockTestHorizontalSections
| int BlockTestHorizontalSections |
◆ BlockTestVerticalSections
| int BlockTestVerticalSections |
◆ EdgeTestAngleThreshold
| int EdgeTestAngleThreshold |
◆ EdgeTestDistancePct
| float EdgeTestDistancePct |
◆ EdgeTestHeightPct
◆ EdgeTestSections
◆ EdgeTestWalkBackDistance
| float EdgeTestWalkBackDistance |
◆ UnknownData00
| unsigned char UnknownData00[0x3] |
◆ UnknownData01
| unsigned char UnknownData01[0x3] |
◆ UnknownData02
| unsigned char UnknownData02[0x1] |