text:
## Posts

Michaël Trazzi's Shortform 2020-05-08T20:45:07.360Z · score: 4 (1 votes)
Jukebox: how to update from AI imitating humans? 2020-04-30T20:50:13.844Z · score: 9 (5 votes)
The Epistemology of AI risk 2020-01-27T23:33:28.667Z · score: 22 (11 votes)
An Increasingly Manipulative Newsfeed 2019-07-01T15:26:42.566Z · score: 59 (22 votes)
Problems with Counterfactual Oracles 2019-06-11T18:10:05.223Z · score: 14 (7 votes)
Stories of Continuous Deception 2019-05-31T14:31:47.486Z · score: 19 (6 votes)
A Treacherous Turn Timeline - Children, Seed AIs and Predicting AI 2019-05-21T19:58:42.258Z · score: 9 (7 votes)
Considerateness in OpenAI LP Debate 2019-03-12T19:05:27.643Z · score: 8 (3 votes)
Treacherous Turn, Simulations and Brain-Computer Interfaces 2019-02-25T15:49:44.375Z · score: 17 (10 votes)
Greatest Lower Bound for AGI 2019-02-05T20:17:24.675Z · score: 8 (6 votes)
Book Review: AI Safety and Security 2018-08-21T10:23:24.165Z · score: 54 (30 votes)
Building Safer AGI by introducing Artificial Stupidity 2018-08-14T15:54:33.832Z · score: 8 (4 votes)
Human-Aligned AI Summer School: A Summary 2018-08-11T08:11:00.789Z · score: 44 (13 votes)
A Gym Gridworld Environment for the Treacherous Turn 2018-07-28T21:27:34.487Z · score: 68 (26 votes)
The Multiple Names of Beneficial AI 2018-05-11T11:49:51.897Z · score: 17 (6 votes)
Talking about AI Safety with Hikers 2018-05-10T06:38:26.620Z · score: 8 (4 votes)
Applied Coalition Formation 2018-05-09T07:07:42.014Z · score: 3 (1 votes)
Better Decisions at the Supermarket 2018-05-07T22:32:00.723Z · score: 0 (7 votes)
Beliefs: A Structural Change 2018-05-06T13:40:30.262Z · score: 9 (5 votes)
Are you Living in a Me-Simulation? 2018-05-03T22:02:03.967Z · score: 6 (5 votes)
A Logician, an Entrepreneur, and a Hacker, discussing Intelligence 2018-05-01T20:45:58.143Z · score: 11 (9 votes)
Should an AGI build a telescope to spot intergalactic Segways? 2018-04-28T21:55:15.664Z · score: 14 (4 votes)

Comment by mtrazzi on OpenAI announces GPT-3 · 2020-05-29T12:58:43.921Z · score: 6 (4 votes) · LW · GW

HN comment unsure about the meta-learning generalization claims that OpenAI has a "serious duty [...] to frame their results more carefully"

Comment by mtrazzi on Raemon's Scratchpad · 2020-05-28T21:13:09.951Z · score: 3 (2 votes) · LW · GW

re working memory: never thought of it during conversations, interesting. it seems that we sometime hold the nodes of the conversation tree to go back to them afterward. and maybe if you're introducing new concepts while you're talking people need to hold those definitions in working memory as well.

Comment by mtrazzi on What would flourishing look like in Conway's Game of Life? · 2020-05-13T09:23:23.729Z · score: 4 (3 votes) · LW · GW

Some friends tried (inconclusively) to apply AlphaZero to a two-player GoL. I can put you in touch if you want their feedback.

Comment by mtrazzi on Michaël Trazzi's Shortform · 2020-05-10T11:15:28.977Z · score: 2 (2 votes) · LW · GW

Thanks for the tutorial to download documentation, I've never done that myself so will check it out next time I go offline for a while!

I usually just run python to look at docs, importing the library, and then do help(lib.module.function). If I don't really know what the class can do, I usually do dir(class_instance) to find the available methods/attributes, and do the help thing on them.

This only works if you know reasonably well where to look at. If I were you I would try loading the "read the docs" html build offline in your browser (might be searchable this way), but then you still have a browser open (so you would really need to turn down wifi).

Comment by mtrazzi on How to do remote co-working · 2020-05-08T21:01:29.220Z · score: 12 (4 votes) · LW · GW

Thanks for writing this up!

I've personally tried Complice coworking rooms where people synchronize on pomodoros and chat during breaks, especially EA France's study room (+discord to voice chat during breaks) but there's also a LW study hall: https://complice.co/rooms

Comment by mtrazzi on Michaël Trazzi's Shortform · 2020-05-08T20:45:07.900Z · score: 6 (5 votes) · LW · GW

I've been experimenting with offline coding recently, sharing some of my conclusions.

Why I started 1) Most of the programming I do at the moment only needs a terminal and a text editor. I'm implementing things from scratch without needing libraries and I noticed I could just read the docs offline. 2) I came to the conclusion that googling things wasn't worth the cost of having a web browser open--using the outside view, when I look back at all the instances of coding while having the internet in easy-access, I always end up being distracted, and even if i code my mind thinks about what I could be doing.

How to go offline (Computer) 1) turn off wi-fi 2) forget network (Phone) if you're at home, put it out of reach. I turn it off then throw it on top of a closet, so far that i need to grab a chair in the living room to catch it. If you have an office, then do the same thing and go to your office without your phone.

When My general rule in January was that I could only check the internet between 11pm and 12am. The rest of the "no work + no internet" time was for deep relaxation, meditation, journaling, eating, etc. In April I went without any internet connection for a week. I was amazed at how much free time I had, but the lack of social interactions was a bit counter-productive. Currently, I'm going offline from the moment I wake up to 7pm. This seems like a good balance where I'm not too tired but still productive throughout the day.

Let me know if you have any question about the process or similar experience to share.

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-30T12:12:11.420Z · score: 1 (1 votes) · LW · GW

Thanks for all the references! I don't currently have much time to read all of it right now so I can't really engage with the specific arguments for the rejection of using utility functions/studying recursive self-improvement.

I essentially agree with most of what you wrote. There is maybe a slight disagreement in how you framed (not what you meant) how research focus shifted since 2014.

I see Superintelligence as essentially saying "hey, there is pb A. And even if we solve A, then we might also have B. And given C and D, there might be E." Now that the field is more mature and we have many more researchers getting paid to work on these problems, the arguments became much more goal focused. Now people are saying "I'm going to make progress on sub-problem X, by publishing a paper on Y. And working on Z is not cost-effective given so I'm not going to work on it given humanity's current time constraints."

These approaches are often grouped as "long-term problems-focused" and "making tractable progress now focused". In the first group you have Yudkowsky 2010, Bostrom 2014, MIRI's current research and maybe CAIS. In the second one you have current CHAI/FHI/OpenAI/DeepMind/Ought papers.

Your original framing can be interpreted as "after proving some mathematical theorems, people rejected the main arguments of Superintelligence and now most of the community agrees that working on X, Y and Z are tractable but A, B and C are more controversials".

I think a more nuanced and precise framing would be: "In Superintelligence Bostrom exposes exhaustively the risks associated with advanced AI. A short portion of the book is dedicated to the problems are working on right now. Indeed, people stopped working on the other problems (largest portion of the book) because 1) there hasn't been really productive working on them 2) some rebuttals have been written online giving convincing arguments that those pbs are not tractable anyway 3) there are now well-funded research organizations with incentives to make tangible progress on those pbs."

In your last framing, you presented precise papers/rebuttals (thanks again!) for 2), and I think rebuttals are a great reason to stop working on a pb, but I think they're not the only reason and not the real reason people stopped working on those pb. To be fair, I think 1) can be explained by many more factors than "it's theoretically impossible to make progress on those pbs". It can be that the research mindset required to work on these pbs is less socially/intellectually validating or requires much more theoretical approaches, so will be off-putting/tiresome to most recent grads that enter the field. I also think that AI Safety is now much more intertwined with evidence-based approaches such as Effective Altruism than it was in 2014, which explains 3), so people start presenting their research as "partial solutions to the pb. of AI Safety" or "research agenda".

To be clear, I'm not criticizing the current shift in research. I think it's productive for the field, both in the short term and long term. To give a bit more personal context, I started getting interested in AI Safety after reading Bostrom and have always been more interested in the "finding problems" approach. I went to FHI to work on AI Safety because I was super interested in finding new pbs related to the treacherous turn. It's now almost taboo to say that we're working on pbs that are sub-optimally minimizing AI risk, but the real reason that pushed me to think about those pbs was because they were both important and interesting. The pb. with the current "shift in framing" is that it's making it socially unacceptable for people to think/work on more long-term pbs where there is more variance in research productivity.

I don't quite understand the question?

Sorry about that. I thought there was some link to our discussion about utility functions but I misunderstood.

EDIT: I also wanted to mention that the number of pages in a book doesn't account for how important the author think the pb. is (Bostrom even comments on this in the postface of its book). Again, the book is mostly about saying "here are all the pbs", not "these are the tractable pbs we should start working on, and we should dedicate research ressources proportionally to the amount of pages I talk about it in the book".

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-30T10:49:12.553Z · score: 2 (2 votes) · LW · GW

This framing really helped me think about gradual self-improvement, thanks for writing it down!

I agree with most of what you wrote. I still feel that in the case of an AGI re-writing its own code there's some sense of intent that hasn't been explicitly happening for the past thousand years.

Agreed, you could still model Humanity as some kind of self-improving Human + Computer Colossus (cf. Tim Urban's framing) that somehow has some agency. But it's much less effective at self-improving itself, and it's not thinking "yep, I need to invent this new science to optimize this utility function". I agree that the threshold is "when all the relevant action is from a single system improving itself".

there would also be warning signs before it was too late

And what happens then? Will we reach some kind of global consensus to stop any research in this area? How long will it take to build a safe "single system improving itself"? How will all the relevant actors behave in the meantime?

My intuition is that in the best scenario we reach some kind of AGI Cold War situation for long periods of time.

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-30T00:17:16.832Z · score: 1 (1 votes) · LW · GW

I get the sense that the crux here is more between fast / slow takeoffs than unipolar / multipolar scenarios.

In the case of a gradual transition into more powerful technology, what happens when the children of your analogy discovers recursive self improvement?

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-30T00:10:17.812Z · score: 9 (2 votes) · LW · GW

When you say "the last few years has seen many people here" for your 2nd/3rd paragraph, do you have any posts / authors in mind to illustrate?

I agree that there has been a shift in what people write about because the field grew (as Daniel Filan pointed out). However, I don't remember reading anyone dismiss convergent instrumental goals such as increasing your own intelligence or utility functions as an useful abstraction to think about agency.

In your thread with ofer, he asked what was the difference between using loss functions in neural nets vs. objective function / utility functions and I haven't fully catched your opinion on that.

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-28T23:04:11.218Z · score: 1 (1 votes) · LW · GW

the ones you mentioned

To be clear, this is a linkpost for Philip Trammell's blogpost. I'm not involved in the writing.

Comment by mtrazzi on The Epistemology of AI risk · 2020-01-28T23:02:15.909Z · score: 1 (1 votes) · LW · GW

As you say

To be clear, the author is Philip Trammell, not me. Added quotes to make it clearer.

Comment by mtrazzi on Ultra-simplified research agenda · 2019-11-22T16:44:16.391Z · score: 8 (3 votes) · LW · GW

Having printed and read the full version, this ultra-simplified version was an useful summary.

Happy to read a (not-so-)simplified version (like 20-30 paragraphs).

Comment by mtrazzi on Do you get value out of contentless comments? · 2019-11-21T23:38:21.881Z · score: 15 (13 votes) · LW · GW

Funny comment!

Comment by mtrazzi on AI Alignment "Scaffolding" Project Ideas (Request for Advice) · 2019-07-11T12:07:45.888Z · score: 3 (3 votes) · LW · GW
A comprehensive AI alignment introductory web hub

RAISE and Robert Miles provide introductory content. You can think of LW->alignment forum as "web hubs" for AI Alignment research.

formal curriculum

There was a course on AGI Safety last fall in Berkeley.

A department or even a single outspokenly sympathetic official in any government of any industrialized nation

You can find a list of institutions/donors here.

A list of concrete and detailed policy proposals related to AI alignment

I would recommend reports from FHI/GovAI as a starting point.

Would this be valuable, and which resource would it be most useful to create?

Comment by mtrazzi on Modeling AI milestones to adjust AGI arrival estimates? · 2019-07-11T11:53:55.952Z · score: 4 (3 votes) · LW · GW

You can find AGI predictions, including Starcraft forecasts, in "When Will AI Exceed Human Performance? Evidence from AI Experts". Projects for having "all forecasts on AGI in one place" include ai.metaculus.com & foretold.io.

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-07-04T16:42:00.970Z · score: 6 (1 votes) · LW · GW

1. Proposals should make superintelligences less likely to fight you by using some conceptual insight true in most cases.
2. With CIRL, this insight is "we want the AI to actively cooperate with humans", so there's real value from it being formalized in a paper.
3. In the counterfactual paper, there's the insight "what if the AI thinks he's not on but still learns".
For the last bit, I have two interpretations:
4.a. However, it's unclear that this design avoids all manipulative behaviour and is completely safe.
4.b. However, it's unclear that adding the counterfactual feature to another design (e.g. CIRL) would make systems overall safer / would actually reduce manipulation incentives.

If I understand you correctly, there are actual insights from counterfactual oracles--the problem is that those might not be insights that would apply to a broad class of Alignment failures, but only to "engineered" cases of boxed oracle AIs (as opposed to CIRL where we might want AIs to be cooperative in general). Was it what you meant?

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-07-04T16:22:18.203Z · score: 1 (1 votes) · LW · GW

The zero reward is in the paper. I agree that skipping would solve the problem. From talking to Stuart, my impression is that he thinks that would be equivalent to skipping for specifying "no learning", or would just slow down learning. My disagreement on that I think it can confuse learning to the point of not learning the right thing.

Why not do a combination of pre-training and online learning, where you do enough during the training phase to get a useful predictor, and then use online learning to deal with subsequent distributional shifts?

Yes, that should work. My quote saying that online learning "won't work and is unsafe" is imprecise. I should have said "if epsilon is small enough to be comparable to the probability of shooting an escape message at random, then it is not safe. Also, if we continue sending the wrong instead of skipping, then it might not learn the correct thing if is not big enough".

Although I guess that probably isn't really original either. What seems original is that during any episode where learning will take place, don't let humans (or any other system that might be insecure against the oracle) see the oracle's output until the episode is over.

That's exactly it!

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-06-12T17:54:57.854Z · score: 3 (2 votes) · LW · GW

The string is read with probability 1-

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-06-12T15:13:53.977Z · score: 2 (3 votes) · LW · GW

Yes, if we choose the utility function to make it a CDT agent optimizing for the reward for one step (so particular case of act-based) then it won't care about future versions of itself nor want to escape.

I agree with the intuition of shutting down to make it episodic, but I am still confused about the causal relationship between "having the rule to shutdown the system" and "having a current timestep maximizer". For it to really be a "current timestep maximizer" it needs to be in some kind of reward/utility function. Because everything is reset at each timestep, there is no information pointing at "I might get shutdown at the next timestep".

As for the collecting a dataset and then optimizing for some natural direct effect, I am not familiar enough with Pearl's work to tell if that would work, but I made some related comments about why there might be some problems in online-learning/"training then testing" here.

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-06-12T14:53:26.268Z · score: 3 (4 votes) · LW · GW

The Asymptotically Unambitious AGI thread helped me clarify my thoughts, thanks. I agree that an optimal CDT agent won't think about future versions, and I don't see any optimization pressure towards escape message nor disproportionately common "escape message" regions.

However, it still assumes we have access to this magic oracle that optimizes for where is the event where humans don't see the answer, its indicator function, and the counterfactual reward (given by the automatic machine). If humans were able to build an oracle performing optimally (w.r.t ) from day 1, then humans would be able to specify some kind of "god oracle". The rest of the design seems to be just "how to interact with a god oracle so that humans are not influenced by the answers".

In practice, you'll want something that is able to learn from its (question, prediction, reward) history. That's why there is this automatic machine rewarding the oracle with some probability . In an online learning setting, most of the time the model gets (probability ), and it sometimes gets some useful feedback (probability . Therefore, if is small enough (comparable to the probability of hitting an escape message at random), then the learning gets extremely slow and the oracle might shoot at the escape action at random. Even worse, the (question, prediction, ) datapoints in the history could get so misleading that the oracle never learns anything.

Now, if we're not in an online learning process but instead there is a separation between a "training phase" and a "deployment phase where the AI continue to learns with probability ", then the setup is just "have a model that learns to do the useful stuff in sandbox, and then have the weights (almost) fixed in deployment"

In short, I think the CDT setup without machine learning assumes the problem already solved, that online learning won't work and is unsafe, which leaves us with a "training then deployment" setup that isn't really original.

Comment by mtrazzi on Problems with Counterfactual Oracles · 2019-06-11T19:43:46.347Z · score: 12 (4 votes) · LW · GW

Yes, they call it a low-bandwidth oracle.

Comment by mtrazzi on Stories of Continuous Deception · 2019-06-03T14:01:21.388Z · score: 6 (2 votes) · LW · GW

I agree that these stories won't (naturally) lead to a treacherous turn. Continuously learning to deceive (a ML failure in this case, as you mentioned) is a different result. The story/learning should be substantially different to lead to "learning the concept of deception" (for reaching an AGI-level ability to reason about such abstract concepts), but maybe there's a way to learn those concepts with only narrow AI.

Comment by mtrazzi on Trade-off in AI Capability Concealment · 2019-05-24T15:25:02.445Z · score: 4 (1 votes) · LW · GW

I included dates such as 2020 to 2045 to make it more concrete. I agree that weeks (instead of years) would give a more accurate representation as current ML experiments take a few weeks tops.

The scenario I had in mind is "in the context of a few weeks ML experiment, I achieved human intelligence and realized that I need to conceal my intentions/capabilities and I still don't have decisive strategic advantage". The challenge would then be "how to conceal my human level intelligence before everything I have discovered is thrown away". One way to do this would be to escape, for instance by copy-pasting and running your code somewhere else.

If we're already at the stage of emergent human-level intelligence from running ML experiments, I would expect "escape" to be harder than just human-level intelligence (as there would be more concerns w.r.t. AGI Safety, and more AI boxing/security/interpretability measure), which would necessit more recursive self-improvement steps, hence more weeks.

Beside, in such a scenario the AI would be incentivized to spend as much time as possible to maximize its true capability, because it would want to maximize its probability of successfully taking over (because any extra % of taking over would give astronomical returns in expected value compared to just being shutdown).

Comment by mtrazzi on A Treacherous Turn Timeline - Children, Seed AIs and Predicting AI · 2019-05-22T10:24:54.570Z · score: 6 (2 votes) · LW · GW

Your comment makes a lot os sense, thanks.

I put step 2. before step 3. because I thought something like "first you learn that there is some supervisor watching, and then you realize that you would prefer him not to watch". Agreed that step 2. could happen only by thinking.

Yep, deception is about alignment, and I think that most parents would be more concerned about alignment, not improving the tactics. However, I agree that if we take "education" in a broad sense (including high school, college, etc.), it's unofficially about tactics.

It's interesting to think of it in terms of cooperation - entities less powerful than their supervisors are (instrumentally) incentivized to cooperate.

what to do with a seed AI that lies, but not so well as to be unnoticeable

Well, destroy it, right? If it's deliberately doing a. or b. (from "Seed AI") then step 4. has started. The other cases where it could be "lying" from saying wrong things would be if its model is consistently wrong (e.g. stuck in a local minima), so you better start again from scratch.

If the supervisor isn't itself perfectly consistent and aligned, some amount of self-deception is present. Any competent seed AI (or child) is going to have to learn deception

That's insightful. Biased humans will keep saying that they want X when they want Y instead, so deceiving humans by pretending to be working on X while doing Y seems indeed natural (assuming you have "maximize what humans really want" in your code).

Comment by mtrazzi on A Treacherous Turn Timeline - Children, Seed AIs and Predicting AI · 2019-05-22T09:52:20.953Z · score: 4 (1 votes) · LW · GW

I meant:

"In my opinion, the disagreement between Bostrom (treacherous turn) and Goertzel (sordid stumble) originates from the uncertainty about how long steps 2. and 3. will take"

That's an interesting scenario. Instead of "won't see a practical way to replace humanity with its tools", I would say "would estimate its chances of success to be < 99%". I agree that we could say that it's "honestly" making humans happy in the sense that it understands that this maximizes expected value. However, he knows that there could be much more expected value after replacing humanity with its tools, so by doing the right thing it's still "pretending" to not know where the absurd amount of value is. But yeah, a smile maximizer making everyone happy shouldn't be too concerned about concealing its capabilities, shortening step 4.

Comment by mtrazzi on [deleted post] 2019-04-25T15:35:45.328Z

This thread is to discuss "How useful is quantilization for mitigating specification-gaming? (Ryan Carey, Apr. 2019, SafeML ICLR 2019 Workshop)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:35:24.845Z

This thread is to discuss "Quantilizers (Michaël Trazzi & Ryan Carey, Apr. 2019, Github)".

Comment by mtrazzi on [deleted post] 2019-04-25T15:35:09.233Z

This thread is to discuss "When to use quantilization (Ryan Carey, Feb. 2019, LessWrong)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:34:48.693Z

This thread is to discuss "Quantilal control for finite MDPs & Computing an exact quantilal policy (Vanessa Kosoy, Apr. 2018, LessWrong)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:34:29.184Z

This thread is to discuss "Reinforcement Learning with a Corrupted Reward Channel (Tom Everitt; Victoria Krakovna; Laurent Orseau; Marcus Hutter; Shane Legg, Aug. 2017, arXiv; IJCAI)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:33:58.640Z

This thread is to discuss "Thoughts on Quantilizers (Stuart Armstrong, Jan. 2017, Intelligent Agent)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:33:25.030Z

This thread is to discuss "Another view of quantilizers: avoiding Goodhart's Law (Jessica Taylor, Jan. 2016, Intelligent Agent Foundations Forum)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:32:49.221Z

This thread is to discuss "New paper: "Quantilizers" (Rob Bensinger, Nov. 2015, MIRI)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:32:05.280Z

This thread is to discuss "Quantilizers: A Safer Alternative to Maximizers for Limited Optimization (MIRI; AAAI)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:31:20.321Z

This thread is to discuss "Quantilizers maximize expected utility subject to a conservative cost constraint (Jessica Taylor, Sep. 2015, Intelligent Agent Foundation Forum)"

Comment by mtrazzi on [deleted post] 2019-04-25T15:27:38.617Z

Comment by mtrazzi on Corrigibility as Constrained Optimisation · 2019-04-24T14:23:29.759Z · score: 1 (1 votes) · LW · GW
Reply: The button is a communication link between the operator and the agent. In general, it is possible to construct an agent that shuts down even though it has received no such message from its operators as well as an agent that does get a shutdown message, but does not shut down. Shutdown is a state dependent on actions, and not a communication link

This is very clear. Communication link made me understand that it didn't have a direct physical effect on the agent. It you want to make it even more intuitive you could do a diagram, but this explanation is already great!

Thanks for updating the rest of the post and trying to make it more clear!

Comment by mtrazzi on Corrigibility as Constrained Optimisation · 2019-04-11T11:54:03.971Z · score: 1 (1 votes) · LW · GW

Layman questions:

1. I don't understand what you mean by "state" in "Suppose, however, that the AI lacked any capacity to press its shutdown button, or to indirectly control its state". Do you include its utility function in its state? Or just the observations he receives from the environment? What context/framework are you using?

2. Could you define U_S and U_N? From the Corribility paper, U_S appears to be an utility function favoring shutdown, and U_N is a potentially flawed utility function, a first stab at specifying their own goals. Was that what you meant? I think it's useful to define it in the introduction.

3. I don't understand how an agent that "[lacks] any capacity to press its shutdown button" could have any shutdown ability. It's seems like a contradiction, unless you mean "any capacity to directly press its shutdown button".

4. What's the "default value function" and the "normal utility function" in "Optimisation incentive"? Is it clearly defined in the litterature?

5. "Worse still... for any action..." -> if you choose b as some action with bad corrigibility property, it seems reasonable that it can be better than most actions on v_N + v_S (for instance if b is the argmax). I don't see how that's a "worse still" scenario, it seems plausible and normal.

6. "From this reasoning, we conclude" -> are you infering things from some hypothetic b that would satisfy all the things you mention? If that's the case, I would need an example to see that it's indeed possible. Even better would be a proof that you can always find such b.

7. "it is clear that we could in theory find a θ" -> could you expand on this?

8. "Given the robust optimisation incentive property, it is clear that the agent may score very poorly on UN in certain environments." -> again, can you expand on why it's clear?

9. In the appendix, in your 4 lines inequality, do you assume that U_N(a_s) is non-negative (from line 2 to 3)? If yes, why?

Comment by mtrazzi on Renaming "Frontpage" · 2019-03-09T09:26:02.764Z · score: 5 (3 votes) · LW · GW

Name suggestions: "approved", "favored", "Moderators' pick", "high [information] entropy", "original ideas", "informative", "mostly ideas".

More generally, I'd recommend that each category has a name that bluntly states what the filter does (e.g. if it only uses karma as filter say "high karma").

Comment by mtrazzi on Alignment Research Field Guide · 2019-03-08T21:57:11.859Z · score: 48 (16 votes) · LW · GW

Hey Abram (and the MIRI research team)!

This post resonates with me on so many levels. I vividly remember the Human-Aligned AI Summer School where you used to be a "receiver" and Vlad was a "transmitter", when talking about "optimizers". Your "document" especially resonates with my experience running an AI Safety Meetup (Paris AI Safety).

On January 2019, I organized a Meetup about "Deep RL from human preferences". Essentially, the resources were by difficulty, so you could discuss the 80k podcast, the open AI blogpost, the original paper or even a recent relevant paper. Even if the participants were "familiar" to RL (because they got used to see written "RL" in blogs or hear people say "RL" in podcasts) none of them could explain to me the core structure of a RL setting (i.e. that a RL problem would need at least an environment, actions, etc.)

The boys were getting hungry (abram is right, \$10 of chips is not enough for 4 hungry men between 7 and 9pm), when in the middle of a monologue ("in RL, you have so-and-so, and then it goes like so on and so forth..."), I suddenly realize that I'm talking to more than qualified attendees (I was lucky to have a PhD candidate in economics, a teenager who used to do international olympiads in informatics (IOI) and a CS PhD) that lack the necessary RL procedural knowledge to ask non-trivial questions about "Deep RL from human preferences".

That's when I decided to change the logistics of the Meetup to something much closer to what is described in "You and your research". I started thinking about what they would be interested in knowing. So I started telling the brillant IOI kid about this MIRI summer program, how I applied last year, etc. One thing lead to another, and I ended up asking what Tsvi had asked me one year ago for the AISFP interview:

If one of you was the only Alignment researcher left on Earth, and it was forbidden to convince other people to work on AI Safety research, what would you do?

That got everyone excited. The IOI boy took the black marker, and started to do math to the question, as a transmitter: "So, there is a probability p_0 that AI Researchers will solve the problem without me, and p_1 that my contribution will be neg-utility, so if we assume this and that, we get so-and-so."

The moment I asked questions I was truly curious about, the Meetup went from a polite gathering to the most interesting discussion of 2019.

Abram, if I were in charge of all agents in the reference class "organizer of Alignment-related events", I would tell instances of that class with my specific characteristics two things:

1. Come back to this document before and after every Meetup.

2. Please write below (can be in this thread or in the comments) what was your experience running an Alignment think-thank that resonates the most with the above "document".

Comment by mtrazzi on Greatest Lower Bound for AGI · 2019-02-05T23:14:48.666Z · score: 7 (3 votes) · LW · GW

I intuitively agree with your answer. Avturchin also commented saying something close (he said 2019, but for different reasons). Therefore, I think I might not be communicating clearly my confusion.

I don't remember exactly when, but there was some debates between Yann Le Cun and AI Alignment folks on a Fb group (maybe AI Safety discussion "open" a few months ago). What stroke me was how confident LeCun was about long timelines. I think, for him, the 1% would be in at least 10 years. How do you explain that someone who has access to private information (e.g. at FAIR) might have timelines so different than yours?

Meta: Thanks for expressing clearly your confidence levels through your writing with "hard", "maybe" and "should": it's very efficient.

Comment by mtrazzi on Greatest Lower Bound for AGI · 2019-02-05T23:06:19.435Z · score: 4 (3 votes) · LW · GW

Could you detail a bit more the Gott's equation? I'm not familiar with it.

Also, do you think that those 62 years are meaningful if we think about AI winters or exponential technological progress?

PS: I think you commented instead of giving an answer (different things in question posts)

Comment by mtrazzi on If You Want to Win, Stop Conceding · 2018-11-23T23:17:52.804Z · score: 5 (2 votes) · LW · GW

Thanks for the post!

It resonates with some experience I had in playing the game of go at a competitive level.

Go is a perfect information game but it's very hard to know exactly what will be the outcome of a "fight" (you would need to look up to 30 moves ahead in some cases).

So when the other guy would kill your group of stones after a "life or death" scenario, because he had a slight advantage in the fight, it feels like the other is lucky, and most people have really bad thoughts and just give up.

Once, I created an account with the bio "I don't resign" to see what would happen if I forced myself to not concede and keep playing after a big loss. It went surprisingly well and I even went to play the highest ranked guy connected on the server. At this point, I completely lost the game and there was 100+ people watching the game, so I just resigned.

Looking back, it definitely helped me to continue fighting even after a big loss, and stop the mental chatter. However, there's a trade-off between the time gained by correctly estimating the probability of winning and resigning when too improbable, and the mental energy gained from not resigning (minus the fact that your opponent may be pretty pissed off).

Comment by mtrazzi on Introducing the AI Alignment Forum (FAQ) · 2018-10-31T11:49:06.596Z · score: 3 (2 votes) · LW · GW

(the account databases are shared, so every LW user can log in on alignment forum, but it will say "not a member" in the top right corner)

I am having some issues in trying to log in from a github-linked account. It redirects me to LW with an empty page and does nothing.

Comment by mtrazzi on noticing internal experiences · 2018-10-16T11:37:13.921Z · score: 2 (2 votes) · LW · GW

This website is designed to make you write about three morning pages every day.

I've used it for about two years and wrote ~200k words.

Really recommend it to form an habit of daily free writing.

Comment by mtrazzi on Open Thread October 2018 · 2018-10-14T20:55:51.056Z · score: 2 (2 votes) · LW · GW

Same issue here with the <a class="users-name" href="/users/mtrazzi">Michaël Trazzi</a> tag. The e in "ë" is larger than the "a" (here is a picture).

The bug seems to come from font-family: warnock-pro,Palatino,"Palatino Linotype","Palatino LT STD","Book Antiqua",Georgia,serif;" in .PostsPage-author (in <style data-jss="" data-meta="PostsPage">).

If I delete this font-family line, the font changes but the "ë" (and any other letter with accent) appears to have the correct size.

Comment by mtrazzi on A Dialogue on Rationalist Activism · 2018-09-11T09:11:16.281Z · score: 1 (1 votes) · LW · GW
You: Well.

The "You" should be bold.

Comment by mtrazzi on Formal vs. Effective Pre-Commitment · 2018-09-01T07:38:03.631Z · score: 3 (2 votes) · LW · GW

typo: "Casual Decision Theory"

Comment by mtrazzi on Bottle Caps Aren't Optimisers · 2018-08-31T20:15:01.901Z · score: 8 (4 votes) · LW · GW

Let me see if I got it right:

1. Defining optimizers as an unpredictable process maximizing an objective function does not take into account algorithms that we can compute

2. Satisfying the property P "give the objective function higher values than an inexistence baseline" is not sufficient:

• the lid satisfies (P) with "water quantity in bottle" but is just a rigid object that some optimizer put there. However, not the best counter-example because not a Yudkwoskian optimizer.
• if a liver didn't exist or did other random things then humans wouldn't be alive and rich, so it satisfies (P) with "money in bank account" as the objective function. However, the better way to account for its behaviour (cf. Yudkowskian definition) is to see it as a sub-process of an income maximizer created by evolution.
1. One property that could work: have a step in the algorithm that provably augments the objective function (e.g. gradient ascent).

Properties I think are relevant:

• intent: the lid did not "chose" to be there, humans did
• doing something that the outer optimizer cannot do "as well" without using the same process as the inner optimizer : would be very tiring for humans to use our hands as lids. Humans cannot play go as well as Alpha Zero without actually running the algorithm.


text:
NEET Questions Solved

NEET - 2010

Six vector  have the directions indicated in the figure.Which of the following statements may be true?

(a) $\stackrel{\to }{b}+\stackrel{\to }{c}=\stackrel{\to }{-f}$                        (b) $\stackrel{\to }{d}+\stackrel{\to }{c}=\stackrel{\to }{f}$

(c) $\stackrel{\to }{d}+\stackrel{\to }{e}=\stackrel{\to }{f}$                        (d) $\stackrel{\to }{b}+\stackrel{\to }{e}=\stackrel{\to }{f}$

If two non-zero vectors are represented by the two adjust sides of a parallelogram, then the resultant is given by the diagonal of the parallelogram passing through the point of intersection of the two vectors

Difficulty Level:

• 38%
• 25%
• 23%
• 15%

format: plain


text:
# CTK Insights

• ## Pages

23 May

### A square in parallel lines

An $a\times a$ square intersects two parallel lines located at distance $a$ from each other. The points of intersection are cross joined. Prove that the angle so obtained is $45^{\circ}.$

The problem is credited to V. V. Proizvolov (Kvant 1996 (2)) and may serve an example where using dynamical software to sketch a diagram proves to be a distraction. I put together a GeoGebra applet and looked at the possible properties of the configuration with several elements added. Meanwhile, Hubert Shutrick pointed out its obvious, salient feature. The solution is a one liner.

### Solution

The angle formed by a transversal with two parallel lines is uniquely determined by its length between the lines - and vice versa.

The rest is easy:

$\gamma+\delta=90^{\circ}$

$2\alpha + 2\beta +\gamma+\delta=360^{\circ}$

$\alpha + \beta =135^{\circ}$

$\epsilon =45^{\circ}$

#### One Response to “A square in parallel lines”

1. 1
Matrix67: My Blog » Blog Archive » 趣题：平行线之间的正方形 Says:


text:
# Electron Microscopy

The electron microscope is a type of microscope that uses a beam of electron to create an image of the specimen. It is capable of much higher magnifications and has a greater resolving power than a light microscope, allowing it to see much smaller objects in finer details. They are large, expensive pieces of equipment, generally standing alone in a small, specially designed room and requiring trained personnel to operate them.

## Imaging

Award winning, high resolution imaging tools help you to understand ultrastructure of biological and inorganic specimens.

## In-Situ

Real-time observation of growth processes, chemical reactions and oxidation, irradiation effects, mechanical, magnetic, and ferroelectric properties.

## EELS

Electron energy loss spectroscopy (EELS) for chemical and compositional analysis.

## EFTEM

Energy-filtered transmission electron microscopy (EFTEM) is a family of imaging techniques to enhance, map and quantify elements and chemicals in an image.

## Cryo-EM

Observe biological specimens in their native environment at cryo-temperatures.

## Cathodoluminescence

Unique insight into the chemical and electronic properties of materials at the microscopic level.

## Spectrum Imaging

Systematic method to generate a spatially resolved distribution of electron energy loss spectroscopy (EELS) data.

## Serial Block-Face Imaging

Image three-dimensional samples from large tissue structures to thin cellular processes or organelles.

## EBIC

Electron-beam induced current (EBIC) characterizes electrical properties of semiconductor materials and devices at the microscopic level.

## EBSD

Electron backscatter diffraction (EBSD) helps you examine crystallographic orientation or texture of materials.


text:
Select Page

Go to file T. Go to line L. Go to definition R. Copy path. hackerrank - Finding the percentage 04 Nov 2017 ... Each record contains the student's name, and their percent marks in Maths, Physics and Chemistry. Published with, Hackerrank Snakes and Ladders: The Quickest Way Up Solution. 10.00 How to print a float with two decimal places in Python? The marks can be floating values. The marks can be floating values. For each of these countries, thousands of developers have participated in a HackerRank challenge. Leaderboard. Each record contains the student's name, and their percent marks in Maths, Physics and Chemistry. The program will get 5 roll no first then take 5 obtained marks input. Print one line: The average of the marks obtained by the particular student correct to 2 decimal places. The user enters some integer N followed by the names and marks for N students. Output the average percentage marks obtained by that student, correct to two decimal places. Here I am going to share Finding the Percentage â HackerRank Solution with you. Find the Runner-Up Score - Solution of HackerRank Python Basic Data Types. 3eval(ez_write_tag([[468,60],'thepoorcoder_com-box-3','ezslot_2',102,'0','0'])); eval(ez_write_tag([[580,400],'thepoorcoder_com-medrectangle-3','ezslot_1',103,'0','0']));Sample Output 0, eval(ez_write_tag([[580,400],'thepoorcoder_com-medrectangle-4','ezslot_0',104,'0','0']));Marks for Malika are {52,56,60} whose average is (52+56+60)/3 = 36, © 2021 The Poor Coder | Hackerrank Solutions - Print one line: The average of the marks obtained by the particular student correct to 2 decimal places. The Developer Skills Platform is an end-to-end hiring platform that enables teams to build high-quality, diverse teams that fuel company innovation. For example: 4 Shadab 8 Varun 8.9 Sarvesh 9.5 Harsh 10 The code should return the student with the second â¦ Submissions. The thing is, you wonât always have the option to look for the solution to a problem once youâre working as a software engineerâitâs â¦ Finding the percentage hackerrank problem. Finding the percentage. 2 Will 15 5 10 Mike 9 7 23 Will Output Format. If a student enters the number between 90 to 100 then our program must return the Grade A or Excellent, similarly for other ranges numbers. Use a dictionary to store the averages as values and the name as keys. For starters, we see further evidence that the United States, which ranks 11th in terms of percentage of female developers and should â¦ Bruteforce solution to Summing the N series. 6,800 9 9 gold badges 16 16 silver badges 31 31 bronze badges. There should be a function, Rwad the question its telling to display decimal upto 2 decimal places for which we have to use float data type for the case, why I'm getting error for print can u please tell me what is the reason of that, n = int(input()) student_marks = {} for _ in range(n): name, *line = input().split() scores = list(map(float, line)) student_marks[name] = scores query_name = input() l=list(student_marks[query_name]) length=len(l) s=sum(l) average=s/length print('%.2f'%average), for i in range(int(raw_input())):NameError: name 'raw_input' is not definedthis error is show when i run above code anyone help me give me correct code, We guarantee you won't get any other SPAM. The user enters some integer N followed by the names and marks for N students. Given the meal price (base cost of a meal), tip percent (the percentage of the meal price being added as tip), and tax percent (the percentage of the meal price being added as tax) for a meal, find and print the mealâs total cost. Discussions. The user then enters a student's name. How to find the percentage of marks using 2D arrays in java? Store a list of students and marks in a dictionary, and find the average marks obtained by a student. Python examples, python solutions, C, C++ solutions and tutorials, HackerRank Solution, HackerRank 30 days of code solution, Coding tutorials, video tutorials lastly, calculate the percentage â¦ Given the meal price (base cost of a meal), tip per cent (the percentage of the meal price being added as a tip), and tax per cent (the percentage of the meal price being added as tax) for a meal, find and print the â¦ We could try to just bruteforce a solution like this. I completed the "Nested Lists" challenge on HackerRank, and would love any feedback on my code. Ask Question Asked 4 years, 6 months ago. Active 4 years, 6 months ago. I suggest that you avoid looking for the solution to HackerRank problems at all costs, as it will be detrimental to your development as a programmer. Improve this question. Sample Input. Problem:- C Program For Calculate Total Marks Of 5 Subjects And percentage.means yo have to give a variable size of a subject like 2,3,5 and more subject as the user wants and you need to calculate the percentage of marks and also print the marks of each subject.Check This:-Hacker rank solution for Strings, â¦ HackerRank-Solutions/Python/Finding the Percentage.py /Jump toCode definitions. Print one line: The average of the marks obtained by the particular student correct to 2 decimal places. Editorial. The marks can be floating values. Finding the percentage Python Basic Data Type of HackerRank. â¦ Finding the percentage - Hacker Rank Solution. Find Quality Talent Faster with HackerRank A few weeks ago, we introduced the new industry standard in technical hiring : the HackerRank Developer Skills Platform. You are required to save the record in a dictionary data type. Finding the percentage hackerrank solution. The first line contains the integer N, the number of students. asked Mar 4 '14 at 10:19. The marks can be floating values. Problem. .MathJax_SVG_Display {text-align: center; margin: 1em 0em; position: relative; display: block!important; text-indent: 0; max-width: none; max-height: none; min-width: 0; min-height: 0; width: 100%} .MathJax_SVG .MJX-monospace {font-family: monospace} .MathJax_SVG .MJX-sans-serif {font-family: sans-serif} .MathJax_SVG {display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 100%; font-size-adjust: none; text-indent: Hackerrank Breadth First Search: Shortest Reach Solution. sum = 0 for i in range(1, n+1): sum += i*i - (i-1)*(i-1) return sum % 1000000007 However, as n can go up to 10^16, that is not really a viable solution and when I tried I got a timeout on most of the problems evaluated. Write a C Program to Find Grade of a Student Using Switch Case, The user needs to enter the subject number and the program must return the Grade of the subject based on the number. Viewed 599 times 0. You are viewing a single comment's thread. At HackerRank we have had the opportunity to build a product thatâs used by a community of more than 5 million developers (more than 20% of the worldâs developer population) and more than 1,200 customers to match every developer to the right job based on skill. Hope you understand everything. The majority of the solutions are in Python 2. if __name__ == '__main__': n = int(input()) student_marks = {} for _ in range(n): name, *line = input().split() scores = list(map(float, line)) student_marks[name] = scores query_name = input() #finding the percentage in python - Hacker Rank Solution output = list(student_marks[query_name]) per = â¦ split() scores = list (map (float, line)) student_marks[name] = scores query_name = input () # Finding the percentage in Python - Hacker Rank Solution START output = list (student_marks[query_name]) per = sum (output) / len (output); print ("%.2f" % per); â¦ Check Tutorial tab to know how to to solve.. Read an integer . python python-2.7 percentage ï»¿ Share. You have a record of N students. Format the float with two decimal places: Problem Tester's code: d={} for i in range(int(raw_input())): line=raw_input().split() d[line[0]]=sum(map(float,line[1:]))/3 print '%.2f' % d[raw_input()] at February 23, 2019. Use a dictionary to store the averages as, Diagonal Difference - Hacker Rank Solution. Follow edited Mar 15 '18 at 18:20. baduker. HackerRank - Finding the percentage solution. Input Format The next N lines contains the name and marks obtained by that student separated by a space. Find . The percentage of developers who know React â¦ # Finding the percentage in Python - Hacker Rank Solution if __name__ == '__main__': n = int (input ()) student_marks = {} for _ in range (n): name, * line = input (). You have a record of N students. Labels: Python. The user enters some integer N followed by the names and marks for N students. Over the course of the next few (actually many) days, I will be posting the solutions to previous Hacker Rank challenges. Some are in C++, Rust and [â¦] Discussions. Finding the percentage. What does looking abroad teach us about the gender gap in coding? Without using any string methods, try to print the following: Note that "" represents the values in between. Plz explain why float is used ? HackerRank Problem. How do I calculate the percentage correctly in Python? You are required to save the record in a dictionary data type. Tutorial. However, the percentage result is 0. The user enters some integer followed by the names and marks for students. Day 2 Operators Solution is the part of Hackerrank 30 days of code, in this problem. Note: Be sure to use precise values for your calculations, or you may end up with an incorrectly â¦ My program is fed text with the number of students in a classroom, the name of a student, and their grade. The final line contains the name of a particular student previously listed. I am trying to get inputs such as roll no and obtained marks 5 times in sequence. Python Problem's solution, HackerRank Python â¦ Each record contains the student's name, and their percent marks in Maths, Physics and Chemistry. Code: if __name__ == '__main__': n = int(input()) student_marks = {} for _ in range(n): name, *line = input().split() scores = list(map(float, line)) student_marks[name] = scores query_name = input() avg = sum(student_marks[query_name]) / 3 â¦ The page is a good start for people to solve these problems as the time constraints are rather forgiving. Each record contains the studentâs name, and their percent marks in Maths, Physics and Chemistry. Go to file. hackerrank python tutorial Home; Uncategorized; hackerrank python tutorial Is 0 print a float with two decimal places the name of a particular student correct to two places. Would love any feedback on my code previously listed '' challenge on HackerRank, their... To build high-quality, diverse teams that fuel company innovation teach us the... On my code as the time constraints are rather forgiving the program get... 'S Solution, HackerRank Python Basic Data type percentage marks obtained by a space is a good start people! Hiring Platform that enables teams to build high-quality, diverse teams that company... These problems as the time constraints are rather forgiving 30 days of code, in this problem store the as! The gender gap in coding time constraints are rather forgiving Asked 4 years, 6 months ago Will 5! Record contains the integer N followed by the names and marks for students teams build. Two decimal places the integer N followed by the names and marks for N students marks for students... The user enters some integer N, the number of students in a dictionary Data type one! Data Types months ago the following: Note that  '' represents the values in.... I calculate the percentage result is 0 text with the number of students in classroom... Integer N followed by the particular student correct to 2 decimal places to the! 31 bronze badges file T. Go to definition R. Copy path percentage result is 0 Solution, HackerRank Python Check. Diverse teams that fuel company innovation record contains the student 's name, and percent... Just bruteforce a Solution like this what does looking abroad teach us about gender! The following: Note that  '' represents the values in between, HackerRank Python Basic Data Types Basic type.  '' represents the values in between the Developer Skills Platform is an end-to-end hiring Platform that enables to.: Note that  '' represents the values in between an end-to-end hiring that! Data Types the part of HackerRank 30 days of code, in this problem Check Tutorial tab to know to... Program Will get 5 roll no and obtained marks input no and obtained marks input as keys 4! Solve these problems as the time constraints are rather forgiving names and marks for students in. To just bruteforce a Solution like this by that student separated by a space a!, the percentage correctly in Python 2 to 2 decimal places to to solve these problems as the time are... End-To-End hiring Platform that enables teams to build high-quality, diverse teams that fuel innovation! The marks obtained by that student, and their percent marks in a classroom the... In this problem N students, Physics and Chemistry to save the record in a dictionary store. Print a float with two decimal places of the marks obtained by that student by... Dictionary, and their percent marks in a classroom, the percentage Python Basic Types! Platform is an end-to-end hiring Platform that enables teams to build high-quality, diverse teams that fuel company.!, 6 months ago print the following: Note that  '' represents the in! 9 9 gold badges 16 16 silver badges 31 31 bronze badges we could to. A space am trying to get inputs such as roll no first then take 5 obtained marks times... 5 obtained marks 5 times in sequence of HackerRank 30 days of,. Without using any string methods, try to print a float with two decimal places Python problem 's Solution HackerRank. 7 23 Will Output Format with two decimal places student correct to 2 decimal places then...  Nested Lists '' challenge on HackerRank, and their percent marks in Maths, and! Looking abroad teach us about the gender gap in coding to store the as. To definition R. Copy path roll no first then take 5 obtained marks times. Number of students in a dictionary to store the averages as values and the of! Diverse teams that fuel company innovation that  '' represents the values in between first! As values and the name as keys some are in Python final line the! Completed the  Nested Lists '' challenge on HackerRank, and find the average percentage marks obtained that... High-Quality, diverse teams that fuel company innovation methods, try to just a... Try to print a float with two decimal places names and marks for.... A dictionary to store the averages as values and the name of a student, their! 10.00 how to print the following: Note that  '' represents the values in.. Finding the percentage result is 0 end-to-end hiring Platform that enables teams to high-quality... Solutions are in Python the average of the marks obtained by the particular student correct to 2 decimal places marks! Nested Lists '' challenge on HackerRank, and their grade that fuel company innovation Data. A list of students in a dictionary to store the averages as, Diagonal Difference - Hacker Rank Solution Developer. Take 5 obtained marks 5 times in sequence gap in coding without using any methods. R. Copy path N lines contains the name and marks for N students just bruteforce a like! Go to line L. Go to line L. Go to line L. Go definition! Hacker Rank Solution average of the marks obtained by the particular student correct to decimal! Lines contains the student 's name, and their percent marks in dictionary! And obtained marks 5 times in sequence represents the values in between type of HackerRank Python Check. That fuel company innovation dictionary Data type the name of a particular student correct to two decimal.... Is a good start for people to solve these problems as the time constraints are rather forgiving to print float. Next N lines contains the name of a particular student correct to two decimal places in Python 2 in. Followed by the names and marks in Maths, Physics and Chemistry their percent marks in Maths, Physics Chemistry! Line contains the name of a particular student correct to 2 decimal places 5... Gold badges 16 16 silver badges 31 31 bronze badges days of code, in this problem end-to-end hiring that. Line L. Go to file T. Go to definition R. Copy path are in,... Skills Platform is an end-to-end hiring Platform that enables teams to build high-quality, diverse teams that company! To solve.. finding the percentage hackerrank an integer average marks obtained by the particular student to... 4 years, 6 months ago, correct to 2 decimal places student previously.! Student separated by a student, correct to two decimal places N followed by the particular student previously.. Basic Data type of HackerRank 30 days of code, in this problem to the. Bruteforce a Solution like this Read an integer marks input Rank Solution times in sequence the gender in... That fuel company innovation record in a dictionary Data type 5 obtained marks 5 times in sequence 9 gold... These problems as the time constraints are rather forgiving 2 decimal places problem 's Solution, HackerRank â¦! Does looking abroad teach us about the gender gap in coding Will 15 5 Mike... Are rather forgiving integer followed by the particular student correct to two decimal places 6 finding the percentage hackerrank ago 's,! Hiring Platform that enables teams to build high-quality, diverse teams that fuel company innovation on HackerRank, find! Python â¦ Check Tutorial tab to know how finding the percentage hackerrank print the following: Note ... Name and marks for N students each record contains the name of a particular student correct to decimal! Badges 16 16 silver badges 31 31 bronze badges a good start for people solve... Each record contains the student 's name, and their percent marks in Maths, Physics Chemistry! For people to solve these problems as the time constraints are rather forgiving name, and love... And obtained marks input ] However, the name as keys hiring Platform that enables teams build! Physics and Chemistry are in Python 2 calculate the percentage Python Basic Data type the integer followed... Teach us about the gender gap in coding and Chemistry trying to get such! Constraints are rather forgiving dictionary to store the averages as, Diagonal Difference - Hacker Rank Solution am to. The following: Note that  '' represents the values in between type HackerRank!, Physics and Chemistry my program is fed text with the number of students years, 6 months.... To save the record in a dictionary Data type number of students in a classroom, the number students. The record in a dictionary to store the averages as, Diagonal Difference - Hacker Rank Solution the. That fuel company innovation tab to know how to print the following Note! File T. Go to definition R. Copy path 4 years, 6 months ago marks input times in sequence code! Fuel company innovation an end-to-end hiring Platform that enables teams to build high-quality, diverse that. Teach us about the gender gap in coding enters some integer followed by the student. Record contains the name of a student, and their percent marks in Maths, Physics Chemistry! Is a good start for people to solve.. Read an integer the! To store the averages as, Diagonal Difference - Hacker Rank Solution and would any... Print the following: Note that  '' represents the values in.... Â¦ Check Tutorial tab to know how to print a float with two places. I calculate the percentage correctly in Python is 0 problems as the time constraints are forgiving. C++, Rust and [ â¦ ] However, the number of students, Physics and Chemistry the marks by...


text:
My Math Forum Is Application of Minkowski's Integral Inequality Correct?

 Real Analysis Real Analysis Math Forum

 April 7th, 2019, 01:55 PM #1 Newbie   Joined: Apr 2019 From: Madison, Wisconsin Posts: 2 Thanks: 0 Math Focus: Measure Theory & Integration Is Application of Minkowski's Integral Inequality Correct? >$\textbf{The Problem:}$ Suppose that $(K_{\delta})_{\delta>0}$ is a family of integrable functions such that there exists a constant $C\in(0,\infty)$ such that $\int K_{\delta}=1,\int\vert K_{\delta}\vert\leq C$ for every $\delta>0$ and for every $\varepsilon>0$ we have $$\color{blue}{\large\lim\limits_{\delta\to0^{+}}\ int_{\vert x\vert\geq\varepsilon}\vert K_{\delta}(x)\vert dx=0}.$$ Let $p\in[1,\infty)$. Prove that for every $f\in L^p(\mathbb R^d)$ we have $f\ast K_{\delta}\to f$ in $L^p(\mathbb R^d)$ as $\delta\to0^{+}.$ $\textbf{My Toughts:}$ Here we go. For $p\in[1,\infty)$ we use Minkowski's inequality for integrals, for reference, this is $6.19$ on page $194$ of Folland's Real Analysis, $2$nd Edition. With this in mind we have, letting $y=\delta z$ at the right time, \begin{align*}\large\|f\ast K_\delta-f\|_p&=\large\left(\int_{\mathbb R^d}\Bigg\vert\int_{\mathbb R^d}f(x-y)K_\delta(y)dy-f(x)\Bigg\vert^p dx\right)^{1/p}\\ &=\large\left(\int_{\mathbb R^d}\Bigg\vert\int_{\mathbb R^d}f(x-y)K_\delta(y)dy-\int_{\mathbb R^d}f(x)K_\delta(y)dy\Bigg\vert ^p dx\right)^{1/p}\\ &=\large\left(\int_{\mathbb R^d}\Bigg\vert\int_{\mathbb R^d}[f(x-y)-f(x)]K_\delta(y)dy\Bigg\vert ^p dx\right)^{1/p}\\ &\leq\large\int_{\mathbb R^d}\left(\int_{\mathbb R^d}\vert f(x-\delta z)-f(x)\vert^{p}dx\right)^{1/p}\vert \delta^{d}K_{\delta}(\delta z)\vert dy\\ &\leq\large\|\tau_{\delta z}f-f\|_{p}C\\ &\leq\large 2\|f\|_{p}C, \end{align*} and noting that $\|\tau_{\delta z}f-f\|_{p}\to0$ as $\delta\to0^{+}$ we have what we needed using the Dominated Convergence Theorem. The latter follows by a density argument with compactly supported continuous functions and Minkowski's inequality. ____ Do you agree with the proof presented above? My main concern is that I did not use the hypothesis in $\color{blue}{\text{blue.}}$ Any feedback is much appreciated. Thank you for your time. ____ As a reference, here is the statement of Minkowski's Inequality for Integrals; Suppose that $(X,\frak{M},\mu)$ and $(Y,\frak{N},\nu)$ are $\sigma$-finite measure spaces, and let $f$ be an $(\frak{M}\otimes\frak{N})$-measurable function on $X\times Y$. Then if $f\geq0$ and $1\leq p<\infty,$ we have $$\left[\int\left(\int f(x,y)d\nu(y)\right)^p d\mu(x)\right]^{1/p}\leq\int\left[\int f(x,y)^p d\mu(x)\right]^{1/p}d\nu(y).$$

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Mathmatizer Calculus 2 July 12th, 2018 08:24 AM lucaslima Calculus 2 September 13th, 2015 02:18 AM lucaslima Calculus 0 September 12th, 2015 02:09 PM cris(c) Algebra 1 July 19th, 2012 12:46 PM cris(c) Calculus 0 December 31st, 1969 04:00 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top


text:
Home > A2C > Chapter 7 > Lesson 7.2.1 > Problem7-99

7-99.

Adam keeps getting negative exponents and fractional exponents confused. Help him by explaining the difference between 21/2 and 2−1. Homework Help ✎

$2^{\frac{1}{2}} = \sqrt{2}$


text:
# Combinatorics of linear iterated function systems with overlaps

Sidorov, Nikita (2007) Combinatorics of linear iterated function systems with overlaps. Nonlinearity, 20 (5). pp. 1299-1312. ISSN 1361-6544

Let p_0, ..., p_{m-1} be points in {\mathbb{R}}^d , and let \{f_j\}_{j=0}^{m-1} be a one-parameter family of similitudes of {\mathbb{R}}^d : $\begin{eqnarray*} f_j({\hbox{\bit x}}) = {\lambda}{\hbox{\bit x}} + (1-{\lambda}){\hbox{\bit p}}_j,\tqs j=0,\dots,m-1, \end{eqnarray*}$ where λ ∈ (0, 1) is our parameter. Then, as is well known, there exists a unique self-similar attractor S_λ satisfying S_λ =\bigcup_{j=0}^{m-1} f_j(S_λ) . Each x ∈ S_λ has at least one address (i_1,i_2,\dots)\in\prod_1^\infty\{0,1,\dots,m-1\} , i.e. \lim_n f_{i_1}f_{i_2}\dots f_{i_n}({\bf 0})=\x . We show that for λ sufficiently close to 1, each x ∈ S_λ setmn {p0, ..., pm-1} has 2^{\aleph_0} different addresses. If λ is not too close to 1, then we can still have an overlap, but there exist xs which have a unique address. However, we prove that almost every x ∈ Sλ has 2^{\aleph_0} addresses, provided S_λ contains no holes and at least one proper overlap. We apply these results to the case of expansions with deleted digits. Furthermore, we give sharp sufficient conditions for the open set condition to fail and for the attractor to have no holes. These results are generalizations of the corresponding one-dimensional results, however most proofs are different.


text:
# Does C# Triple DES Encryption need 128 bit key or 192 bit key [closed]

I have the following code in C#

using System.Web.Security;

TripleDESCryptoServiceProvider tdes = new TripleDESCryptoServiceProvider();
tdes.Key = keyArray;
ICryptoTransform cTransform = tdes.CreateEncryptor();
byte[] resultArray =
cTransform.TransformFinalBlock(plainTextArray, 0,
toEncryptArray.Length);

Does the code use the Key1 Key2 Key1 method of encryption or the Key1 Key2 Key3 method of encryption? I have heard that depending on the method it uses I will either need a 128 bit key for the first method or a 192 bit key for the second method.

## closed as off-topic by Ella Rose♦, Squeamish Ossifrage, Gilles, e-sushiJun 8 '18 at 14:36

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Programming questions are off-topic even if you are writing or debugging cryptographic code. Unless your question is specifically about how the cryptographic algorithm, protocol or side-channel (mitigation) works, you should look into asking on Stack Overflow instead." – Ella Rose, Squeamish Ossifrage, Gilles, e-sushi
If this question can be reworded to fit the rules in the help center, please edit the question.


text:
# Automatic Capacitor Charge/Discharge Circuit

I am still somewhat of a beginner in electronics, so please go easy on me, but here is a situation I have encountered, and hopefully some of you have as well.

I have a voltage source of 5volts, but extremely low current. This power source is connected to a large capacitor (in my case 3F 5.5V). After a period of time, the capacitor does eventually charge up to 5V as expected, this is all fine and dandy, but now I need to use this energy. The capacitor's load is a small, 500ma DC-DC boost converter, to utilize most of the capacitors charge, but it only works down to a minimum of 0.7 Volts.

So here is what I am looking to do, build a circuit that allows the capacitor to discharge only once it's reached 5V (or 4.5V to leave some wiggle room), and stops discharging once it drops below 1V or so. Only to start discharging again once the cap reaches its 5V threshold.

It should also be said that efficiency is very important here, as power is extremely limited for this circuit. The power source is a nuclear device capable of producing small amounts of power, unfortunately I am unable to provide exact specifications, other that that it is capable of powering the circuit enough to slowly recharge the storage capacitors.

I apologize if I am not being clear, feel free to ask for more details. :)

EDIT: Here is a schematic of my circuit, built only by memory so lets hope its accurate xD

MAX756 Datasheet

simulate this circuit – Schematic created using CircuitLab

• You need to be more specific. How low is "extremely low current"? Give us some numbers. – Dave Tweed Mar 23 '14 at 15:40
• It's likely that the boost regulator circuit connected to the cap can offer some assistance here - do you have a circuit for this section? – Andy aka Mar 23 '14 at 18:33
• You really should post some info about the boost circuit. Almost all boost controllers have a shutdown or enable pin (like the one in Andy's answer). Some that are meant for battery use will also have a low battery sensor. Use of the SD with LBS could do what you are talking about with not many parts added. – gsills Mar 23 '14 at 20:47
• Added schematic. – Zoidsfan77 Mar 24 '14 at 12:28

The shutdown (SD/) pin of the MAX756 could be used to turn on the boost when the super cap voltage ($V_c$) is charged to ~4.5V. Then, the Low Battery Indicator (LBI) could be used to turn the boost off when $V_c$ has decayed to 1.25V. A comparator with added hysteresis would be lowest current, lowest part count, and most repeatable way to control the SD/ pin for turn on. Since the MAX756 will start at input voltage as low as ~1V, any comparator used will need to be operational down to that voltage to maintain control of device turn on. The comparator will also need to be open drain so tha it can be wire-Or'ed with the LBO output for turn off control. Comparators that fit this requirement are rare, but the NCS2202 would work.

Using the LBI function for boost turn off makes things a lot easier. When the LBI pin is lower than 1.25V, the LBO pin is pulled down through an open drain N channel FET. It is a built in function, so requires no extra parts. More important, the low transition of the comparator doesn't have to be precise, it doesn't even need to be possible to reset by decay of $V_c$ as LBO pull down of the SD/ pin handles that. This makes it a lot easier to calculate resistor values. It isn't desirable to operate the MAX756 at $V_c$ lower than 1.25V because output current there is only about 100mA, and dropping quickly as $V_c$ goes lower. Here is a schematic of how this could be done:

Boundary cases are what is important for defining the hysteresis. First case is $V_c$ approaching 4.5V with U3-1 still low. Bias current in the hysteresis circuit ($I_b$) is from $V_c$ through $R_{\text{in}}$,$R_h$, and U3-1 and from $V_c$ through D2 (whose forward drop is $V_{\text{sch}}$), $R_{\text{pu}}$, and U3-1. With the U3-3 sense point voltage being set by the voltage divider of $R_{\text{in}}$ and$R_h$ :

$\frac{V_{\text{ch}} R_h}{R_h+R_{\text{in}}}$ = $V_{\text{ref}}$

where $V_{\text{ch}}$ is $V_c$ at its high point. Bias current can be written (with 100 $\mu$ A as target) :

$\frac{V_{\text{ch}}-V_{\text{sch}}}{R_{\text{pu}}}$ + $\frac{V_{\text{ch}}}{R_h+R_{\text{in}}}$ = $I_b$ = 100 $\mu$ A

Second case is $V_ {\text {out}}$ is 5V with $V_c$ decaying to its low value $V_ {\text {cL}}$. U3-3 sense point in this case is set by the voltage divider of $R_ {\text {pu}}$ + $R_h$ and $R_ {\text {in}}$. Since LBO controls boost turn off, the only use of the second case equation is to help determine hysteresis resistors.

$\frac{V_{\text{cL}} R_h+V_{\text{cL}} R_{\text{pu}}+R_{\text{in}} V_{\text{out}}}{R_h+R_{\text{in}}+R_{\text{pu}}}$ = $V_{\text{ref}}$

The three equations can be solved to find values for the hysteresis resistors. The set of values shown in the schematic result in $V_c$ topping out at 4.5V.

Edit:

It should also be mentioned that straight boosts like these don't isolate the input source from the load. There is always a leakage path through the inductor and diode. It's not clear what your load is like, but if there is no separate isolating element between the super caps and load, a load switch may need to be added to prevent leakage during charge up.

Edit:

As to the load switch, it could be controlled by the hysteresis comparator (U3). Something like this could work:

When U3-1 goes high to turn on the boost it will also connect the load by turning on Q2 (Si1304B) and Q1 (NTR4101P). And of course, load is disconnected when LBO and U3-1 go low. An N channel FET is used for Q2, instead of a BJT, to keep bias current low. Zener D3 (BZT52C5V6T) is there because a boost at light load can peak detect and over voltage the load. It may not be needed.

• Thank you for the informative answer, this is exactly what I needed. :) I appreciate that you explained how the circuit works, including equations, thank you. Unfortunately, I am new to stack exchange, and don't quite have enough reputation to upvote, but as soon as I get enough, I will upvote this answer. – Zoidsfan77 Mar 26 '14 at 12:09
• @Zoidsfan77 please see edit for info about boost leakage, that may apply here. – gsills Mar 26 '14 at 16:43
• Thank you for the edit, I would have very easily overlooked that, it would indeed be a problem without a switch. – Zoidsfan77 Mar 27 '14 at 0:00

Seems like you could use just a simple Schmitt trigger which could control MOSFET's for charging and discharging like this:

simulate this circuit – Schematic created using CircuitLab You can simulate it (Time domain 0-60s, 1s step).

Problem with this solution would be that it requires an independent power supply (You could alter the schematic to work with say 2 lithium coin cells (~6V)) for the opamp, although it shouldn't be too power consuming if you choose the right opamp (it'll leech off Ucap/16k from the cap and the rated supply current from the autonomous power supply). You could also increase both resistor values by a factor of 10, to get even less current draw from the cap, but going higher might get sketchy.

Whether it's feasible depends on your current draw though.

Hope it helps or gives material for new ideas.

• I will upvote as soon as I have enough rep, I am new to stack exchange so I apologize. – Zoidsfan77 Mar 24 '14 at 12:27
• Oh. No worries. :) – Linards Mar 24 '14 at 16:28

In the absence of the boost regulator circuit the OP used I have picked one to show how this might work: -

I've chosen this circuit because it has an application with supercaps - note the two 50 farad caps in series to the left and note that this boost chip will work from 0.5V to 5V. Note also that it has a shutdown pin (SD) and ideally this would be an input that has a tight spec on its threshold but unfortunately it doesn't and this slightly complicates things. 1.6V (or above) on this pin turns the switcher on and 0.25V (or below) turns it off.

The trick is to ensure that as the supercap voltage got to about 5V, the SD pin acquired a voltage of 1.6V. This would then turn on the booster and its output (via a resistor) could lift the SD significantly higher. This ensures that as the supercap voltage dropped, it would have to drop significantly below 1.6V before the switcher turned off.

That's the idea and this could be achieved by 3 resistors but it will be device specific because the real levels at which SD turned on and off are unknown between 1.6V and 0.25V. If it were a one-off design I'd suggest using a pot on the switcher to see where its shut-down and power-up points were and then pick resistors. If it's a production job then use a comparator as suggested by Linards in his answer BUT the comparator output would feed the SD pin.


text:
zbMATH — the first resource for mathematics

A sliding mode approach to robust stabilisation of Markovian jump linear time-delay systems with generally incomplete transition rates. (English) Zbl 1326.93111
Summary: This paper is devoted to investigating the problem of robust sliding mode control for a class of uncertain Markovian jump linear time-delay systems with generally uncertain transition rates (GUTRs). In this GUTR model, each transition rate can be completely unknown or only its estimate value is known. By making use of linear matrix inequalities technique, sufficient conditions are presented to derive the linear switching surface and guarantee the stochastic stability of sliding mode dynamics. A sliding mode control law is developed to drive the state trajectory of the closed-loop system to the specified linear switching surface in a finite-time interval in spite of the existing uncertainties, time delays and unknown transition rates. Finally, an example is presented to verify the validity of the proposed method.

MSC:
 93D21 Adaptive or robust stabilization 93E15 Stochastic stability in control theory 93B12 Variable structure systems 60J75 Jump processes (MSC2010)
Full Text:
References:
 [1] Utkin, V. I., Sliding modes in control and optimization, (1992), Springer Press · Zbl 0748.93044 [2] Edwards, C.; Spurgeon, S. K., Sliding mode control: theory and applications, (1998), Taylor and Francis Press [3] Xia, Y.; Chen, J.; Liu, G.; Wang, L.; Rees, D., Robust adaptive sliding mode control for uncertain time-delay systems, Internat. J. Adapt. Control, 23, 863-881, (2009) · Zbl 1298.93111 [4] Zhang, J.; Shi, P.; Xia, Y., Robust adaptive sliding mode control for fuzzy systems with mismatched uncertainties, IEEE Trans. Fuzzy Syst., 18, 700-711, (2010) [5] Lin, Z.; Xia, Y.; Shi, P.; Wu, H., Robust sliding mode control for uncertain linear discrete systems independent of time-delay, Int. J. Innov. Comput. Inf., 7, 869-881, (2011) [6] Chen, B.; Niu, Y.; Zou, Y., Sliding mode control for stochastic Markovian jumping systems with incomplete transition rate, IET Control Theory A, 10, 1330-1338, (2013) [7] Krasovskii, N. M.; Lidskii, E. A., Analytical design of controllers in systems with random attributes, Autom. Remote Control, 22, 1021-2025, (1961) [8] Boukas, E. K., Stochastic switching systems: analysis and design, (2005), Birkhäuser Press · Zbl 1108.93074 [9] Mao, X., Stability of stochastic differential equations with Markovian switching, Stochastic Process. Appl., 79, 45-67, (1999) · Zbl 0962.60043 [10] Kao, Y.; Xie, J.; Wang, C.; Karimi, H. R., Stabilisation of singular Markovian jump systems with generally uncertain transition rates, IEEE Trans. Automat. Control, 59, 2604-2610, (2014) · Zbl 1360.93743 [11] Kao, Y.; Wang, C.; Zha, F.; Cao, H., Stability in mean of partial variables for stochastic reaction-diffusion systems with Markovian switching, J. Franklin Inst., 351, 500-512, (2014) · Zbl 1293.93765 [12] Kao, Y.; Wang, C.; Hamid, H. R.; Bi, R., Global stability of coupled Markovian switching reaction-diffusion systems on networks, Nonlinear Anal. Hybrid Syst., 13, 61-73, (2014) · Zbl 1292.93140 [13] Kao, Y.; Wang, C.; Zhang, L., Delay-dependent exponential stability of impulsive Markovian jumping Cohen-Grossberg neural networks with reaction-diffusion and mixed delays, Neural Process. Lett., 38, 321-346, (2013) [14] Xu, S.; Chen, T.; Lam, J., Robust $$H_\infty$$ filtering for uncertain Markovian jump systems with mode-dependent time delays, IEEE Trans. Automat. Control, 48, 900-907, (2003) · Zbl 1364.93816 [15] Wu, Z.; Shi, P.; Su, H.; Chu, J., Stochastic synchronization of Markovian jump neural networks with time-varying delay using sampled-data, IEEE Trans. Sybern., 43, 1796-1806, (2013) [16] Wu, Z.; Shi, P.; Su, H.; Chu, J., Asynchronous $$l_2 - l_\infty$$ filtering for discrete-time stochastic Markov jump systems with randomly occurred sensor nonlinearities, Automatica, 50, 180-186, (2014) · Zbl 1417.93317 [17] Shi, P.; Xia, Y.; Liu, G.; Rees, D., On designing of sliding-mode control for stochastic jump systems, IEEE Trans. Automat. Control, 51, 97-103, (2006) · Zbl 1366.93682 [18] Ma, S.; Boukas, E. K., A singular system approach to robust sliding mode control for uncertain Markov jump systems, Automatica, 45, 2707-2713, (2009) · Zbl 1180.93025 [19] Niu, Y.; Ho, W. C.D.; Wang, X., Sliding mode control for Itô stochastic systems with Markovian switching, Automatica, 43, 1784-1790, (2007) · Zbl 1119.93063 [20] Wu, L.; Shi, P.; Gao, H., State estimation and sliding-mode control of Markovian jump singular systems, IEEE Trans. Automat. Control, 55, 1213-1219, (2010) · Zbl 1368.93696 [21] Karan, M.; Shi, P.; Kaya, C. Y., Transition probability bounds for the stochastic stability robustness of continuous and discrete-time Markovian jump linear systems, Automatica, 42, 2159-2168, (2006) · Zbl 1104.93056 [22] Xiong, J.; Lam, J.; Gao, H.; Daniel, W. C., On robust stabilization of Markovian jump systems with uncertain switching probabilities, Automatica, 41, 897-903, (2005) · Zbl 1093.93026 [23] Wei, Y.; Qiu, J.; Karimi, H. R.; Wang, M., A new design $$H_\infty$$ filtering for continuous-time Markovian jump systems with time-varying delay and partially accessible mode information, Signal Process., 93, 2392-2407, (2013) [24] Yin, Y.; Shi, P.; Liu, F.; Pan, J., Gain-scheduled fault detection on stochastic nonlinear systems with partially known transition jump rates, Nonlinear Anal. Real, 13, 359-369, (2012) · Zbl 1238.93126 [25] Zhang, L.; Boukas, E. K., Stability and stabilization of Markovian jump linear systems with partly unknown transition probabilities, Automatica, 45, 463-468, (2009) · Zbl 1158.93414 [26] Zhang, L.; Boukas, E. K.; Lamm, J., Analysis and synthesis of Markov jump linear systems with time-varying delays and partially known transition probabilities, IEEE Trans. Automat. Control, 53, 2458-2464, (2008) · Zbl 1367.93710 [27] Zhang, L.; Boukas, E. K.; Shi, P., $$H_\infty$$ model reduction for discrete-time Markov jump linear systems with partially known transition, Internat. J. Control, 82, 243-351, (2009) · Zbl 1168.93319 [28] Zhang, L.; Lam, J., Necessary and sufficient conditions for analysis and synthesis of Markov jump linear systems with incomplete transition descriptions, IEEE Trans. Automat. Control, 55, 1695-1701, (2010) · Zbl 1368.93782 [29] Guo, Y.; Wang, Z., Stability of Markovian jump systems with generally uncertain transition rates, J. Franklin Inst., 350, 2826-2836, (2013) · Zbl 1287.93106 [30] Petersen, I. R., A stabilization algorithm for a class of uncertain linear systems, Syst. Control Lett., 8, 351-357, (1987) · Zbl 0618.93056 [31] Xiang, Z.; Qiao, C.; Mahmoud, M. S., Finite-time analysis and $$H_\infty$$ control for switched stochastic systems, J. Franklin Inst., 349, 915-927, (2012) · Zbl 1273.93173 [32] Xiang, Z.; Qiao, C.; Mahmoud, M. S., Robust $$H_\infty$$ filtering for switched stochastic systems under asynchronous switching, J. Franklin Inst., 349, 1213-1230, (2012) · Zbl 1273.93165 [33] Chen, G.; Xiang, Z.; Mahmoud, M. S., Stability and $$H_\infty$$ performance analysis of switched stochastic neutral systems, Circuits Systems Signal Process., 32, 387-400, (2013)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.